./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_1.sol_0_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:24:50,317 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:24:50,354 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ddbe97f-c523-4b45-85b7-0099ba94140d/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:24:50,357 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:24:50,357 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:24:50,370 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:24:50,370 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:24:50,370 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:24:50,371 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:24:50,371 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:24:50,371 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:24:50,371 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:24:50,371 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:24:50,371 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:24:50,371 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:24:50,371 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:24:50,372 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:24:50,372 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:24:50,373 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:24:50,373 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:24:50,567 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:24:50,575 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:24:50,578 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:24:50,579 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:24:50,579 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:24:50,580 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ddbe97f-c523-4b45-85b7-0099ba94140d/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_1.sol_0_no_adts_000.smt2
[2025-05-07 17:24:50,581 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:24:50,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:24:50,810 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ddbe97f-c523-4b45-85b7-0099ba94140d/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_call_with_value_1.sol_0_no_adts_000.smt2
[2025-05-07 17:24:50,813 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:24:50,813 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:24:50,814 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:24:50,814 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:24:50,814 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:24:50,816 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,843 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50 Unit
[2025-05-07 17:24:50,843 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:24:50,844 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:24:50,844 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:24:50,844 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:24:50,855 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,855 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,880 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,880 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,883 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,884 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,885 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,887 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,887 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,898 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:24:50,898 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:24:50,898 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:24:50,898 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:24:50,899 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (1/1) ...
[2025-05-07 17:24:50,901 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:24:50,908 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:50,916 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:24:50,919 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:24:50,927 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:24:50,927 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:24:50,927 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:24:50,927 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:24:50,927 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:24:50,927 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:24:50,927 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,927 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_g__48_49_0
[2025-05-07 17:24:50,927 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_g__48_49_0
[2025-05-07 17:24:50,927 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_return_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_return_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_return_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_g__48_49_0
[2025-05-07 17:24:50,928 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_17_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_17_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_17_0
[2025-05-07 17:24:50,928 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_6_C_49_0 given in one single declaration
[2025-05-07 17:24:50,928 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_6_C_49_0
[2025-05-07 17:24:50,928 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_6_C_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_g_47_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_g_47_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_g_47_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_g__48_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_g__48_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_g__48_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_g__48_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_g__48_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_C_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_C_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_C_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_49_0
[2025-05-07 17:24:50,929 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_21_C_49_0 given in one single declaration
[2025-05-07 17:24:50,929 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_21_C_49_0
[2025-05-07 17:24:50,929 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_21_C_49_0
[2025-05-07 17:24:50,930 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_23_C_49_0 given in one single declaration
[2025-05-07 17:24:50,930 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_23_C_49_0
[2025-05-07 17:24:50,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_23_C_49_0
[2025-05-07 17:24:50,930 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_22_C_49_0 given in one single declaration
[2025-05-07 17:24:50,930 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_22_C_49_0
[2025-05-07 17:24:50,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_22_C_49_0
[2025-05-07 17:24:50,930 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_24_C_49_0 given in one single declaration
[2025-05-07 17:24:50,930 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_24_C_49_0
[2025-05-07 17:24:50,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_24_C_49_0
[2025-05-07 17:24:50,930 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:24:50,930 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:24:50,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:24:51,042 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:24:51,043 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:24:51,239 INFO  L?                        ?]: Removed 162 outVars from TransFormulas that were not future-live.
[2025-05-07 17:24:51,240 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:24:51,247 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:24:51,247 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-05-07 17:24:51,248 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:51 BoogieIcfgContainer
[2025-05-07 17:24:51,248 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:24:51,249 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:24:51,249 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:24:51,251 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:24:51,252 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:50" (1/3) ...
[2025-05-07 17:24:51,252 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9536588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:24:51, skipping insertion in model container
[2025-05-07 17:24:51,252 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:50" (2/3) ...
[2025-05-07 17:24:51,252 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9536588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:24:51, skipping insertion in model container
[2025-05-07 17:24:51,252 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:51" (3/3) ...
[2025-05-07 17:24:51,253 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:24:51,263 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:24:51,265 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:24:51,292 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:24:51,299 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;@6b18d77f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:24:51,299 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:24:51,302 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:24:51,308 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:24:51,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:51,309 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:24:51,309 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:51,312 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:51,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 53058389, now seen corresponding path program 1 times
[2025-05-07 17:24:51,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:51,318 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878750055]
[2025-05-07 17:24:51,318 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:51,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:51,362 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:24:51,415 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:24:51,416 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:51,416 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:51,573 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:24:51,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:51,573 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878750055]
[2025-05-07 17:24:51,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878750055] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:51,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:51,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:24:51,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520904809]
[2025-05-07 17:24:51,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:51,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:24:51,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:51,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:24:51,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:24:51,609 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 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15)
[2025-05-07 17:24:51,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:51,690 INFO  L93              Difference]: Finished difference Result 83 states and 103 transitions.
[2025-05-07 17:24:51,691 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:24:51,692 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 55
[2025-05-07 17:24:51,693 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:51,699 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:24:51,699 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:24:51,701 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:24:51,704 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 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:24:51,705 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:51,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:24:51,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-05-07 17:24:51,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (35), 26 states have call predecessors, (35), 28 states have call successors, (35)
[2025-05-07 17:24:51,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions.
[2025-05-07 17:24:51,748 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 55
[2025-05-07 17:24:51,749 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:51,749 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 101 transitions.
[2025-05-07 17:24:51,749 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15)
[2025-05-07 17:24:51,749 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions.
[2025-05-07 17:24:51,752 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:24:51,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:51,752 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:24:51,752 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:24:51,752 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:51,753 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:51,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466108007, now seen corresponding path program 1 times
[2025-05-07 17:24:51,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:51,753 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976599662]
[2025-05-07 17:24:51,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:51,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:51,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:24:51,788 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:24:51,788 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:51,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:51,902 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:24:51,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:51,903 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976599662]
[2025-05-07 17:24:51,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976599662] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:51,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:51,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:51,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440130546]
[2025-05-07 17:24:51,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:51,904 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:51,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:51,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:51,905 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:51,905 INFO  L87              Difference]: Start difference. First operand 81 states and 101 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:24:51,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:51,918 INFO  L93              Difference]: Finished difference Result 85 states and 105 transitions.
[2025-05-07 17:24:51,919 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:51,919 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:24:51,919 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:51,920 INFO  L225             Difference]: With dead ends: 85
[2025-05-07 17:24:51,920 INFO  L226             Difference]: Without dead ends: 81
[2025-05-07 17:24:51,921 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:24:51,921 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 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:24:51,922 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:51,922 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-05-07 17:24:51,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2025-05-07 17:24:51,929 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:24:51,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions.
[2025-05-07 17:24:51,931 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 58
[2025-05-07 17:24:51,931 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:51,931 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 96 transitions.
[2025-05-07 17:24:51,931 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:24:51,931 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions.
[2025-05-07 17:24:51,933 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:24:51,933 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:51,933 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:51,933 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:24:51,933 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:51,934 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:51,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 1599044579, now seen corresponding path program 1 times
[2025-05-07 17:24:51,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:51,934 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479287665]
[2025-05-07 17:24:51,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:51,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:51,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:24:51,987 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:24:51,987 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:51,987 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:52,154 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:24:52,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:52,154 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479287665]
[2025-05-07 17:24:52,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479287665] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:52,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:52,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:24:52,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491588669]
[2025-05-07 17:24:52,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:52,155 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:24:52,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:52,155 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:24:52,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:52,156 INFO  L87              Difference]: Start difference. First operand 79 states and 96 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:24:52,207 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:52,207 INFO  L93              Difference]: Finished difference Result 83 states and 101 transitions.
[2025-05-07 17:24:52,208 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:24:52,208 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:24:52,208 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:52,209 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:24:52,210 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:24:52,210 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:24:52,210 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 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:24:52,210 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:52,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:24:52,215 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-05-07 17:24:52,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (36), 27 states have call predecessors, (36), 26 states have call successors, (36)
[2025-05-07 17:24:52,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions.
[2025-05-07 17:24:52,217 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 58
[2025-05-07 17:24:52,217 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:52,217 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 101 transitions.
[2025-05-07 17:24:52,218 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:24:52,218 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions.
[2025-05-07 17:24:52,219 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:24:52,219 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:52,219 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:24:52,219 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:24:52,219 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:52,219 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:52,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285658691, now seen corresponding path program 1 times
[2025-05-07 17:24:52,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:52,219 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782203480]
[2025-05-07 17:24:52,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:52,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:52,242 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:24:52,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:24:52,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:52,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:52,340 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:24:52,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:52,341 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782203480]
[2025-05-07 17:24:52,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782203480] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:52,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:52,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:24:52,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635218516]
[2025-05-07 17:24:52,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:52,341 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:24:52,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:52,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:24:52,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:24:52,343 INFO  L87              Difference]: Start difference. First operand 83 states and 101 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:24:52,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:52,390 INFO  L93              Difference]: Finished difference Result 87 states and 106 transitions.
[2025-05-07 17:24:52,390 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:24:52,390 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:24:52,391 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:52,391 INFO  L225             Difference]: With dead ends: 87
[2025-05-07 17:24:52,391 INFO  L226             Difference]: Without dead ends: 87
[2025-05-07 17:24:52,391 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:24:52,392 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 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:24:52,392 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:52,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2025-05-07 17:24:52,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83.
[2025-05-07 17:24:52,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (36), 27 states have call predecessors, (36), 26 states have call successors, (36)
[2025-05-07 17:24:52,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions.
[2025-05-07 17:24:52,397 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 58
[2025-05-07 17:24:52,397 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:52,397 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 101 transitions.
[2025-05-07 17:24:52,398 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:24:52,398 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions.
[2025-05-07 17:24:52,398 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:24:52,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:52,399 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:24:52,399 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:24:52,399 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:52,399 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:52,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -799739825, now seen corresponding path program 1 times
[2025-05-07 17:24:52,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:52,399 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122390605]
[2025-05-07 17:24:52,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:52,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:52,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:24:52,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:24:52,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:52,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:52,680 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:24:52,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:52,681 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122390605]
[2025-05-07 17:24:52,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122390605] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:52,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:52,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:24:52,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624167811]
[2025-05-07 17:24:52,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:52,681 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:24:52,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:52,682 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:24:52,682 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:24:52,682 INFO  L87              Difference]: Start difference. First operand 83 states and 101 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:24:52,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:52,721 INFO  L93              Difference]: Finished difference Result 83 states and 100 transitions.
[2025-05-07 17:24:52,721 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:24:52,722 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:24:52,722 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:52,722 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:24:52,722 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:24:52,723 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:24:52,723 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:24:52,723 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:24:52,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:24:52,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-05-07 17:24:52,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 18 states have call predecessors, (28), 22 states have return successors, (35), 27 states have call predecessors, (35), 26 states have call successors, (35)
[2025-05-07 17:24:52,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions.
[2025-05-07 17:24:52,728 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 58
[2025-05-07 17:24:52,728 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:52,728 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 100 transitions.
[2025-05-07 17:24:52,729 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:24:52,729 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions.
[2025-05-07 17:24:52,729 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:24:52,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:52,730 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:24:52,730 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:24:52,730 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:52,730 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:52,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -894285515, now seen corresponding path program 1 times
[2025-05-07 17:24:52,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:52,731 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047968255]
[2025-05-07 17:24:52,731 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:52,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:52,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:24:52,774 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:24:52,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:52,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:52,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:24:52,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:52,932 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047968255]
[2025-05-07 17:24:52,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047968255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:52,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:52,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:24:52,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410248131]
[2025-05-07 17:24:52,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:52,933 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:52,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:52,934 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:52,934 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:52,934 INFO  L87              Difference]: Start difference. First operand 83 states and 100 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:24:53,037 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:53,037 INFO  L93              Difference]: Finished difference Result 94 states and 118 transitions.
[2025-05-07 17:24:53,037 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:53,037 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), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22) Word has length 87
[2025-05-07 17:24:53,038 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:53,038 INFO  L225             Difference]: With dead ends: 94
[2025-05-07 17:24:53,038 INFO  L226             Difference]: Without dead ends: 94
[2025-05-07 17:24:53,039 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:24:53,039 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:24:53,039 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:24:53,040 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-05-07 17:24:53,044 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92.
[2025-05-07 17:24:53,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 41 states have internal predecessors, (41), 27 states have call successors, (29), 18 states have call predecessors, (29), 26 states have return successors, (46), 32 states have call predecessors, (46), 27 states have call successors, (46)
[2025-05-07 17:24:53,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions.
[2025-05-07 17:24:53,045 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 87
[2025-05-07 17:24:53,045 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:53,045 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 116 transitions.
[2025-05-07 17:24:53,046 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), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 8 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:24:53,046 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions.
[2025-05-07 17:24:53,046 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:24:53,046 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:53,047 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:24:53,047 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:24:53,047 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:53,047 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:53,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 316462485, now seen corresponding path program 1 times
[2025-05-07 17:24:53,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:53,047 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970972725]
[2025-05-07 17:24:53,047 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:53,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:53,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:24:53,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:24:53,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:53,081 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:53,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:24:53,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:53,201 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970972725]
[2025-05-07 17:24:53,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970972725] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:53,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:53,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:24:53,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528348593]
[2025-05-07 17:24:53,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:53,202 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:53,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:53,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:53,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:53,203 INFO  L87              Difference]: Start difference. First operand 92 states and 116 transitions. Second operand  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:53,282 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:53,282 INFO  L93              Difference]: Finished difference Result 101 states and 135 transitions.
[2025-05-07 17:24:53,282 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:53,282 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21) Word has length 87
[2025-05-07 17:24:53,283 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:53,284 INFO  L225             Difference]: With dead ends: 101
[2025-05-07 17:24:53,284 INFO  L226             Difference]: Without dead ends: 101
[2025-05-07 17:24:53,284 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:24:53,285 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:53,285 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:53,286 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-05-07 17:24:53,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97.
[2025-05-07 17:24:53,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 28 states have call successors, (30), 18 states have call predecessors, (30), 28 states have return successors, (57), 35 states have call predecessors, (57), 28 states have call successors, (57)
[2025-05-07 17:24:53,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions.
[2025-05-07 17:24:53,296 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 87
[2025-05-07 17:24:53,296 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:53,296 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 130 transitions.
[2025-05-07 17:24:53,296 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:24:53,296 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions.
[2025-05-07 17:24:53,298 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:24:53,298 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:53,298 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:24:53,298 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:24:53,298 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:53,298 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:53,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 1264737903, now seen corresponding path program 1 times
[2025-05-07 17:24:53,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:53,299 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526483754]
[2025-05-07 17:24:53,299 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:53,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:53,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:24:53,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:24:53,341 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:53,341 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:53,862 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:24:53,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:53,863 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526483754]
[2025-05-07 17:24:53,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526483754] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:53,863 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161620589]
[2025-05-07 17:24:53,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:53,863 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:53,865 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:53,867 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:24:53,868 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:24:54,080 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:24:54,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:24:54,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:54,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:54,221 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:54,231 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:54,274 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:24:54,398 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 12 treesize of output 9
[2025-05-07 17:24:54,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:24:54,416 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:24:56,066 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:24:56,066 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 1 case distinctions, treesize of input 7 treesize of output 6
[2025-05-07 17:24:56,273 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-05-07 17:24:56,273 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2025-05-07 17:24:56,456 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-05-07 17:24:56,456 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2025-05-07 17:24:56,871 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:24:56,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [161620589] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:24:56,872 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:24:56,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 19
[2025-05-07 17:24:56,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955673936]
[2025-05-07 17:24:56,872 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:24:56,873 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-05-07 17:24:56,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:56,874 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-05-07 17:24:56,874 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:24:56,874 INFO  L87              Difference]: Start difference. First operand 97 states and 130 transitions. Second operand  has 19 states, 14 states have (on average 3.357142857142857) internal successors, (47), 18 states have internal predecessors, (47), 9 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33)
[2025-05-07 17:24:57,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:57,123 INFO  L93              Difference]: Finished difference Result 112 states and 155 transitions.
[2025-05-07 17:24:57,124 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:24:57,124 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 14 states have (on average 3.357142857142857) internal successors, (47), 18 states have internal predecessors, (47), 9 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33) Word has length 90
[2025-05-07 17:24:57,124 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:57,125 INFO  L225             Difference]: With dead ends: 112
[2025-05-07 17:24:57,125 INFO  L226             Difference]: Without dead ends: 112
[2025-05-07 17:24:57,125 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462
[2025-05-07 17:24:57,125 INFO  L437           NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:57,126 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 818 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:24:57,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2025-05-07 17:24:57,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104.
[2025-05-07 17:24:57,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (31), 18 states have call predecessors, (31), 31 states have return successors, (65), 40 states have call predecessors, (65), 29 states have call successors, (65)
[2025-05-07 17:24:57,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions.
[2025-05-07 17:24:57,134 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 90
[2025-05-07 17:24:57,134 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:57,134 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 142 transitions.
[2025-05-07 17:24:57,134 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 14 states have (on average 3.357142857142857) internal successors, (47), 18 states have internal predecessors, (47), 9 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (33), 14 states have call predecessors, (33), 9 states have call successors, (33)
[2025-05-07 17:24:57,134 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions.
[2025-05-07 17:24:57,135 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:24:57,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:57,135 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:24:57,142 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:24:57,336 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:57,337 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:57,338 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:57,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 1474280975, now seen corresponding path program 1 times
[2025-05-07 17:24:57,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:57,338 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545198692]
[2025-05-07 17:24:57,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:57,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:57,441 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:24:57,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:24:57,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:57,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:57,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:24:57,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:57,633 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545198692]
[2025-05-07 17:24:57,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545198692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:57,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:57,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:24:57,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698069664]
[2025-05-07 17:24:57,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:57,633 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:57,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:57,634 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:57,634 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:57,634 INFO  L87              Difference]: Start difference. First operand 104 states and 142 transitions. Second operand  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:24:57,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:57,705 INFO  L93              Difference]: Finished difference Result 104 states and 141 transitions.
[2025-05-07 17:24:57,705 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:57,705 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23) Word has length 90
[2025-05-07 17:24:57,706 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:57,707 INFO  L225             Difference]: With dead ends: 104
[2025-05-07 17:24:57,707 INFO  L226             Difference]: Without dead ends: 104
[2025-05-07 17:24:57,707 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:24:57,708 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:57,708 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 614 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:57,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-05-07 17:24:57,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2025-05-07 17:24:57,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (31), 18 states have call predecessors, (31), 31 states have return successors, (64), 40 states have call predecessors, (64), 29 states have call successors, (64)
[2025-05-07 17:24:57,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions.
[2025-05-07 17:24:57,717 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 90
[2025-05-07 17:24:57,717 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:57,717 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 141 transitions.
[2025-05-07 17:24:57,717 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:24:57,717 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions.
[2025-05-07 17:24:57,719 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:24:57,719 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:57,719 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:24:57,719 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:24:57,719 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:57,719 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:57,720 INFO  L85        PathProgramCache]: Analyzing trace with hash -640359377, now seen corresponding path program 1 times
[2025-05-07 17:24:57,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:57,720 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912583186]
[2025-05-07 17:24:57,720 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:57,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:57,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:24:57,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:24:57,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:57,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:57,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:24:57,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:57,891 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912583186]
[2025-05-07 17:24:57,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912583186] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:57,891 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850191319]
[2025-05-07 17:24:57,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:57,891 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:57,894 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:57,895 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:24:57,896 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:24:58,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:24:58,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:24:58,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:58,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:58,300 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:58,304 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:58,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2025-05-07 17:24:58,371 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:24:58,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [850191319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:58,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:24:58,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14
[2025-05-07 17:24:58,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518858859]
[2025-05-07 17:24:58,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:58,371 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:58,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:58,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:58,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:24:58,372 INFO  L87              Difference]: Start difference. First operand 104 states and 141 transitions. Second operand  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:24:58,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:58,432 INFO  L93              Difference]: Finished difference Result 75 states and 91 transitions.
[2025-05-07 17:24:58,432 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:58,433 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30) Word has length 122
[2025-05-07 17:24:58,433 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:58,433 INFO  L225             Difference]: With dead ends: 75
[2025-05-07 17:24:58,433 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:24:58,433 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:24:58,433 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:58,434 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:24:58,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:24:58,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:24:58,434 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:24:58,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:24:58,434 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122
[2025-05-07 17:24:58,434 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:58,434 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:24:58,434 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:24:58,434 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:24:58,435 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:24:58,436 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:24:58,441 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:24:58,637 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:58,647 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:58,653 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:24:58,660 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:24:58 BoogieIcfgContainer
[2025-05-07 17:24:58,660 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:24:58,663 INFO  L158              Benchmark]: Toolchain (without parser) took 7847.73ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 152.0MB in the beginning and 189.7MB in the end (delta: -37.7MB). Peak memory consumption was 30.5MB. Max. memory is 33.6GB.
[2025-05-07 17:24:58,664 INFO  L158              Benchmark]: SmtParser took 0.34ms. 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:24:58,664 INFO  L158              Benchmark]: ChcToBoogie took 29.67ms. Allocated memory is still 234.9MB. Free memory was 151.9MB in the beginning and 149.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:58,665 INFO  L158              Benchmark]: Boogie Preprocessor took 53.63ms. Allocated memory is still 234.9MB. Free memory was 149.4MB in the beginning and 146.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:58,665 INFO  L158              Benchmark]: RCFGBuilder took 349.57ms. Allocated memory is still 234.9MB. Free memory was 146.3MB in the beginning and 192.6MB in the end (delta: -46.3MB). Peak memory consumption was 41.9MB. Max. memory is 33.6GB.
[2025-05-07 17:24:58,666 INFO  L158              Benchmark]: TraceAbstraction took 7411.60ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 192.0MB in the beginning and 189.7MB in the end (delta: 2.3MB). Peak memory consumption was 55.7MB. Max. memory is 33.6GB.
[2025-05-07 17:24:58,670 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.34ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 29.67ms. Allocated memory is still 234.9MB. Free memory was 151.9MB in the beginning and 149.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 53.63ms. Allocated memory is still 234.9MB. Free memory was 149.4MB in the beginning and 146.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 349.57ms. Allocated memory is still 234.9MB. Free memory was 146.3MB in the beginning and 192.6MB in the end (delta: -46.3MB). Peak memory consumption was 41.9MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7411.60ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 192.0MB in the beginning and 189.7MB in the end (delta: 2.3MB). Peak memory consumption was 55.7MB. 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: 7.4s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 4876 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4014 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 862 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=8, InterpolantAutomatonStates: 73, 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, 10 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1052 ConstructedInterpolants, 4 QuantifiedInterpolants, 1582 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2628 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 323/346 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:24:58,697 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
