./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-215.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:30,201 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:30,279 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ae8290a-aedc-4589-a10e-86f0d1c92d45/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:30,289 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:30,292 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:30,330 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:30,331 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:30,332 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:30,333 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:30,333 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:30,334 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:30,334 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:30,334 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:30,334 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:30,336 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:30,336 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:30,336 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:30,336 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:30,336 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:30,337 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:30,337 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:30,337 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:30,337 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:30,337 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:30,337 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:30,338 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:30,339 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:30,694 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:30,706 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:30,709 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:30,712 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:30,713 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:30,714 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ae8290a-aedc-4589-a10e-86f0d1c92d45/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-215.smt2
[2025-04-28 21:21:30,717 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:30,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:31,152 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ae8290a-aedc-4589-a10e-86f0d1c92d45/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-215.smt2
[2025-04-28 21:21:31,158 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:31,161 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:31,162 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:31,162 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:31,162 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:31,165 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,237 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31 Unit
[2025-04-28 21:21:31,237 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:31,238 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:31,243 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:31,243 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:31,260 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,261 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,304 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,305 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,321 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,322 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,328 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,330 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,332 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,370 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:31,371 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:31,371 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:31,371 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:31,372 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (1/1) ...
[2025-04-28 21:21:31,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:31,396 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,410 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-04-28 21:21:31,416 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,433 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:31,433 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:31,433 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:31,433 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-04-28 21:21:31,433 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-04-28 21:21:31,433 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-04-28 21:21:31,434 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_45_0 given in one single declaration
[2025-04-28 21:21:31,434 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_45_0
[2025-04-28 21:21:31,434 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_45_0
[2025-04-28 21:21:31,434 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_45_0 given in one single declaration
[2025-04-28 21:21:31,435 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_45_0
[2025-04-28 21:21:31,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_45_0
[2025-04-28 21:21:31,435 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_12_C_45_0 given in one single declaration
[2025-04-28 21:21:31,435 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_12_C_45_0
[2025-04-28 21:21:31,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_12_C_45_0
[2025-04-28 21:21:31,435 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_14_C_45_0 given in one single declaration
[2025-04-28 21:21:31,435 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_14_C_45_0
[2025-04-28 21:21:31,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_14_C_45_0
[2025-04-28 21:21:31,435 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_13_C_45_0 given in one single declaration
[2025-04-28 21:21:31,435 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_13_C_45_0
[2025-04-28 21:21:31,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_13_C_45_0
[2025-04-28 21:21:31,436 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_15_C_45_0 given in one single declaration
[2025-04-28 21:21:31,436 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_15_C_45_0
[2025-04-28 21:21:31,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_15_C_45_0
[2025-04-28 21:21:31,436 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,436 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_g__44_45_0
[2025-04-28 21:21:31,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_g__44_45_0
[2025-04-28 21:21:31,436 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,436 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_g__44_45_0
[2025-04-28 21:21:31,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_g__44_45_0
[2025-04-28 21:21:31,436 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,436 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_g__44_45_0
[2025-04-28 21:21:31,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_g__44_45_0
[2025-04-28 21:21:31,437 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_8_0 given in one single declaration
[2025-04-28 21:21:31,437 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_8_0
[2025-04-28 21:21:31,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_8_0
[2025-04-28 21:21:31,437 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_1_C_45_0 given in one single declaration
[2025-04-28 21:21:31,437 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_1_C_45_0
[2025-04-28 21:21:31,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_1_C_45_0
[2025-04-28 21:21:31,437 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_g_43_45_0 given in one single declaration
[2025-04-28 21:21:31,437 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_g_43_45_0
[2025-04-28 21:21:31,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_g_43_45_0
[2025-04-28 21:21:31,437 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_5_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,437 INFO  L130     BoogieDeclarations]: Found specification of procedure block_5_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_5_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,438 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_return_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,438 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_return_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_return_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_g__44_45_0 given in one single declaration
[2025-04-28 21:21:31,438 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_g__44_45_0
[2025-04-28 21:21:31,438 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:31,438 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:31,439 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:31,652 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:31,657 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:32,065 INFO  L?                        ?]: Removed 166 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:32,065 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:32,084 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:32,084 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-04-28 21:21:32,084 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:32 BoogieIcfgContainer
[2025-04-28 21:21:32,085 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:32,091 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:32,091 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:32,098 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:32,098 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:31" (1/3) ...
[2025-04-28 21:21:32,099 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bb421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:32, skipping insertion in model container
[2025-04-28 21:21:32,099 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:31" (2/3) ...
[2025-04-28 21:21:32,100 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bb421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:32, skipping insertion in model container
[2025-04-28 21:21:32,100 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:32" (3/3) ...
[2025-04-28 21:21:32,102 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:32,118 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:32,120 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-04-28 21:21:32,170 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:32,184 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;@1bcee0c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:32,184 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:32,188 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-04-28 21:21:32,201 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-04-28 21:21:32,201 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,204 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-04-28 21:21:32,204 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,212 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -1936103503, now seen corresponding path program 1 times
[2025-04-28 21:21:32,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,222 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743980078]
[2025-04-28 21:21:32,222 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-04-28 21:21:32,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-04-28 21:21:32,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:32,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,982 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743980078]
[2025-04-28 21:21:32,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743980078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:32,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:32,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616006549]
[2025-04-28 21:21:32,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,001 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:33,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:33,054 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:33,057 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), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:33,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,234 INFO  L93              Difference]: Finished difference Result 83 states and 103 transitions.
[2025-04-28 21:21:33,240 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:33,243 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 55
[2025-04-28 21:21:33,243 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,254 INFO  L225             Difference]: With dead ends: 83
[2025-04-28 21:21:33,254 INFO  L226             Difference]: Without dead ends: 83
[2025-04-28 21:21:33,257 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-04-28 21:21:33,264 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,265 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.1s Time]
[2025-04-28 21:21:33,284 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-04-28 21:21:33,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-04-28 21:21:33,314 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-04-28 21:21:33,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions.
[2025-04-28 21:21:33,320 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 55
[2025-04-28 21:21:33,321 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,322 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 101 transitions.
[2025-04-28 21:21:33,322 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:33,322 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions.
[2025-04-28 21:21:33,325 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-04-28 21:21:33,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,326 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-04-28 21:21:33,326 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:33,326 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,327 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 1819953066, now seen corresponding path program 1 times
[2025-04-28 21:21:33,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,327 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175271912]
[2025-04-28 21:21:33,328 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-04-28 21:21:33,440 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-04-28 21:21:33,440 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,370 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175271912]
[2025-04-28 21:21:34,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175271912] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:34,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143404840]
[2025-04-28 21:21:34,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,372 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:34,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,373 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:34,373 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:34,374 INFO  L87              Difference]: Start difference. First operand 81 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), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-04-28 21:21:34,473 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,474 INFO  L93              Difference]: Finished difference Result 81 states and 100 transitions.
[2025-04-28 21:21:34,475 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:34,475 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), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-04-28 21:21:34,475 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,476 INFO  L225             Difference]: With dead ends: 81
[2025-04-28 21:21:34,477 INFO  L226             Difference]: Without dead ends: 81
[2025-04-28 21:21:34,477 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-04-28 21:21:34,482 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 345 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,483 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 345 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-04-28 21:21:34,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2025-04-28 21:21:34,501 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, (34), 26 states have call predecessors, (34), 28 states have call successors, (34)
[2025-04-28 21:21:34,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions.
[2025-04-28 21:21:34,503 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 58
[2025-04-28 21:21:34,506 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,506 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 100 transitions.
[2025-04-28 21:21:34,506 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), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-04-28 21:21:34,506 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions.
[2025-04-28 21:21:34,508 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-04-28 21:21:34,508 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,508 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-04-28 21:21:34,508 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:34,509 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,512 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1076256282, now seen corresponding path program 1 times
[2025-04-28 21:21:34,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,512 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539681028]
[2025-04-28 21:21:34,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,554 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-04-28 21:21:34,580 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-04-28 21:21:34,580 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,580 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,720 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539681028]
[2025-04-28 21:21:34,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539681028] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:34,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784237452]
[2025-04-28 21:21:34,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,721 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,722 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,722 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,722 INFO  L87              Difference]: Start difference. First operand 81 states and 100 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-04-28 21:21:34,745 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,746 INFO  L93              Difference]: Finished difference Result 85 states and 104 transitions.
[2025-04-28 21:21:34,747 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,747 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-04-28 21:21:34,748 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,749 INFO  L225             Difference]: With dead ends: 85
[2025-04-28 21:21:34,749 INFO  L226             Difference]: Without dead ends: 81
[2025-04-28 21:21:34,750 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-04-28 21:21:34,750 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,751 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:34,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-04-28 21:21:34,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2025-04-28 21:21:34,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (28), 18 states have call predecessors, (28), 20 states have return successors, (32), 25 states have call predecessors, (32), 26 states have call successors, (32)
[2025-04-28 21:21:34,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions.
[2025-04-28 21:21:34,774 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 58
[2025-04-28 21:21:34,775 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,775 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 95 transitions.
[2025-04-28 21:21:34,775 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), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-04-28 21:21:34,775 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions.
[2025-04-28 21:21:34,776 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-04-28 21:21:34,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,777 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-04-28 21:21:34,777 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:34,777 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,778 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 1415991210, now seen corresponding path program 1 times
[2025-04-28 21:21:34,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,780 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280342087]
[2025-04-28 21:21:34,780 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,826 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-04-28 21:21:34,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-04-28 21:21:34,854 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:35,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,036 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280342087]
[2025-04-28 21:21:35,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280342087] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:35,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:35,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:35,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614746140]
[2025-04-28 21:21:35,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,038 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:35,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,039 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:35,040 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:35,040 INFO  L87              Difference]: Start difference. First operand 79 states and 95 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:35,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,145 INFO  L93              Difference]: Finished difference Result 84 states and 102 transitions.
[2025-04-28 21:21:35,147 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:35,147 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), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58
[2025-04-28 21:21:35,147 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,148 INFO  L225             Difference]: With dead ends: 84
[2025-04-28 21:21:35,149 INFO  L226             Difference]: Without dead ends: 84
[2025-04-28 21:21:35,149 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-04-28 21:21:35,152 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 430 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,153 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 430 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:35,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-04-28 21:21:35,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-04-28 21:21:35,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (36), 28 states have call predecessors, (36), 27 states have call successors, (36)
[2025-04-28 21:21:35,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2025-04-28 21:21:35,171 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58
[2025-04-28 21:21:35,171 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,171 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2025-04-28 21:21:35,171 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), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:35,171 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2025-04-28 21:21:35,173 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-04-28 21:21:35,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,173 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-04-28 21:21:35,173 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:35,177 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,178 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 11951210, now seen corresponding path program 1 times
[2025-04-28 21:21:35,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,178 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548867230]
[2025-04-28 21:21:35,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-04-28 21:21:35,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-04-28 21:21:35,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,259 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:35,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,440 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548867230]
[2025-04-28 21:21:35,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548867230] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:35,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:35,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:35,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329205872]
[2025-04-28 21:21:35,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,441 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:35,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,442 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:35,442 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:35,442 INFO  L87              Difference]: Start difference. First operand 84 states and 102 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:35,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,534 INFO  L93              Difference]: Finished difference Result 89 states and 109 transitions.
[2025-04-28 21:21:35,535 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:35,535 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), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58
[2025-04-28 21:21:35,535 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,537 INFO  L225             Difference]: With dead ends: 89
[2025-04-28 21:21:35,537 INFO  L226             Difference]: Without dead ends: 89
[2025-04-28 21:21:35,537 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-04-28 21:21:35,538 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 425 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.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,538 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:35,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-04-28 21:21:35,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84.
[2025-04-28 21:21:35,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (36), 28 states have call predecessors, (36), 27 states have call successors, (36)
[2025-04-28 21:21:35,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2025-04-28 21:21:35,549 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58
[2025-04-28 21:21:35,549 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,549 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2025-04-28 21:21:35,550 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), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-04-28 21:21:35,550 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2025-04-28 21:21:35,556 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-04-28 21:21:35,556 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,556 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-04-28 21:21:35,557 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:35,557 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,557 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,557 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301317468, now seen corresponding path program 1 times
[2025-04-28 21:21:35,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,558 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214049585]
[2025-04-28 21:21:35,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-04-28 21:21:35,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-04-28 21:21:35,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-04-28 21:21:36,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,001 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214049585]
[2025-04-28 21:21:36,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214049585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,001 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,001 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:36,001 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958981407]
[2025-04-28 21:21:36,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,002 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:36,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,003 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:36,003 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:36,004 INFO  L87              Difference]: Start difference. First operand 84 states and 102 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-04-28 21:21:36,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,214 INFO  L93              Difference]: Finished difference Result 96 states and 122 transitions.
[2025-04-28 21:21:36,215 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:36,215 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 87
[2025-04-28 21:21:36,216 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,217 INFO  L225             Difference]: With dead ends: 96
[2025-04-28 21:21:36,217 INFO  L226             Difference]: Without dead ends: 96
[2025-04-28 21:21:36,218 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-04-28 21:21:36,218 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,219 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 599 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-04-28 21:21:36,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-04-28 21:21:36,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 41 states have internal predecessors, (41), 29 states have call successors, (31), 18 states have call predecessors, (31), 26 states have return successors, (48), 34 states have call predecessors, (48), 29 states have call successors, (48)
[2025-04-28 21:21:36,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions.
[2025-04-28 21:21:36,243 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 87
[2025-04-28 21:21:36,243 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,243 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 120 transitions.
[2025-04-28 21:21:36,243 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-04-28 21:21:36,244 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions.
[2025-04-28 21:21:36,245 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-04-28 21:21:36,245 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,245 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-04-28 21:21:36,246 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:36,247 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,247 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -2064474780, now seen corresponding path program 1 times
[2025-04-28 21:21:36,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,248 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27471849]
[2025-04-28 21:21:36,249 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-04-28 21:21:36,339 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-04-28 21:21:36,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:36,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,676 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27471849]
[2025-04-28 21:21:36,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27471849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:36,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815617708]
[2025-04-28 21:21:36,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,677 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:36,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:36,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:36,678 INFO  L87              Difference]: Start difference. First operand 94 states and 120 transitions. Second operand  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21)
[2025-04-28 21:21:36,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,845 INFO  L93              Difference]: Finished difference Result 104 states and 141 transitions.
[2025-04-28 21:21:36,846 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:36,846 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), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 87
[2025-04-28 21:21:36,847 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,848 INFO  L225             Difference]: With dead ends: 104
[2025-04-28 21:21:36,848 INFO  L226             Difference]: Without dead ends: 104
[2025-04-28 21:21:36,849 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:36,849 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,852 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 570 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:36,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-04-28 21:21:36,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99.
[2025-04-28 21:21:36,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 30 states have call successors, (32), 18 states have call predecessors, (32), 28 states have return successors, (59), 37 states have call predecessors, (59), 30 states have call successors, (59)
[2025-04-28 21:21:36,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions.
[2025-04-28 21:21:36,876 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 87
[2025-04-28 21:21:36,877 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,877 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 134 transitions.
[2025-04-28 21:21:36,877 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), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21)
[2025-04-28 21:21:36,877 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions.
[2025-04-28 21:21:36,883 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-04-28 21:21:36,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,884 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-04-28 21:21:36,884 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:36,884 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,884 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 670598301, now seen corresponding path program 1 times
[2025-04-28 21:21:36,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,885 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139478698]
[2025-04-28 21:21:36,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,954 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-04-28 21:21:36,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-04-28 21:21:36,973 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,973 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-04-28 21:21:37,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,259 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139478698]
[2025-04-28 21:21:37,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139478698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:37,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392332043]
[2025-04-28 21:21:37,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,260 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:37,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:37,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:37,263 INFO  L87              Difference]: Start difference. First operand 99 states and 134 transitions. Second operand  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-04-28 21:21:37,391 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,391 INFO  L93              Difference]: Finished difference Result 99 states and 133 transitions.
[2025-04-28 21:21:37,391 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:37,392 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), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) Word has length 90
[2025-04-28 21:21:37,392 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,393 INFO  L225             Difference]: With dead ends: 99
[2025-04-28 21:21:37,393 INFO  L226             Difference]: Without dead ends: 99
[2025-04-28 21:21:37,393 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-04-28 21:21:37,394 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 608 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-04-28 21:21:37,394 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 608 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-04-28 21:21:37,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2025-04-28 21:21:37,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 30 states have call successors, (32), 18 states have call predecessors, (32), 28 states have return successors, (58), 37 states have call predecessors, (58), 30 states have call successors, (58)
[2025-04-28 21:21:37,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions.
[2025-04-28 21:21:37,414 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 90
[2025-04-28 21:21:37,415 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,419 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 133 transitions.
[2025-04-28 21:21:37,419 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), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-04-28 21:21:37,419 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions.
[2025-04-28 21:21:37,420 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-04-28 21:21:37,421 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,421 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-04-28 21:21:37,421 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:37,421 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,421 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -374632483, now seen corresponding path program 1 times
[2025-04-28 21:21:37,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,422 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420615405]
[2025-04-28 21:21:37,422 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,468 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-04-28 21:21:37,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-04-28 21:21:37,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:38,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,676 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420615405]
[2025-04-28 21:21:38,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420615405] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,676 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129669038]
[2025-04-28 21:21:38,676 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,679 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,683 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:38,685 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-04-28 21:21:39,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-04-28 21:21:39,219 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,228 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 70 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,239 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:39,286 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-04-28 21:21:40,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:21:40,166 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,609 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7
[2025-04-28 21:21:45,205 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7
[2025-04-28 21:21:45,446 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-04-28 21:21:45,594 INFO  L325             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2025-04-28 21:21:45,594 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12
[2025-04-28 21:21:45,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:45,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129669038] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,774 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 29
[2025-04-28 21:21:45,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804352315]
[2025-04-28 21:21:45,775 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,776 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-04-28 21:21:45,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-04-28 21:21:45,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812
[2025-04-28 21:21:45,778 INFO  L87              Difference]: Start difference. First operand 99 states and 133 transitions. Second operand  has 29 states, 15 states have (on average 3.933333333333333) internal successors, (59), 23 states have internal predecessors, (59), 20 states have call successors, (43), 2 states have call predecessors, (43), 15 states have return successors, (49), 22 states have call predecessors, (49), 20 states have call successors, (49)
[2025-04-28 21:21:46,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,846 INFO  L93              Difference]: Finished difference Result 125 states and 188 transitions.
[2025-04-28 21:21:46,847 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-04-28 21:21:46,847 INFO  L79                 Accepts]: Start accepts. Automaton has  has 29 states, 15 states have (on average 3.933333333333333) internal successors, (59), 23 states have internal predecessors, (59), 20 states have call successors, (43), 2 states have call predecessors, (43), 15 states have return successors, (49), 22 states have call predecessors, (49), 20 states have call successors, (49) Word has length 90
[2025-04-28 21:21:46,848 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,849 INFO  L225             Difference]: With dead ends: 125
[2025-04-28 21:21:46,849 INFO  L226             Difference]: Without dead ends: 125
[2025-04-28 21:21:46,850 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560
[2025-04-28 21:21:46,851 INFO  L437           NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,851 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1561 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-04-28 21:21:46,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2025-04-28 21:21:46,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107.
[2025-04-28 21:21:46,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 32 states have call successors, (34), 18 states have call predecessors, (34), 31 states have return successors, (67), 43 states have call predecessors, (67), 32 states have call successors, (67)
[2025-04-28 21:21:46,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions.
[2025-04-28 21:21:46,877 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 90
[2025-04-28 21:21:46,877 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:46,877 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 147 transitions.
[2025-04-28 21:21:46,878 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 15 states have (on average 3.933333333333333) internal successors, (59), 23 states have internal predecessors, (59), 20 states have call successors, (43), 2 states have call predecessors, (43), 15 states have return successors, (49), 22 states have call predecessors, (49), 20 states have call successors, (49)
[2025-04-28 21:21:46,880 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions.
[2025-04-28 21:21:46,882 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-04-28 21:21:46,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,886 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-04-28 21:21:46,895 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:47,086 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:47,087 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,087 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -659922102, now seen corresponding path program 1 times
[2025-04-28 21:21:47,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,087 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141755572]
[2025-04-28 21:21:47,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-04-28 21:21:47,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-04-28 21:21:47,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-04-28 21:21:47,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,630 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141755572]
[2025-04-28 21:21:47,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141755572] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,630 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138829728]
[2025-04-28 21:21:47,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,631 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,634 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,636 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:47,641 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:48,006 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-04-28 21:21:48,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-04-28 21:21:48,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,292 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:48,300 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:48,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:48,434 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:48,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [138829728] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:48,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:48,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16
[2025-04-28 21:21:48,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650788527]
[2025-04-28 21:21:48,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:48,436 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:48,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:48,437 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:48,438 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:48,438 INFO  L87              Difference]: Start difference. First operand 107 states and 147 transitions. Second operand  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30)
[2025-04-28 21:21:48,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,544 INFO  L93              Difference]: Finished difference Result 53 states and 67 transitions.
[2025-04-28 21:21:48,544 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:48,545 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30) Word has length 122
[2025-04-28 21:21:48,545 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,545 INFO  L225             Difference]: With dead ends: 53
[2025-04-28 21:21:48,545 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:21:48,546 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:48,550 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,551 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 357 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:48,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:21:48,551 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:21:48,552 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-04-28 21:21:48,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:21:48,552 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122
[2025-04-28 21:21:48,552 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,552 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:21:48,552 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30)
[2025-04-28 21:21:48,552 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:21:48,552 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:21:48,555 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:48,567 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:48,762 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:48,766 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,768 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:48,772 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:48 BoogieIcfgContainer
[2025-04-28 21:21:48,772 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:48,773 INFO  L158              Benchmark]: Toolchain (without parser) took 17612.55ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 147.1MB in the beginning and 354.3MB in the end (delta: -207.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,773 INFO  L158              Benchmark]: SmtParser took 1.42ms. Allocated memory is still 234.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,774 INFO  L158              Benchmark]: ChcToBoogie took 75.92ms. Allocated memory is still 234.9MB. Free memory was 147.1MB in the beginning and 144.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,774 INFO  L158              Benchmark]: Boogie Preprocessor took 131.43ms. Allocated memory is still 234.9MB. Free memory was 144.8MB in the beginning and 141.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,774 INFO  L158              Benchmark]: RCFGBuilder took 714.00ms. Allocated memory is still 234.9MB. Free memory was 141.5MB in the beginning and 112.6MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 33.6GB.
[2025-04-28 21:21:48,774 INFO  L158              Benchmark]: TraceAbstraction took 16681.49ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 112.1MB in the beginning and 354.3MB in the end (delta: -242.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:48,776 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 1.42ms. Allocated memory is still 234.9MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 75.92ms. Allocated memory is still 234.9MB. Free memory was 147.1MB in the beginning and 144.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 131.43ms. Allocated memory is still 234.9MB. Free memory was 144.8MB in the beginning and 141.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 714.00ms. Allocated memory is still 234.9MB. Free memory was 141.5MB in the beginning and 112.6MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 33.6GB.
 * TraceAbstraction took 16681.49ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 112.1MB in the beginning and 354.3MB in the end (delta: -242.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 19 procedures, 79 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 5519 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4665 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 854 mSDtfsCounter, 886 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1052 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2658 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 326/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-04-28 21:21:48,792 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
