./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:23,899 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:23,945 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e2ac3f2-f6a4-4a87-b410-bae0344c01bd/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:23,948 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:23,948 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:23,960 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:23,961 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:23,961 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:23,961 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:23,961 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:23,961 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:23,961 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:23,962 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:23,962 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:23,962 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:23,962 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:23,963 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:23,963 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:24,144 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:24,152 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:24,154 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:24,156 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:24,156 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:24,157 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e2ac3f2-f6a4-4a87-b410-bae0344c01bd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls.sol_1_no_adts_000.smt2
[2025-05-07 17:28:24,158 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:24,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:24,420 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e2ac3f2-f6a4-4a87-b410-bae0344c01bd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls.sol_1_no_adts_000.smt2
[2025-05-07 17:28:24,423 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:24,424 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:24,425 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:24,425 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:24,425 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:24,427 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,464 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24 Unit
[2025-05-07 17:28:24,464 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:24,465 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:24,465 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:24,465 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:24,481 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,481 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,505 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,505 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,510 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,511 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,513 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,514 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,515 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,529 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:24,529 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:24,529 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:24,529 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:24,530 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (1/1) ...
[2025-05-07 17:28:24,532 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:24,540 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:24,549 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:28:24,551 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:28:24,558 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:24,558 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:24,558 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:24,558 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:28:24,559 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:28:24,559 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:28:24,559 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,559 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__44_45_0
[2025-05-07 17:28:24,559 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__44_45_0
[2025-05-07 17:28:24,559 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,559 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_f__44_45_0
[2025-05-07 17:28:24,559 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_f__44_45_0
[2025-05-07 17:28:24,559 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,559 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,560 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,560 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f__44_45_0
[2025-05-07 17:28:24,560 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_17_0 given in one single declaration
[2025-05-07 17:28:24,560 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_17_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_17_0
[2025-05-07 17:28:24,561 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_6_C_45_0 given in one single declaration
[2025-05-07 17:28:24,561 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_6_C_45_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_6_C_45_0
[2025-05-07 17:28:24,561 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_f_43_45_0 given in one single declaration
[2025-05-07 17:28:24,561 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_f_43_45_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_f_43_45_0
[2025-05-07 17:28:24,561 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,561 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f__44_45_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f__44_45_0
[2025-05-07 17:28:24,561 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_return_function_f__44_45_0 given in one single declaration
[2025-05-07 17:28:24,561 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_return_function_f__44_45_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_return_function_f__44_45_0
[2025-05-07 17:28:24,561 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_C_45_0 given in one single declaration
[2025-05-07 17:28:24,561 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_C_45_0
[2025-05-07 17:28:24,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_45_0 given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_45_0
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_21_C_45_0 given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_21_C_45_0
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_21_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_23_C_45_0 given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_23_C_45_0
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_23_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_22_C_45_0 given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_22_C_45_0
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_22_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_24_C_45_0 given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_24_C_45_0
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_24_C_45_0
[2025-05-07 17:28:24,562 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:24,562 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:24,562 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:24,682 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:24,685 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:24,897 INFO  L?                        ?]: Removed 153 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:24,897 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:24,908 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:24,908 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-05-07 17:28:24,909 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:24 BoogieIcfgContainer
[2025-05-07 17:28:24,909 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:24,911 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:24,911 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:24,915 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:24,915 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:24" (1/3) ...
[2025-05-07 17:28:24,915 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375e46c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:24, skipping insertion in model container
[2025-05-07 17:28:24,916 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:24" (2/3) ...
[2025-05-07 17:28:24,916 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375e46c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:24, skipping insertion in model container
[2025-05-07 17:28:24,916 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:24" (3/3) ...
[2025-05-07 17:28:24,917 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:24,931 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:24,934 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 19 procedures, 79 locations, 126 edges, 19 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:24,973 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:24,982 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;@3ff32b3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:24,983 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:24,986 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30)
[2025-05-07 17:28:24,995 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:28:24,995 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:24,996 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, 1, 1, 1, 1]
[2025-05-07 17:28:24,996 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,001 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 435653605, now seen corresponding path program 1 times
[2025-05-07 17:28:25,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,008 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717003656]
[2025-05-07 17:28:25,009 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:28:25,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:28:25,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,297 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:28:25,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,297 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717003656]
[2025-05-07 17:28:25,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717003656] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:25,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794814565]
[2025-05-07 17:28:25,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,306 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:25,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,340 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:25,340 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:25,342 INFO  L87              Difference]: Start difference. First operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:28:25,380 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,381 INFO  L93              Difference]: Finished difference Result 81 states and 98 transitions.
[2025-05-07 17:28:25,382 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:25,387 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 55
[2025-05-07 17:28:25,388 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,396 INFO  L225             Difference]: With dead ends: 81
[2025-05-07 17:28:25,396 INFO  L226             Difference]: Without dead ends: 77
[2025-05-07 17:28:25,398 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:28:25,401 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 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:28:25,402 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-05-07 17:28:25,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75.
[2025-05-07 17:28:25,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 26 states have call successors, (28), 18 states have call predecessors, (28), 18 states have return successors, (28), 24 states have call predecessors, (28), 26 states have call successors, (28)
[2025-05-07 17:28:25,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions.
[2025-05-07 17:28:25,445 INFO  L79                 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 55
[2025-05-07 17:28:25,446 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,446 INFO  L485      AbstractCegarLoop]: Abstraction has 75 states and 89 transitions.
[2025-05-07 17:28:25,446 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:28:25,446 INFO  L278                IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions.
[2025-05-07 17:28:25,449 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:28:25,449 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,449 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, 1, 1, 1, 1]
[2025-05-07 17:28:25,449 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:25,449 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,450 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 283126249, now seen corresponding path program 1 times
[2025-05-07 17:28:25,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,450 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260316372]
[2025-05-07 17:28:25,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,484 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:28:25,519 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:28:25,519 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,647 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:28:25,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,647 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260316372]
[2025-05-07 17:28:25,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260316372] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:25,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566208011]
[2025-05-07 17:28:25,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,648 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:25,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:25,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:25,649 INFO  L87              Difference]: Start difference. First operand 75 states and 89 transitions. Second operand  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:28:25,701 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:25,701 INFO  L93              Difference]: Finished difference Result 81 states and 98 transitions.
[2025-05-07 17:28:25,701 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:25,702 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 55
[2025-05-07 17:28:25,702 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:25,703 INFO  L225             Difference]: With dead ends: 81
[2025-05-07 17:28:25,703 INFO  L226             Difference]: Without dead ends: 81
[2025-05-07 17:28:25,704 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:25,704 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:25,705 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 329 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:25,705 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-05-07 17:28:25,713 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2025-05-07 17:28:25,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (28), 18 states have call predecessors, (28), 20 states have return successors, (33), 25 states have call predecessors, (33), 26 states have call successors, (33)
[2025-05-07 17:28:25,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions.
[2025-05-07 17:28:25,715 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 55
[2025-05-07 17:28:25,716 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:25,716 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 96 transitions.
[2025-05-07 17:28:25,716 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:28:25,716 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions.
[2025-05-07 17:28:25,718 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:28:25,718 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:25,718 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, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:25,718 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:25,718 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:25,719 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:25,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -870582776, now seen corresponding path program 1 times
[2025-05-07 17:28:25,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:25,719 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147877739]
[2025-05-07 17:28:25,719 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:25,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:25,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:28:25,757 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:28:25,757 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:25,757 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:25,989 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:28:25,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:25,989 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147877739]
[2025-05-07 17:28:25,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147877739] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:25,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:25,990 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:25,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263336430]
[2025-05-07 17:28:25,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:25,990 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:25,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:25,991 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:25,991 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:25,991 INFO  L87              Difference]: Start difference. First operand 79 states and 96 transitions. Second operand  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:28:26,033 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,033 INFO  L93              Difference]: Finished difference Result 79 states and 95 transitions.
[2025-05-07 17:28:26,033 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:26,034 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:28:26,034 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,035 INFO  L225             Difference]: With dead ends: 79
[2025-05-07 17:28:26,035 INFO  L226             Difference]: Without dead ends: 79
[2025-05-07 17:28:26,035 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:26,035 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,036 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 325 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2025-05-07 17:28:26,040 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2025-05-07 17:28:26,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (28), 18 states have call predecessors, (28), 20 states have return successors, (32), 25 states have call predecessors, (32), 26 states have call successors, (32)
[2025-05-07 17:28:26,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions.
[2025-05-07 17:28:26,041 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 58
[2025-05-07 17:28:26,041 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,041 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 95 transitions.
[2025-05-07 17:28:26,041 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:28:26,041 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions.
[2025-05-07 17:28:26,042 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:28:26,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,043 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, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:26,043 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:26,043 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,043 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 1951538184, now seen corresponding path program 1 times
[2025-05-07 17:28:26,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,043 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845683533]
[2025-05-07 17:28:26,043 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:28:26,080 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:28:26,080 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,080 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,190 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:28:26,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,190 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845683533]
[2025-05-07 17:28:26,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845683533] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:26,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7588687]
[2025-05-07 17:28:26,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,191 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:26,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,192 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:26,192 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:26,192 INFO  L87              Difference]: Start difference. First operand 79 states and 95 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:26,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,235 INFO  L93              Difference]: Finished difference Result 84 states and 102 transitions.
[2025-05-07 17:28:26,236 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:26,236 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:28:26,236 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,237 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:28:26,237 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:28:26,238 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:28:26,238 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,239 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 438 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:28:26,245 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:28:26,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (36), 28 states have call predecessors, (36), 27 states have call successors, (36)
[2025-05-07 17:28:26,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2025-05-07 17:28:26,247 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58
[2025-05-07 17:28:26,247 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,247 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2025-05-07 17:28:26,248 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:26,248 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2025-05-07 17:28:26,249 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:28:26,249 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,249 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, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:26,250 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:26,250 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,250 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,250 INFO  L85        PathProgramCache]: Analyzing trace with hash 2064569800, now seen corresponding path program 1 times
[2025-05-07 17:28:26,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,250 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132756917]
[2025-05-07 17:28:26,250 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:28:26,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:28:26,283 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,283 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,594 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:28:26,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,594 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132756917]
[2025-05-07 17:28:26,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132756917] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:28:26,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946308093]
[2025-05-07 17:28:26,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,595 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:28:26,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,595 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:28:26,595 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:26,596 INFO  L87              Difference]: Start difference. First operand 84 states and 102 transitions. Second operand  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:28:26,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,630 INFO  L93              Difference]: Finished difference Result 84 states and 101 transitions.
[2025-05-07 17:28:26,630 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:26,630 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:28:26,631 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,632 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:28:26,632 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:28:26,632 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:26,632 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,633 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 329 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:28:26,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:28:26,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35)
[2025-05-07 17:28:26,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions.
[2025-05-07 17:28:26,640 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 58
[2025-05-07 17:28:26,640 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,640 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 101 transitions.
[2025-05-07 17:28:26,640 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:28:26,640 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions.
[2025-05-07 17:28:26,641 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:28:26,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,642 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28:26,642 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:26,642 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,642 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -252558164, now seen corresponding path program 1 times
[2025-05-07 17:28:26,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,643 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112837724]
[2025-05-07 17:28:26,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,676 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:28:26,695 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:28:26,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:28:26,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,856 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112837724]
[2025-05-07 17:28:26,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112837724] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:26,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650124344]
[2025-05-07 17:28:26,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,856 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:26,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:26,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:26,857 INFO  L87              Difference]: Start difference. First operand 84 states and 101 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:28:26,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,953 INFO  L93              Difference]: Finished difference Result 91 states and 114 transitions.
[2025-05-07 17:28:26,954 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:26,954 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 87
[2025-05-07 17:28:26,954 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,955 INFO  L225             Difference]: With dead ends: 91
[2025-05-07 17:28:26,955 INFO  L226             Difference]: Without dead ends: 91
[2025-05-07 17:28:26,956 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:26,956 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,956 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 542 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:26,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-05-07 17:28:26,963 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89.
[2025-05-07 17:28:26,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 28 states have call successors, (30), 18 states have call predecessors, (30), 24 states have return successors, (43), 31 states have call predecessors, (43), 28 states have call successors, (43)
[2025-05-07 17:28:26,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions.
[2025-05-07 17:28:26,965 INFO  L79                 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 87
[2025-05-07 17:28:26,965 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,965 INFO  L485      AbstractCegarLoop]: Abstraction has 89 states and 112 transitions.
[2025-05-07 17:28:26,965 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:28:26,965 INFO  L278                IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions.
[2025-05-07 17:28:26,966 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:28:26,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,967 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1]
[2025-05-07 17:28:26,967 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:26,967 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,967 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -1186062747, now seen corresponding path program 1 times
[2025-05-07 17:28:26,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,967 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020813183]
[2025-05-07 17:28:26,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:28:27,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:28:27,014 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,014 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:28:27,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,805 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020813183]
[2025-05-07 17:28:27,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020813183] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:27,805 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579876990]
[2025-05-07 17:28:27,805 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:27,808 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:27,810 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:27,811 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:28:28,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:28:28,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:28:28,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,199 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 60 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:28,206 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:28,235 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:28,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-05-07 17:28:28,446 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:30,342 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:30,569 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:30,656 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:30,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:28:30,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579876990] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:30,747 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:30,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 25
[2025-05-07 17:28:30,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689215144]
[2025-05-07 17:28:30,747 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:30,747 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-05-07 17:28:30,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:30,748 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-05-07 17:28:30,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:28:30,749 INFO  L87              Difference]: Start difference. First operand 89 states and 112 transitions. Second operand  has 25 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 18 states have internal predecessors, (46), 16 states have call successors, (35), 2 states have call predecessors, (35), 13 states have return successors, (41), 19 states have call predecessors, (41), 16 states have call successors, (41)
[2025-05-07 17:28:31,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,038 INFO  L93              Difference]: Finished difference Result 104 states and 140 transitions.
[2025-05-07 17:28:31,039 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:31,039 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 18 states have internal predecessors, (46), 16 states have call successors, (35), 2 states have call predecessors, (35), 13 states have return successors, (41), 19 states have call predecessors, (41), 16 states have call successors, (41) Word has length 90
[2025-05-07 17:28:31,039 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,040 INFO  L225             Difference]: With dead ends: 104
[2025-05-07 17:28:31,040 INFO  L226             Difference]: Without dead ends: 104
[2025-05-07 17:28:31,041 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812
[2025-05-07 17:28:31,042 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 11 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,042 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1152 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:31,043 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-05-07 17:28:31,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102.
[2025-05-07 17:28:31,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 31 states have call successors, (33), 18 states have call predecessors, (33), 29 states have return successors, (58), 39 states have call predecessors, (58), 31 states have call successors, (58)
[2025-05-07 17:28:31,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions.
[2025-05-07 17:28:31,052 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 90
[2025-05-07 17:28:31,053 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,053 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 135 transitions.
[2025-05-07 17:28:31,053 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 18 states have internal predecessors, (46), 16 states have call successors, (35), 2 states have call predecessors, (35), 13 states have return successors, (41), 19 states have call predecessors, (41), 16 states have call successors, (41)
[2025-05-07 17:28:31,053 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions.
[2025-05-07 17:28:31,054 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:28:31,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:31,055 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1]
[2025-05-07 17:28:31,061 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:31,255 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-05-07 17:28:31,255 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:31,256 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:31,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 649348773, now seen corresponding path program 1 times
[2025-05-07 17:28:31,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:31,256 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596976826]
[2025-05-07 17:28:31,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:31,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:31,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:28:31,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:28:31,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:31,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-05-07 17:28:31,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:31,397 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596976826]
[2025-05-07 17:28:31,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596976826] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:31,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:31,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:31,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223718982]
[2025-05-07 17:28:31,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:31,398 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:31,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:31,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:31,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:31,398 INFO  L87              Difference]: Start difference. First operand 102 states and 135 transitions. Second operand  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:31,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,436 INFO  L93              Difference]: Finished difference Result 107 states and 142 transitions.
[2025-05-07 17:28:31,436 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:31,436 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 90
[2025-05-07 17:28:31,436 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,437 INFO  L225             Difference]: With dead ends: 107
[2025-05-07 17:28:31,437 INFO  L226             Difference]: Without dead ends: 107
[2025-05-07 17:28:31,437 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:28:31,438 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,438 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 443 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:31,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2025-05-07 17:28:31,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2025-05-07 17:28:31,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 32 states have call successors, (34), 18 states have call predecessors, (34), 31 states have return successors, (62), 42 states have call predecessors, (62), 32 states have call successors, (62)
[2025-05-07 17:28:31,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions.
[2025-05-07 17:28:31,443 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 90
[2025-05-07 17:28:31,443 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,443 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 142 transitions.
[2025-05-07 17:28:31,444 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:31,444 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions.
[2025-05-07 17:28:31,444 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:28:31,444 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:31,445 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1]
[2025-05-07 17:28:31,445 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:31,445 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:31,445 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:31,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1236085649, now seen corresponding path program 1 times
[2025-05-07 17:28:31,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:31,445 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781589144]
[2025-05-07 17:28:31,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:31,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:31,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:28:31,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:28:31,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:31,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-05-07 17:28:31,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:31,629 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781589144]
[2025-05-07 17:28:31,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781589144] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:31,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:31,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:31,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109983111]
[2025-05-07 17:28:31,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:31,629 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:31,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:31,630 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:31,630 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:31,630 INFO  L87              Difference]: Start difference. First operand 107 states and 142 transitions. Second operand  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:31,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,704 INFO  L93              Difference]: Finished difference Result 117 states and 165 transitions.
[2025-05-07 17:28:31,704 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:31,704 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 5 states have call successors, (28) Word has length 119
[2025-05-07 17:28:31,704 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,705 INFO  L225             Difference]: With dead ends: 117
[2025-05-07 17:28:31,705 INFO  L226             Difference]: Without dead ends: 117
[2025-05-07 17:28:31,706 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:31,706 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,706 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 595 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:31,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-05-07 17:28:31,713 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112.
[2025-05-07 17:28:31,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 33 states have call successors, (35), 18 states have call predecessors, (35), 33 states have return successors, (75), 45 states have call predecessors, (75), 33 states have call successors, (75)
[2025-05-07 17:28:31,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions.
[2025-05-07 17:28:31,715 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 119
[2025-05-07 17:28:31,716 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,716 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 158 transitions.
[2025-05-07 17:28:31,716 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:31,716 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions.
[2025-05-07 17:28:31,718 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:28:31,718 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:31,718 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2025-05-07 17:28:31,718 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:31,718 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:31,718 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:31,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -1328377342, now seen corresponding path program 1 times
[2025-05-07 17:28:31,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:31,719 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245362307]
[2025-05-07 17:28:31,719 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:31,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:31,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:28:31,753 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:31,753 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:31,753 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:31,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2025-05-07 17:28:31,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:31,871 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245362307]
[2025-05-07 17:28:31,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245362307] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:31,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:31,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:31,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798015036]
[2025-05-07 17:28:31,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:31,872 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:31,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:31,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:31,872 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:31,873 INFO  L87              Difference]: Start difference. First operand 112 states and 158 transitions. Second operand  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 7 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:28:31,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:31,935 INFO  L93              Difference]: Finished difference Result 112 states and 157 transitions.
[2025-05-07 17:28:31,935 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:31,935 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 7 states have call predecessors, (31), 6 states have call successors, (31) Word has length 122
[2025-05-07 17:28:31,936 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:31,936 INFO  L225             Difference]: With dead ends: 112
[2025-05-07 17:28:31,936 INFO  L226             Difference]: Without dead ends: 112
[2025-05-07 17:28:31,937 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:31,937 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:31,937 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 633 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:31,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2025-05-07 17:28:31,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112.
[2025-05-07 17:28:31,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 33 states have call successors, (35), 18 states have call predecessors, (35), 33 states have return successors, (74), 45 states have call predecessors, (74), 33 states have call successors, (74)
[2025-05-07 17:28:31,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions.
[2025-05-07 17:28:31,944 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 122
[2025-05-07 17:28:31,945 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:31,945 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 157 transitions.
[2025-05-07 17:28:31,945 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 7 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:28:31,945 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions.
[2025-05-07 17:28:31,946 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:28:31,946 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:31,947 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28:31,947 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:31,947 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:31,947 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:31,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -1669693438, now seen corresponding path program 2 times
[2025-05-07 17:28:31,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:31,947 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626980616]
[2025-05-07 17:28:31,948 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:31,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:31,976 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes.
[2025-05-07 17:28:32,000 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:32,001 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:32,001 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:33,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-05-07 17:28:33,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:33,281 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626980616]
[2025-05-07 17:28:33,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626980616] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:33,281 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720827249]
[2025-05-07 17:28:33,281 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:33,281 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:33,284 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:33,285 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:33,286 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:28:33,501 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes.
[2025-05-07 17:28:33,648 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:33,648 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:33,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:33,653 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 87 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:33,658 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:33,661 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:33,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-05-07 17:28:33,971 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:37,871 INFO  L325             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2025-05-07 17:28:37,872 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12
[2025-05-07 17:28:38,594 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-05-07 17:28:38,872 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:39,217 INFO  L325             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2025-05-07 17:28:39,217 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12
[2025-05-07 17:28:39,417 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:39,495 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:39,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:28:39,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [720827249] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:39,596 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:39,597 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 33
[2025-05-07 17:28:39,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193818283]
[2025-05-07 17:28:39,597 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:39,597 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-05-07 17:28:39,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:39,598 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-05-07 17:28:39,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056
[2025-05-07 17:28:39,599 INFO  L87              Difference]: Start difference. First operand 112 states and 157 transitions. Second operand  has 33 states, 17 states have (on average 3.0) internal successors, (51), 23 states have internal predecessors, (51), 20 states have call successors, (39), 2 states have call predecessors, (39), 17 states have return successors, (52), 26 states have call predecessors, (52), 20 states have call successors, (52)
[2025-05-07 17:28:40,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:40,044 INFO  L93              Difference]: Finished difference Result 127 states and 191 transitions.
[2025-05-07 17:28:40,044 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-05-07 17:28:40,045 INFO  L79                 Accepts]: Start accepts. Automaton has  has 33 states, 17 states have (on average 3.0) internal successors, (51), 23 states have internal predecessors, (51), 20 states have call successors, (39), 2 states have call predecessors, (39), 17 states have return successors, (52), 26 states have call predecessors, (52), 20 states have call successors, (52) Word has length 122
[2025-05-07 17:28:40,045 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:40,046 INFO  L225             Difference]: With dead ends: 127
[2025-05-07 17:28:40,046 INFO  L226             Difference]: Without dead ends: 127
[2025-05-07 17:28:40,046 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406
[2025-05-07 17:28:40,046 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 15 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:40,046 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1296 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:40,047 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-05-07 17:28:40,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112.
[2025-05-07 17:28:40,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 33 states have call successors, (35), 18 states have call predecessors, (35), 33 states have return successors, (74), 45 states have call predecessors, (74), 33 states have call successors, (74)
[2025-05-07 17:28:40,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions.
[2025-05-07 17:28:40,053 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 122
[2025-05-07 17:28:40,053 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:40,053 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 157 transitions.
[2025-05-07 17:28:40,053 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 17 states have (on average 3.0) internal successors, (51), 23 states have internal predecessors, (51), 20 states have call successors, (39), 2 states have call predecessors, (39), 17 states have return successors, (52), 26 states have call predecessors, (52), 20 states have call successors, (52)
[2025-05-07 17:28:40,053 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions.
[2025-05-07 17:28:40,054 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-05-07 17:28:40,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:40,055 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:28:40,060 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:28:40,255 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:40,256 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:40,257 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:40,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -1524317153, now seen corresponding path program 2 times
[2025-05-07 17:28:40,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:40,257 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350387467]
[2025-05-07 17:28:40,257 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:40,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:40,333 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes.
[2025-05-07 17:28:40,355 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements.
[2025-05-07 17:28:40,355 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:40,355 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:40,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-05-07 17:28:40,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:40,462 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350387467]
[2025-05-07 17:28:40,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350387467] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:40,462 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620029446]
[2025-05-07 17:28:40,462 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:40,462 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:40,464 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:40,466 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:40,466 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:28:40,845 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes.
[2025-05-07 17:28:41,039 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements.
[2025-05-07 17:28:41,039 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:41,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:41,045 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:41,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:41,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-05-07 17:28:41,090 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:42,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-05-07 17:28:42,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620029446] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:42,245 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:42,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12
[2025-05-07 17:28:42,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362755966]
[2025-05-07 17:28:42,246 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:42,246 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:28:42,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:42,247 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:28:42,247 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:28:42,247 INFO  L87              Difference]: Start difference. First operand 112 states and 157 transitions. Second operand  has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 10 states have call successors, (38), 2 states have call predecessors, (38), 10 states have return successors, (45), 12 states have call predecessors, (45), 10 states have call successors, (45)
[2025-05-07 17:28:42,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:42,314 INFO  L93              Difference]: Finished difference Result 128 states and 182 transitions.
[2025-05-07 17:28:42,314 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:42,314 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 10 states have call successors, (38), 2 states have call predecessors, (38), 10 states have return successors, (45), 12 states have call predecessors, (45), 10 states have call successors, (45) Word has length 154
[2025-05-07 17:28:42,314 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:42,315 INFO  L225             Difference]: With dead ends: 128
[2025-05-07 17:28:42,315 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:28:42,315 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:42,316 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:42,316 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 746 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:42,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:28:42,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120.
[2025-05-07 17:28:42,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 51 states have internal predecessors, (51), 35 states have call successors, (37), 18 states have call predecessors, (37), 36 states have return successors, (80), 50 states have call predecessors, (80), 35 states have call successors, (80)
[2025-05-07 17:28:42,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions.
[2025-05-07 17:28:42,321 INFO  L79                 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 154
[2025-05-07 17:28:42,321 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:42,321 INFO  L485      AbstractCegarLoop]: Abstraction has 120 states and 168 transitions.
[2025-05-07 17:28:42,321 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 4.9) internal successors, (49), 12 states have internal predecessors, (49), 10 states have call successors, (38), 2 states have call predecessors, (38), 10 states have return successors, (45), 12 states have call predecessors, (45), 10 states have call successors, (45)
[2025-05-07 17:28:42,321 INFO  L278                IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions.
[2025-05-07 17:28:42,322 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-05-07 17:28:42,322 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,322 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:28:42,328 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:28:42,523 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:42,523 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,524 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 123407519, now seen corresponding path program 3 times
[2025-05-07 17:28:42,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,525 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076579038]
[2025-05-07 17:28:42,525 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:42,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,605 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 6 equivalence classes.
[2025-05-07 17:28:42,622 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 100 of 154 statements.
[2025-05-07 17:28:42,622 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-05-07 17:28:42,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-05-07 17:28:42,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,714 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076579038]
[2025-05-07 17:28:42,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076579038] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:42,714 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285847215]
[2025-05-07 17:28:42,714 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:42,714 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:42,716 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:42,718 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:42,718 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:28:43,060 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 6 equivalence classes.
[2025-05-07 17:28:43,176 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 100 of 154 statements.
[2025-05-07 17:28:43,177 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-05-07 17:28:43,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,181 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:43,185 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:43,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 107 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2025-05-07 17:28:43,254 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:44,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-05-07 17:28:44,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [285847215] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:44,808 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:44,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14
[2025-05-07 17:28:44,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135569278]
[2025-05-07 17:28:44,809 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,809 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:44,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,809 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:44,809 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:44,810 INFO  L87              Difference]: Start difference. First operand 120 states and 168 transitions. Second operand  has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (40), 2 states have call predecessors, (40), 12 states have return successors, (51), 12 states have call predecessors, (51), 10 states have call successors, (51)
[2025-05-07 17:28:44,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,915 INFO  L93              Difference]: Finished difference Result 97 states and 124 transitions.
[2025-05-07 17:28:44,915 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:28:44,915 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (40), 2 states have call predecessors, (40), 12 states have return successors, (51), 12 states have call predecessors, (51), 10 states have call successors, (51) Word has length 154
[2025-05-07 17:28:44,915 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,915 INFO  L225             Difference]: With dead ends: 97
[2025-05-07 17:28:44,915 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:44,916 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 297 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:44,916 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:44,916 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 924 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:44,916 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:44,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:44,916 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:28:44,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:44,917 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154
[2025-05-07 17:28:44,917 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,917 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:44,917 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.416666666666667) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (40), 2 states have call predecessors, (40), 12 states have return successors, (51), 12 states have call predecessors, (51), 10 states have call successors, (51)
[2025-05-07 17:28:44,917 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:44,917 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:44,919 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:44,924 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-05-07 17:28:45,119 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-05-07 17:28:45,130 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,136 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:45,145 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:45 BoogieIcfgContainer
[2025-05-07 17:28:45,145 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:45,147 INFO  L158              Benchmark]: Toolchain (without parser) took 20722.43ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 154.0MB in the beginning and 130.4MB in the end (delta: 23.6MB). Peak memory consumption was 146.9MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,148 INFO  L158              Benchmark]: SmtParser took 0.21ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:45,148 INFO  L158              Benchmark]: ChcToBoogie took 39.84ms. Allocated memory is still 234.9MB. Free memory was 153.9MB in the beginning and 151.3MB in the end (delta: 2.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,149 INFO  L158              Benchmark]: Boogie Preprocessor took 63.68ms. Allocated memory is still 234.9MB. Free memory was 151.3MB in the beginning and 148.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:45,149 INFO  L158              Benchmark]: RCFGBuilder took 379.76ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 192.5MB in the end (delta: -44.3MB). Peak memory consumption was 42.5MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,150 INFO  L158              Benchmark]: TraceAbstraction took 20234.61ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 192.1MB in the beginning and 130.4MB in the end (delta: 61.7MB). Peak memory consumption was 171.5MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,152 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.21ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 39.84ms. Allocated memory is still 234.9MB. Free memory was 153.9MB in the beginning and 151.3MB in the end (delta: 2.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 63.68ms. Allocated memory is still 234.9MB. Free memory was 151.3MB in the beginning and 148.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 379.76ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 192.5MB in the end (delta: -44.3MB). Peak memory consumption was 42.5MB. Max. memory is 33.6GB.
 * TraceAbstraction took 20234.61ms. Allocated memory was 234.9MB in the beginning and 352.3MB in the end (delta: 117.4MB). Free memory was 192.1MB in the beginning and 130.4MB in the end (delta: 61.7MB). Peak memory consumption was 171.5MB. 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, 79 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 8027 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6880 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 1147 mSDtfsCounter, 1300 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 1030 SyntacticMatches, 11 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1742 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2241 ConstructedInterpolants, 0 QuantifiedInterpolants, 4128 SizeOfPredicates, 59 NumberOfNonLiveVariables, 6049 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 1624/1728 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:28:45,169 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
