./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/operators/bitwise_and_rational.sol_1_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:24,533 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:24,586 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da4e72b1-fc1a-48f2-b4df-fb753d377cf0/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:24,590 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:24,590 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:24,607 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:24,608 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:24,608 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:24,608 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:24,608 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:24,609 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:24,609 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:24,609 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:24,609 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:24,609 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:24,609 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:24,609 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:24,609 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:24,610 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:24,610 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:24,611 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:24,611 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:24,800 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:24,808 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:24,810 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:24,811 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:24,812 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:24,813 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da4e72b1-fc1a-48f2-b4df-fb753d377cf0/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/operators/bitwise_and_rational.sol_1_no_adts_000.smt2
[2025-05-07 17:25:24,813 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:24,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:25,031 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da4e72b1-fc1a-48f2-b4df-fb753d377cf0/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/operators/bitwise_and_rational.sol_1_no_adts_000.smt2
[2025-05-07 17:25:25,034 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:25,035 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:25,035 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:25,035 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:25,035 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:25,037 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,061 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25 Unit
[2025-05-07 17:25:25,061 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:25,062 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:25,062 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:25,062 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:25,073 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,074 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,093 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,093 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,096 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,097 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,098 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,099 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,100 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,109 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:25,110 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:25,110 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:25,110 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:25,111 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (1/1) ...
[2025-05-07 17:25:25,112 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:25,121 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:25,129 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:25:25,131 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:25:25,138 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:25,138 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_8_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_8_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_8_0
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_return_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_return_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_return_function_f__41_42_0
[2025-05-07 17:25:25,139 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_f_40_42_0 given in one single declaration
[2025-05-07 17:25:25,139 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_f_40_42_0
[2025-05-07 17:25:25,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_f_40_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_5_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure block_5_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_5_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_function_f__41_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_function_f__41_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_42_0
[2025-05-07 17:25:25,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_42_0
[2025-05-07 17:25:25,140 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_42_0 given in one single declaration
[2025-05-07 17:25:25,140 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_42_0
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_42_0
[2025-05-07 17:25:25,141 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_13_C_42_0 given in one single declaration
[2025-05-07 17:25:25,141 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_13_C_42_0
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_13_C_42_0
[2025-05-07 17:25:25,141 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_15_C_42_0 given in one single declaration
[2025-05-07 17:25:25,141 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_15_C_42_0
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_15_C_42_0
[2025-05-07 17:25:25,141 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_14_C_42_0 given in one single declaration
[2025-05-07 17:25:25,141 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_14_C_42_0
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_14_C_42_0
[2025-05-07 17:25:25,141 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_16_C_42_0 given in one single declaration
[2025-05-07 17:25:25,141 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_16_C_42_0
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_16_C_42_0
[2025-05-07 17:25:25,141 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:25,141 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:25,141 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:25,245 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:25,247 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:25,390 INFO  L?                        ?]: Removed 124 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:25,390 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:25,399 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:25,399 INFO  L312             CfgBuilder]: Removed 10 assume(true) statements.
[2025-05-07 17:25:25,399 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:25 BoogieIcfgContainer
[2025-05-07 17:25:25,399 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:25,401 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:25,401 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:25,404 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:25,404 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:25" (1/3) ...
[2025-05-07 17:25:25,405 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a72c0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:25, skipping insertion in model container
[2025-05-07 17:25:25,405 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:25" (2/3) ...
[2025-05-07 17:25:25,405 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a72c0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:25, skipping insertion in model container
[2025-05-07 17:25:25,405 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:25" (3/3) ...
[2025-05-07 17:25:25,406 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:25,417 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:25,418 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 19 procedures, 74 locations, 113 edges, 19 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:25,448 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:25,457 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72f66617, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:25,457 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:25,460 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 74 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 22 states have call successors, (26), 18 states have call predecessors, (26), 18 states have return successors, (26), 20 states have call predecessors, (26), 22 states have call successors, (26)
[2025-05-07 17:25:25,467 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:25,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:25,467 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:25,467 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:25,471 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:25,471 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574048359, now seen corresponding path program 1 times
[2025-05-07 17:25:25,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:25,477 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129757714]
[2025-05-07 17:25:25,477 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:25,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:25,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:25,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:25,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:25,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:25,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:25,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:25,655 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129757714]
[2025-05-07 17:25:25,655 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129757714] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:25,655 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:25,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-05-07 17:25:25,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687570854]
[2025-05-07 17:25:25,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:25,663 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-05-07 17:25:25,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:25,681 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-05-07 17:25:25,681 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:25,682 INFO  L87              Difference]: Start difference. First operand  has 74 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 22 states have call successors, (26), 18 states have call predecessors, (26), 18 states have return successors, (26), 20 states have call predecessors, (26), 22 states have call successors, (26) Second operand  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2025-05-07 17:25:25,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:25,708 INFO  L93              Difference]: Finished difference Result 63 states and 70 transitions.
[2025-05-07 17:25:25,708 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-05-07 17:25:25,709 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 51
[2025-05-07 17:25:25,709 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:25,714 INFO  L225             Difference]: With dead ends: 63
[2025-05-07 17:25:25,714 INFO  L226             Difference]: Without dead ends: 60
[2025-05-07 17:25:25,715 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:25,717 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:25,718 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:25,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-05-07 17:25:25,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2025-05-07 17:25:25,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 19 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (20), 17 states have call predecessors, (20), 19 states have call successors, (20)
[2025-05-07 17:25:25,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions.
[2025-05-07 17:25:25,763 INFO  L79                 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 51
[2025-05-07 17:25:25,764 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:25,765 INFO  L485      AbstractCegarLoop]: Abstraction has 60 states and 67 transitions.
[2025-05-07 17:25:25,765 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)
[2025-05-07 17:25:25,765 INFO  L278                IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions.
[2025-05-07 17:25:25,766 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:25,766 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:25,767 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:25,767 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:25,767 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:25,767 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:25,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -353761251, now seen corresponding path program 1 times
[2025-05-07 17:25:25,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:25,768 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816955255]
[2025-05-07 17:25:25,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:25,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:25,799 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:25,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:25,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:25,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:25,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:25,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:25,908 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816955255]
[2025-05-07 17:25:25,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816955255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:25,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:25,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:25,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351109258]
[2025-05-07 17:25:25,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:25,909 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:25,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:25,910 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:25,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:25,910 INFO  L87              Difference]: Start difference. First operand 60 states and 67 transitions. Second operand  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:25,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:25,923 INFO  L93              Difference]: Finished difference Result 64 states and 71 transitions.
[2025-05-07 17:25:25,923 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:25,924 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:25:25,924 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:25,925 INFO  L225             Difference]: With dead ends: 64
[2025-05-07 17:25:25,925 INFO  L226             Difference]: Without dead ends: 60
[2025-05-07 17:25:25,925 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:25,926 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:25,926 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:25,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-05-07 17:25:25,930 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58.
[2025-05-07 17:25:25,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 17 states have call successors, (18), 15 states have call predecessors, (18), 15 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18)
[2025-05-07 17:25:25,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions.
[2025-05-07 17:25:25,932 INFO  L79                 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 51
[2025-05-07 17:25:25,932 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:25,932 INFO  L485      AbstractCegarLoop]: Abstraction has 58 states and 62 transitions.
[2025-05-07 17:25:25,932 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:25,932 INFO  L278                IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions.
[2025-05-07 17:25:25,933 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:25,933 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:25,933 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:25,933 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:25,933 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:25,934 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:25,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416426429, now seen corresponding path program 1 times
[2025-05-07 17:25:25,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:25,934 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894653860]
[2025-05-07 17:25:25,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:25,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:25,960 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:25,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:25,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:25,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:26,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:26,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:26,069 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894653860]
[2025-05-07 17:25:26,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894653860] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:26,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:26,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:26,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855451321]
[2025-05-07 17:25:26,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:26,070 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:26,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:26,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:26,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:26,071 INFO  L87              Difference]: Start difference. First operand 58 states and 62 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:26,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:26,103 INFO  L93              Difference]: Finished difference Result 63 states and 68 transitions.
[2025-05-07 17:25:26,103 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:26,103 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:25:26,104 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:26,104 INFO  L225             Difference]: With dead ends: 63
[2025-05-07 17:25:26,104 INFO  L226             Difference]: Without dead ends: 63
[2025-05-07 17:25:26,104 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:26,105 INFO  L437           NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:26,105 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 306 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:26,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2025-05-07 17:25:26,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2025-05-07 17:25:26,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 18 states have call successors, (19), 15 states have call predecessors, (19), 17 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21)
[2025-05-07 17:25:26,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions.
[2025-05-07 17:25:26,110 INFO  L79                 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 51
[2025-05-07 17:25:26,110 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:26,110 INFO  L485      AbstractCegarLoop]: Abstraction has 63 states and 68 transitions.
[2025-05-07 17:25:26,110 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:26,110 INFO  L278                IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions.
[2025-05-07 17:25:26,111 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:26,111 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:26,111 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:26,111 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:25:26,111 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:26,112 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:26,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -1843804135, now seen corresponding path program 1 times
[2025-05-07 17:25:26,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:26,112 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119880300]
[2025-05-07 17:25:26,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:26,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:26,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:26,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:26,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:26,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:26,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:26,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:26,302 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119880300]
[2025-05-07 17:25:26,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119880300] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:26,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:26,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:25:26,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537698571]
[2025-05-07 17:25:26,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:26,303 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:25:26,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:26,306 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:25:26,307 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:26,307 INFO  L87              Difference]: Start difference. First operand 63 states and 68 transitions. Second operand  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:25:26,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:26,369 INFO  L93              Difference]: Finished difference Result 57 states and 62 transitions.
[2025-05-07 17:25:26,369 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:25:26,369 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 51
[2025-05-07 17:25:26,370 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:26,370 INFO  L225             Difference]: With dead ends: 57
[2025-05-07 17:25:26,370 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:25:26,370 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:26,371 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:26,371 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:26,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:25:26,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:25:26,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:25:26,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:25:26,372 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51
[2025-05-07 17:25:26,372 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:26,372 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:25:26,372 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14)
[2025-05-07 17:25:26,372 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:25:26,372 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:25:26,374 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:25:26,375 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:25:26,377 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2025-05-07 17:25:26,379 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:25:26,381 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:25:26 BoogieIcfgContainer
[2025-05-07 17:25:26,381 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:25:26,382 INFO  L158              Benchmark]: Toolchain (without parser) took 1347.18ms. Allocated memory is still 234.9MB. Free memory was 156.3MB in the beginning and 188.3MB in the end (delta: -32.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:26,382 INFO  L158              Benchmark]: SmtParser took 0.30ms. Allocated memory is still 234.9MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:26,382 INFO  L158              Benchmark]: ChcToBoogie took 26.28ms. Allocated memory is still 234.9MB. Free memory was 156.3MB in the beginning and 154.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:26,382 INFO  L158              Benchmark]: Boogie Preprocessor took 47.65ms. Allocated memory is still 234.9MB. Free memory was 154.0MB in the beginning and 151.1MB in the end (delta: 2.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:25:26,382 INFO  L158              Benchmark]: RCFGBuilder took 289.69ms. Allocated memory is still 234.9MB. Free memory was 151.1MB in the beginning and 126.4MB in the end (delta: 24.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:25:26,383 INFO  L158              Benchmark]: TraceAbstraction took 980.09ms. Allocated memory is still 234.9MB. Free memory was 125.7MB in the beginning and 188.3MB in the end (delta: -62.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:26,383 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.30ms. Allocated memory is still 234.9MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 26.28ms. Allocated memory is still 234.9MB. Free memory was 156.3MB in the beginning and 154.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 47.65ms. Allocated memory is still 234.9MB. Free memory was 154.0MB in the beginning and 151.1MB in the end (delta: 2.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * RCFGBuilder took 289.69ms. Allocated memory is still 234.9MB. Free memory was 151.1MB in the beginning and 126.4MB in the end (delta: 24.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 980.09ms. Allocated memory is still 234.9MB. Free memory was 125.7MB in the beginning and 188.3MB in the end (delta: -62.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 19 procedures, 74 locations, 113 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 872 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 618 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 254 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:25:26,394 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
