./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit


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


Checking for termination
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 14:31:40,646 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 14:31:40,692 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2025-02-08 14:31:40,697 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 14:31:40,699 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 14:31:40,700 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-08 14:31:40,723 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 14:31:40,724 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 14:31:40,724 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 14:31:40,724 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 14:31:40,724 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 14:31:40,724 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 14:31:40,724 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 14:31:40,725 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-08 14:31:40,725 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-08 14:31:40,725 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 14:31:40,726 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 14:31:40,727 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 14:31:40,727 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 14:31:40,727 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 14:31:40,727 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 14:31:40,727 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-08 14:31:40,727 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c
[2025-02-08 14:31:40,969 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 14:31:40,977 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 14:31:40,979 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 14:31:40,981 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 14:31:40,981 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 14:31:40,982 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c
[2025-02-08 14:31:42,267 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/918a92c33/abbfecfe89cb48fab16851c7fa742edb/FLAG14951673f
[2025-02-08 14:31:42,644 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 14:31:42,646 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c
[2025-02-08 14:31:42,653 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/918a92c33/abbfecfe89cb48fab16851c7fa742edb/FLAG14951673f
[2025-02-08 14:31:42,673 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/918a92c33/abbfecfe89cb48fab16851c7fa742edb
[2025-02-08 14:31:42,675 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 14:31:42,676 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 14:31:42,679 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 14:31:42,679 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 14:31:42,682 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 14:31:42,683 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,684 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5732c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42, skipping insertion in model container
[2025-02-08 14:31:42,684 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,699 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 14:31:42,823 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:31:42,832 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 14:31:42,849 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:31:42,862 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 14:31:42,863 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42 WrapperNode
[2025-02-08 14:31:42,864 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 14:31:42,864 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 14:31:42,864 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 14:31:42,865 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 14:31:42,874 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,883 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,917 INFO  L138                Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181
[2025-02-08 14:31:42,918 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 14:31:42,918 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 14:31:42,918 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 14:31:42,918 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 14:31:42,928 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,931 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,933 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,949 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-08 14:31:42,952 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,956 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,982 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,983 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,983 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,984 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:42,988 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 14:31:42,994 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 14:31:42,995 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 14:31:42,996 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 14:31:42,996 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (1/1) ...
[2025-02-08 14:31:43,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:31:43,023 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:31:43,068 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2025-02-08 14:31:43,073 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2025-02-08 14:31:43,104 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 14:31:43,105 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 14:31:43,105 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 14:31:43,105 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 14:31:43,189 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 14:31:43,201 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 14:31:43,423 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume { :begin_inline_reach_error } true;assume false;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 0;
[2025-02-08 14:31:43,443 INFO  L?                        ?]: Removed 34 outVars from TransFormulas that were not future-live.
[2025-02-08 14:31:43,443 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 14:31:43,454 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 14:31:43,454 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 14:31:43,454 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:43 BoogieIcfgContainer
[2025-02-08 14:31:43,455 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 14:31:43,456 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-08 14:31:43,456 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-08 14:31:43,459 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-08 14:31:43,460 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:43,460 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:31:42" (1/3) ...
[2025-02-08 14:31:43,461 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b964de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:43, skipping insertion in model container
[2025-02-08 14:31:43,461 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:43,461 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:42" (2/3) ...
[2025-02-08 14:31:43,462 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b964de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:43, skipping insertion in model container
[2025-02-08 14:31:43,462 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:43,462 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:43" (3/3) ...
[2025-02-08 14:31:43,463 INFO  L363   chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c
[2025-02-08 14:31:43,500 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-08 14:31:43,500 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-08 14:31:43,500 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-08 14:31:43,500 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-08 14:31:43,501 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-08 14:31:43,501 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-08 14:31:43,501 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-08 14:31:43,501 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-08 14:31:43,504 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 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-02-08 14:31:43,517 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 44
[2025-02-08 14:31:43,518 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:43,518 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:43,522 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:43,522 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:43,522 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-08 14:31:43,523 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 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-02-08 14:31:43,525 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 44
[2025-02-08 14:31:43,527 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:43,527 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:43,527 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:43,527 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:43,532 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:43,532 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1;" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:43,535 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:43,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 1 times
[2025-02-08 14:31:43,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:43,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768402984]
[2025-02-08 14:31:43,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:43,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:43,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:43,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:43,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:43,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:43,608 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:43,613 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:43,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:43,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:43,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:43,636 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:43,638 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:43,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686073154, now seen corresponding path program 1 times
[2025-02-08 14:31:43,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:43,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982924659]
[2025-02-08 14:31:43,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:43,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:43,663 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:43,683 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:43,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:43,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:43,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:43,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:43,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982924659]
[2025-02-08 14:31:43,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982924659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:43,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:43,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:43,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422862767]
[2025-02-08 14:31:43,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:43,866 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:43,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:43,909 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:43,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:43,914 INFO  L87              Difference]: Start difference. First operand  has 50 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 49 states have internal predecessors, (91), 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) Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:43,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:43,959 INFO  L93              Difference]: Finished difference Result 92 states and 171 transitions.
[2025-02-08 14:31:43,960 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 171 transitions.
[2025-02-08 14:31:43,962 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 87
[2025-02-08 14:31:43,971 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 88 states and 138 transitions.
[2025-02-08 14:31:43,972 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 88
[2025-02-08 14:31:43,973 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 88
[2025-02-08 14:31:43,974 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 88 states and 138 transitions.
[2025-02-08 14:31:43,975 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:43,987 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 88 states and 138 transitions.
[2025-02-08 14:31:44,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states and 138 transitions.
[2025-02-08 14:31:44,016 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-02-08 14:31:44,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 87 states have internal predecessors, (138), 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-02-08 14:31:44,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions.
[2025-02-08 14:31:44,021 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 88 states and 138 transitions.
[2025-02-08 14:31:44,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:44,024 INFO  L432   stractBuchiCegarLoop]: Abstraction has 88 states and 138 transitions.
[2025-02-08 14:31:44,024 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-08 14:31:44,024 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 138 transitions.
[2025-02-08 14:31:44,025 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 87
[2025-02-08 14:31:44,025 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,025 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,030 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,030 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:44,030 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:44,030 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1;" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:44,031 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,031 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 2 times
[2025-02-08 14:31:44,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572935669]
[2025-02-08 14:31:44,031 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:31:44,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,038 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,060 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,060 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:44,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,061 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,065 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,065 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,067 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1674757027, now seen corresponding path program 1 times
[2025-02-08 14:31:44,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028426275]
[2025-02-08 14:31:44,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:44,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:44,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:44,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:44,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:44,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028426275]
[2025-02-08 14:31:44,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028426275] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:44,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:44,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:44,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233759891]
[2025-02-08 14:31:44,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:44,194 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:44,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:44,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:44,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:44,195 INFO  L87              Difference]: Start difference. First operand 88 states and 138 transitions. cyclomatic complexity: 52 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:44,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:44,219 INFO  L93              Difference]: Finished difference Result 173 states and 269 transitions.
[2025-02-08 14:31:44,219 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 269 transitions.
[2025-02-08 14:31:44,221 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 172
[2025-02-08 14:31:44,225 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 269 transitions.
[2025-02-08 14:31:44,225 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 173
[2025-02-08 14:31:44,225 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 173
[2025-02-08 14:31:44,225 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 173 states and 269 transitions.
[2025-02-08 14:31:44,226 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:44,226 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 173 states and 269 transitions.
[2025-02-08 14:31:44,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 173 states and 269 transitions.
[2025-02-08 14:31:44,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173.
[2025-02-08 14:31:44,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 173 states have (on average 1.5549132947976878) internal successors, (269), 172 states have internal predecessors, (269), 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-02-08 14:31:44,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions.
[2025-02-08 14:31:44,286 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 173 states and 269 transitions.
[2025-02-08 14:31:44,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:44,287 INFO  L432   stractBuchiCegarLoop]: Abstraction has 173 states and 269 transitions.
[2025-02-08 14:31:44,287 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-08 14:31:44,287 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 269 transitions.
[2025-02-08 14:31:44,297 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 172
[2025-02-08 14:31:44,297 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,297 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,297 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,297 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:44,298 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:44,298 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1;" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:44,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,298 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 3 times
[2025-02-08 14:31:44,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925760135]
[2025-02-08 14:31:44,298 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:31:44,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,306 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,307 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,307 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:31:44,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,308 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,309 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,316 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,320 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,320 INFO  L85        PathProgramCache]: Analyzing trace with hash -713143010, now seen corresponding path program 1 times
[2025-02-08 14:31:44,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,320 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173615686]
[2025-02-08 14:31:44,320 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,325 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:44,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:44,329 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,329 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:44,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:44,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:44,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173615686]
[2025-02-08 14:31:44,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173615686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:44,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:44,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:44,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166133571]
[2025-02-08 14:31:44,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:44,377 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:44,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:44,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:44,378 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:44,378 INFO  L87              Difference]: Start difference. First operand 173 states and 269 transitions. cyclomatic complexity: 100 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:44,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:44,400 INFO  L93              Difference]: Finished difference Result 341 states and 525 transitions.
[2025-02-08 14:31:44,400 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 525 transitions.
[2025-02-08 14:31:44,403 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 340
[2025-02-08 14:31:44,420 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 525 transitions.
[2025-02-08 14:31:44,420 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 341
[2025-02-08 14:31:44,421 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 341
[2025-02-08 14:31:44,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 341 states and 525 transitions.
[2025-02-08 14:31:44,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:44,422 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 341 states and 525 transitions.
[2025-02-08 14:31:44,422 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 341 states and 525 transitions.
[2025-02-08 14:31:44,438 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341.
[2025-02-08 14:31:44,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 341 states, 341 states have (on average 1.5395894428152492) internal successors, (525), 340 states have internal predecessors, (525), 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-02-08 14:31:44,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 525 transitions.
[2025-02-08 14:31:44,444 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 341 states and 525 transitions.
[2025-02-08 14:31:44,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:44,445 INFO  L432   stractBuchiCegarLoop]: Abstraction has 341 states and 525 transitions.
[2025-02-08 14:31:44,445 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-08 14:31:44,445 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 525 transitions.
[2025-02-08 14:31:44,446 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 340
[2025-02-08 14:31:44,446 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,446 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,447 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,447 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:44,447 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:44,447 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1;" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:44,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 4 times
[2025-02-08 14:31:44,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110101375]
[2025-02-08 14:31:44,448 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:31:44,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,451 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes.
[2025-02-08 14:31:44,453 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,454 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:31:44,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,454 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,456 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,459 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -682123203, now seen corresponding path program 1 times
[2025-02-08 14:31:44,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962075730]
[2025-02-08 14:31:44,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:44,470 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:44,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:44,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:44,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:44,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962075730]
[2025-02-08 14:31:44,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962075730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:44,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:44,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:44,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994206102]
[2025-02-08 14:31:44,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:44,511 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:44,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:44,512 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:44,512 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:44,512 INFO  L87              Difference]: Start difference. First operand 341 states and 525 transitions. cyclomatic complexity: 192 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:44,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:44,542 INFO  L93              Difference]: Finished difference Result 673 states and 1025 transitions.
[2025-02-08 14:31:44,542 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1025 transitions.
[2025-02-08 14:31:44,546 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 672
[2025-02-08 14:31:44,549 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 1025 transitions.
[2025-02-08 14:31:44,549 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 673
[2025-02-08 14:31:44,550 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 673
[2025-02-08 14:31:44,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 673 states and 1025 transitions.
[2025-02-08 14:31:44,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:44,554 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 673 states and 1025 transitions.
[2025-02-08 14:31:44,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 673 states and 1025 transitions.
[2025-02-08 14:31:44,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673.
[2025-02-08 14:31:44,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 673 states, 673 states have (on average 1.5230312035661218) internal successors, (1025), 672 states have internal predecessors, (1025), 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-02-08 14:31:44,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1025 transitions.
[2025-02-08 14:31:44,581 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 673 states and 1025 transitions.
[2025-02-08 14:31:44,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:44,582 INFO  L432   stractBuchiCegarLoop]: Abstraction has 673 states and 1025 transitions.
[2025-02-08 14:31:44,582 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-08 14:31:44,582 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 673 states and 1025 transitions.
[2025-02-08 14:31:44,588 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 672
[2025-02-08 14:31:44,590 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,590 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,590 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,590 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:44,591 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:44,591 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1;" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:44,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 5 times
[2025-02-08 14:31:44,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521110736]
[2025-02-08 14:31:44,591 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:31:44,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,604 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,605 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,606 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:44,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,607 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,618 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,625 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,630 INFO  L85        PathProgramCache]: Analyzing trace with hash 1535634750, now seen corresponding path program 1 times
[2025-02-08 14:31:44,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,630 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939065459]
[2025-02-08 14:31:44,630 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,637 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:44,642 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:44,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,643 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:44,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:44,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:44,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939065459]
[2025-02-08 14:31:44,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939065459] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:44,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:44,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:44,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566696798]
[2025-02-08 14:31:44,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:44,667 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:44,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:44,668 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:44,668 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:44,668 INFO  L87              Difference]: Start difference. First operand 673 states and 1025 transitions. cyclomatic complexity: 368 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:44,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:44,714 INFO  L93              Difference]: Finished difference Result 1329 states and 2001 transitions.
[2025-02-08 14:31:44,714 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 1329 states and 2001 transitions.
[2025-02-08 14:31:44,742 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328
[2025-02-08 14:31:44,775 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 1329 states to 1329 states and 2001 transitions.
[2025-02-08 14:31:44,778 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 1329
[2025-02-08 14:31:44,780 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 1329
[2025-02-08 14:31:44,780 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 1329 states and 2001 transitions.
[2025-02-08 14:31:44,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:44,785 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 1329 states and 2001 transitions.
[2025-02-08 14:31:44,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1329 states and 2001 transitions.
[2025-02-08 14:31:44,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329.
[2025-02-08 14:31:44,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1329 states, 1329 states have (on average 1.5056433408577878) internal successors, (2001), 1328 states have internal predecessors, (2001), 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-02-08 14:31:44,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2001 transitions.
[2025-02-08 14:31:44,831 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 1329 states and 2001 transitions.
[2025-02-08 14:31:44,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:44,833 INFO  L432   stractBuchiCegarLoop]: Abstraction has 1329 states and 2001 transitions.
[2025-02-08 14:31:44,834 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-08 14:31:44,834 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 1329 states and 2001 transitions.
[2025-02-08 14:31:44,859 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328
[2025-02-08 14:31:44,859 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,860 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,861 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,861 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:44,862 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:44,862 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1;" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:44,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 6 times
[2025-02-08 14:31:44,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232061974]
[2025-02-08 14:31:44,866 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-08 14:31:44,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,873 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,881 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,881 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-02-08 14:31:44,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,881 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:44,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,888 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 1468627997, now seen corresponding path program 1 times
[2025-02-08 14:31:44,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102513287]
[2025-02-08 14:31:44,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:44,900 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:44,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:44,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:44,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:44,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102513287]
[2025-02-08 14:31:44,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102513287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:44,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:44,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:44,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969547545]
[2025-02-08 14:31:44,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:44,928 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:44,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:44,928 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:44,928 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:44,928 INFO  L87              Difference]: Start difference. First operand 1329 states and 2001 transitions. cyclomatic complexity: 704 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:44,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:44,961 INFO  L93              Difference]: Finished difference Result 2625 states and 3905 transitions.
[2025-02-08 14:31:44,961 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 2625 states and 3905 transitions.
[2025-02-08 14:31:44,978 INFO  L131   ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624
[2025-02-08 14:31:44,987 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 2625 states to 2625 states and 3905 transitions.
[2025-02-08 14:31:44,987 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 2625
[2025-02-08 14:31:44,989 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 2625
[2025-02-08 14:31:44,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2625 states and 3905 transitions.
[2025-02-08 14:31:44,991 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:44,991 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 2625 states and 3905 transitions.
[2025-02-08 14:31:44,992 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2625 states and 3905 transitions.
[2025-02-08 14:31:45,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625.
[2025-02-08 14:31:45,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2625 states, 2625 states have (on average 1.4876190476190476) internal successors, (3905), 2624 states have internal predecessors, (3905), 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-02-08 14:31:45,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3905 transitions.
[2025-02-08 14:31:45,053 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 2625 states and 3905 transitions.
[2025-02-08 14:31:45,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,054 INFO  L432   stractBuchiCegarLoop]: Abstraction has 2625 states and 3905 transitions.
[2025-02-08 14:31:45,054 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-08 14:31:45,054 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 2625 states and 3905 transitions.
[2025-02-08 14:31:45,063 INFO  L131   ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624
[2025-02-08 14:31:45,063 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,063 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,064 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,064 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:45,064 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:45,064 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1;" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:45,064 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,064 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 7 times
[2025-02-08 14:31:45,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939966326]
[2025-02-08 14:31:45,065 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-02-08 14:31:45,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,067 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,068 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,071 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,071 INFO  L85        PathProgramCache]: Analyzing trace with hash -1581574818, now seen corresponding path program 1 times
[2025-02-08 14:31:45,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555787954]
[2025-02-08 14:31:45,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:45,076 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:45,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:45,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555787954]
[2025-02-08 14:31:45,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555787954] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371387311]
[2025-02-08 14:31:45,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,097 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,098 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,098 INFO  L87              Difference]: Start difference. First operand 2625 states and 3905 transitions. cyclomatic complexity: 1344 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:45,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,129 INFO  L93              Difference]: Finished difference Result 5185 states and 7617 transitions.
[2025-02-08 14:31:45,129 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 5185 states and 7617 transitions.
[2025-02-08 14:31:45,154 INFO  L131   ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184
[2025-02-08 14:31:45,172 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 5185 states to 5185 states and 7617 transitions.
[2025-02-08 14:31:45,172 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 5185
[2025-02-08 14:31:45,175 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 5185
[2025-02-08 14:31:45,176 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5185 states and 7617 transitions.
[2025-02-08 14:31:45,182 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,182 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 5185 states and 7617 transitions.
[2025-02-08 14:31:45,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5185 states and 7617 transitions.
[2025-02-08 14:31:45,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5185.
[2025-02-08 14:31:45,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5185 states, 5185 states have (on average 1.4690453230472518) internal successors, (7617), 5184 states have internal predecessors, (7617), 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-02-08 14:31:45,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7617 transitions.
[2025-02-08 14:31:45,285 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 5185 states and 7617 transitions.
[2025-02-08 14:31:45,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,287 INFO  L432   stractBuchiCegarLoop]: Abstraction has 5185 states and 7617 transitions.
[2025-02-08 14:31:45,287 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-08 14:31:45,287 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 5185 states and 7617 transitions.
[2025-02-08 14:31:45,305 INFO  L131   ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184
[2025-02-08 14:31:45,305 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,305 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,306 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,306 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:45,306 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:45,306 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1;" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:45,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,306 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 8 times
[2025-02-08 14:31:45,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560428311]
[2025-02-08 14:31:45,306 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:31:45,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,308 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,309 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,309 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:45,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,309 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,316 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,316 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,318 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,318 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,319 INFO  L85        PathProgramCache]: Analyzing trace with hash 675336189, now seen corresponding path program 1 times
[2025-02-08 14:31:45,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886503775]
[2025-02-08 14:31:45,319 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:45,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:45,327 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,327 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:45,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886503775]
[2025-02-08 14:31:45,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886503775] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816216080]
[2025-02-08 14:31:45,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,345 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,345 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,345 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,345 INFO  L87              Difference]: Start difference. First operand 5185 states and 7617 transitions. cyclomatic complexity: 2560 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:45,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,387 INFO  L93              Difference]: Finished difference Result 10241 states and 14849 transitions.
[2025-02-08 14:31:45,387 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 10241 states and 14849 transitions.
[2025-02-08 14:31:45,493 INFO  L131   ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240
[2025-02-08 14:31:45,533 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 10241 states to 10241 states and 14849 transitions.
[2025-02-08 14:31:45,533 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 10241
[2025-02-08 14:31:45,545 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 10241
[2025-02-08 14:31:45,545 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10241 states and 14849 transitions.
[2025-02-08 14:31:45,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,554 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 10241 states and 14849 transitions.
[2025-02-08 14:31:45,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10241 states and 14849 transitions.
[2025-02-08 14:31:45,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10241.
[2025-02-08 14:31:45,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10241 states, 10241 states have (on average 1.4499560589786153) internal successors, (14849), 10240 states have internal predecessors, (14849), 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-02-08 14:31:45,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10241 states to 10241 states and 14849 transitions.
[2025-02-08 14:31:45,827 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 10241 states and 14849 transitions.
[2025-02-08 14:31:45,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,830 INFO  L432   stractBuchiCegarLoop]: Abstraction has 10241 states and 14849 transitions.
[2025-02-08 14:31:45,830 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 9 ============
[2025-02-08 14:31:45,830 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 10241 states and 14849 transitions.
[2025-02-08 14:31:45,867 INFO  L131   ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240
[2025-02-08 14:31:45,867 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,868 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,868 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,868 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:45,868 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:45,869 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1;" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:45,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 9 times
[2025-02-08 14:31:45,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798766600]
[2025-02-08 14:31:45,872 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:31:45,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,876 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,878 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,878 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:31:45,878 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,878 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,879 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:45,882 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,882 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,884 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,885 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,885 INFO  L85        PathProgramCache]: Analyzing trace with hash 886687102, now seen corresponding path program 1 times
[2025-02-08 14:31:45,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067437884]
[2025-02-08 14:31:45,886 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,894 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:45,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:45,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:45,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067437884]
[2025-02-08 14:31:45,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067437884] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873603200]
[2025-02-08 14:31:45,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,921 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,922 INFO  L87              Difference]: Start difference. First operand 10241 states and 14849 transitions. cyclomatic complexity: 4864 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:45,997 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,998 INFO  L93              Difference]: Finished difference Result 20225 states and 28929 transitions.
[2025-02-08 14:31:45,998 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 20225 states and 28929 transitions.
[2025-02-08 14:31:46,098 INFO  L131   ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224
[2025-02-08 14:31:46,221 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 20225 states to 20225 states and 28929 transitions.
[2025-02-08 14:31:46,221 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 20225
[2025-02-08 14:31:46,234 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 20225
[2025-02-08 14:31:46,234 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20225 states and 28929 transitions.
[2025-02-08 14:31:46,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:46,286 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 20225 states and 28929 transitions.
[2025-02-08 14:31:46,357 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20225 states and 28929 transitions.
[2025-02-08 14:31:46,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 20225.
[2025-02-08 14:31:46,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20225 states, 20225 states have (on average 1.4303584672435106) internal successors, (28929), 20224 states have internal predecessors, (28929), 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-02-08 14:31:46,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 28929 transitions.
[2025-02-08 14:31:46,665 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 20225 states and 28929 transitions.
[2025-02-08 14:31:46,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:46,666 INFO  L432   stractBuchiCegarLoop]: Abstraction has 20225 states and 28929 transitions.
[2025-02-08 14:31:46,666 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 10 ============
[2025-02-08 14:31:46,666 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 20225 states and 28929 transitions.
[2025-02-08 14:31:46,705 INFO  L131   ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224
[2025-02-08 14:31:46,706 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:46,706 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:46,706 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:46,706 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:46,706 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:46,706 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1;" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:46,707 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:46,707 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 10 times
[2025-02-08 14:31:46,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:46,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715467220]
[2025-02-08 14:31:46,707 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:31:46,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:46,709 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes.
[2025-02-08 14:31:46,709 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:46,709 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:31:46,709 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:46,709 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:46,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:46,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:46,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:46,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:46,712 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:46,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:46,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 42215231, now seen corresponding path program 1 times
[2025-02-08 14:31:46,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:46,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429113922]
[2025-02-08 14:31:46,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:46,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:46,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:46,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:46,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:46,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:46,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:46,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:46,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429113922]
[2025-02-08 14:31:46,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429113922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:46,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:46,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:46,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553720814]
[2025-02-08 14:31:46,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:46,731 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:46,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:46,731 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:46,731 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:46,732 INFO  L87              Difference]: Start difference. First operand 20225 states and 28929 transitions. cyclomatic complexity: 9216 Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-08 14:31:46,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:46,888 INFO  L93              Difference]: Finished difference Result 39937 states and 56321 transitions.
[2025-02-08 14:31:46,888 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 39937 states and 56321 transitions.
[2025-02-08 14:31:47,120 INFO  L131   ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936
[2025-02-08 14:31:47,285 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 39937 states to 39937 states and 56321 transitions.
[2025-02-08 14:31:47,285 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 39937
[2025-02-08 14:31:47,313 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 39937
[2025-02-08 14:31:47,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39937 states and 56321 transitions.
[2025-02-08 14:31:47,345 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:47,345 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 39937 states and 56321 transitions.
[2025-02-08 14:31:47,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39937 states and 56321 transitions.
[2025-02-08 14:31:47,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39937.
[2025-02-08 14:31:47,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39937 states, 39937 states have (on average 1.4102461376668252) internal successors, (56321), 39936 states have internal predecessors, (56321), 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-02-08 14:31:48,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39937 states to 39937 states and 56321 transitions.
[2025-02-08 14:31:48,019 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 39937 states and 56321 transitions.
[2025-02-08 14:31:48,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:48,022 INFO  L432   stractBuchiCegarLoop]: Abstraction has 39937 states and 56321 transitions.
[2025-02-08 14:31:48,022 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 11 ============
[2025-02-08 14:31:48,022 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 39937 states and 56321 transitions.
[2025-02-08 14:31:48,134 INFO  L131   ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936
[2025-02-08 14:31:48,135 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:48,135 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:48,137 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:48,137 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop 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]
[2025-02-08 14:31:48,137 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1;" 
[2025-02-08 14:31:48,137 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;" "assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0;" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p6~0#1);" "assume !(0 != main_~p7~0#1);" "assume !(0 != main_~p8~0#1);" "assume !(0 != main_~p9~0#1);" "assume !(0 != main_~p10~0#1);" "assume !(0 != main_~p11~0#1);" "assume !(0 != main_~p12~0#1);" "assume !(0 != main_~p13~0#1);" "assume 0 != main_~p14~0#1;" "assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0;" 
[2025-02-08 14:31:48,137 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:48,138 INFO  L85        PathProgramCache]: Analyzing trace with hash 170, now seen corresponding path program 11 times
[2025-02-08 14:31:48,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:48,138 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085162691]
[2025-02-08 14:31:48,138 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:31:48,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:48,141 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:48,143 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:48,143 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:48,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,143 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:48,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:48,146 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:48,146 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,146 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,147 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:48,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:48,148 INFO  L85        PathProgramCache]: Analyzing trace with hash -954857122, now seen corresponding path program 1 times
[2025-02-08 14:31:48,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:48,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871415427]
[2025-02-08 14:31:48,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:48,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:48,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:48,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:48,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,154 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:48,155 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-02-08 14:31:48,156 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-02-08 14:31:48,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,162 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:48,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:48,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -629070329, now seen corresponding path program 1 times
[2025-02-08 14:31:48,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:48,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772552701]
[2025-02-08 14:31:48,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:48,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:48,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-08 14:31:48,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-08 14:31:48,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,172 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,173 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:48,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-08 14:31:48,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-08 14:31:48,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,176 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,179 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:48,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:48,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:48,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,817 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:48,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:48,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-02-08 14:31:48,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:48,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:48,878 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:31:48 BoogieIcfgContainer
[2025-02-08 14:31:48,878 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-08 14:31:48,878 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 14:31:48,878 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 14:31:48,879 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 14:31:48,879 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:43" (3/4) ...
[2025-02-08 14:31:48,882 INFO  L143         WitnessPrinter]: Generating witness for non-termination counterexample
[2025-02-08 14:31:48,916 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 14:31:48,917 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: Toolchain (without parser) took 6241.11ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 115.7MB in the beginning and 308.2MB in the end (delta: -192.6MB). Peak memory consumption was 349.5MB. Max. memory is 16.1GB.
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory was 148.5MB in the beginning and 148.2MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 185.45ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 104.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 102.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: Boogie Preprocessor took 70.63ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 977.3kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:48,919 INFO  L158              Benchmark]: IcfgBuilder took 460.96ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 84.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-08 14:31:48,920 INFO  L158              Benchmark]: BuchiAutomizer took 5422.21ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 84.7MB in the beginning and 311.8MB in the end (delta: -227.2MB). Peak memory consumption was 316.0MB. Max. memory is 16.1GB.
[2025-02-08 14:31:48,920 INFO  L158              Benchmark]: Witness Printer took 38.20ms. Allocated memory is still 687.9MB. Free memory was 311.8MB in the beginning and 308.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:48,921 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory was 148.5MB in the beginning and 148.2MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 185.45ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 104.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 102.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 70.63ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 977.3kB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 460.96ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 84.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 5422.21ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 84.7MB in the beginning and 311.8MB in the end (delta: -227.2MB). Peak memory consumption was 316.0MB. Max. memory is 16.1GB.
 * Witness Printer took 38.20ms. Allocated memory is still 687.9MB. Free memory was 311.8MB in the beginning and 308.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39937 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 5.3s and 11 iterations.  TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [0, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 1733 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1067 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 53]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L8]         int p1 = __VERIFIER_nondet_int();
[L9]         int lk1;
[L11]        int p2 = __VERIFIER_nondet_int();
[L12]        int lk2;
[L14]        int p3 = __VERIFIER_nondet_int();
[L15]        int lk3;
[L17]        int p4 = __VERIFIER_nondet_int();
[L18]        int lk4;
[L20]        int p5 = __VERIFIER_nondet_int();
[L21]        int lk5;
[L23]        int p6 = __VERIFIER_nondet_int();
[L24]        int lk6;
[L26]        int p7 = __VERIFIER_nondet_int();
[L27]        int lk7;
[L29]        int p8 = __VERIFIER_nondet_int();
[L30]        int lk8;
[L32]        int p9 = __VERIFIER_nondet_int();
[L33]        int lk9;
[L35]        int p10 = __VERIFIER_nondet_int();
[L36]        int lk10;
[L38]        int p11 = __VERIFIER_nondet_int();
[L39]        int lk11;
[L41]        int p12 = __VERIFIER_nondet_int();
[L42]        int lk12;
[L44]        int p13 = __VERIFIER_nondet_int();
[L45]        int lk13;
[L47]        int p14 = __VERIFIER_nondet_int();
[L48]        int lk14;
[L51]        int cond;
Loop:
[L53]   COND TRUE   1
[L54]               cond = __VERIFIER_nondet_int()
[L55]   COND FALSE  !(cond == 0)
[L58]               lk1 = 0
[L60]               lk2 = 0
[L62]               lk3 = 0
[L64]               lk4 = 0
[L66]               lk5 = 0
[L68]               lk6 = 0
[L70]               lk7 = 0
[L72]               lk8 = 0
[L74]               lk9 = 0
[L76]               lk10 = 0
[L78]               lk11 = 0
[L80]               lk12 = 0
[L82]               lk13 = 0
[L84]               lk14 = 0
[L88]   COND FALSE  !(p1 != 0)
[L92]   COND TRUE   p2 != 0
[L93]               lk2 = 1
[L96]   COND FALSE  !(p3 != 0)
[L100]  COND FALSE  !(p4 != 0)
[L104]  COND FALSE  !(p5 != 0)
[L108]  COND FALSE  !(p6 != 0)
[L112]  COND FALSE  !(p7 != 0)
[L116]  COND FALSE  !(p8 != 0)
[L120]  COND FALSE  !(p9 != 0)
[L124]  COND FALSE  !(p10 != 0)
[L128]  COND FALSE  !(p11 != 0)
[L132]  COND FALSE  !(p12 != 0)
[L136]  COND FALSE  !(p13 != 0)
[L140]  COND TRUE   p14 != 0
[L141]              lk14 = 1
[L146]  COND FALSE  !(p1 != 0)
[L151]  COND TRUE   p2 != 0
[L152]  COND FALSE  !(lk2 != 1)
[L153]              lk2 = 0
[L156]  COND FALSE  !(p3 != 0)
[L161]  COND FALSE  !(p4 != 0)
[L166]  COND FALSE  !(p5 != 0)
[L171]  COND FALSE  !(p6 != 0)
[L176]  COND FALSE  !(p7 != 0)
[L181]  COND FALSE  !(p8 != 0)
[L186]  COND FALSE  !(p9 != 0)
[L191]  COND FALSE  !(p10 != 0)
[L196]  COND FALSE  !(p11 != 0)
[L201]  COND FALSE  !(p12 != 0)
[L206]  COND FALSE  !(p13 != 0)
[L211]  COND TRUE   p14 != 0
[L212]  COND FALSE  !(lk14 != 1)
[L213]              lk14 = 0
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 53]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L8]         int p1 = __VERIFIER_nondet_int();
[L9]         int lk1;
[L11]        int p2 = __VERIFIER_nondet_int();
[L12]        int lk2;
[L14]        int p3 = __VERIFIER_nondet_int();
[L15]        int lk3;
[L17]        int p4 = __VERIFIER_nondet_int();
[L18]        int lk4;
[L20]        int p5 = __VERIFIER_nondet_int();
[L21]        int lk5;
[L23]        int p6 = __VERIFIER_nondet_int();
[L24]        int lk6;
[L26]        int p7 = __VERIFIER_nondet_int();
[L27]        int lk7;
[L29]        int p8 = __VERIFIER_nondet_int();
[L30]        int lk8;
[L32]        int p9 = __VERIFIER_nondet_int();
[L33]        int lk9;
[L35]        int p10 = __VERIFIER_nondet_int();
[L36]        int lk10;
[L38]        int p11 = __VERIFIER_nondet_int();
[L39]        int lk11;
[L41]        int p12 = __VERIFIER_nondet_int();
[L42]        int lk12;
[L44]        int p13 = __VERIFIER_nondet_int();
[L45]        int lk13;
[L47]        int p14 = __VERIFIER_nondet_int();
[L48]        int lk14;
[L51]        int cond;
Loop:
[L53]   COND TRUE   1
[L54]               cond = __VERIFIER_nondet_int()
[L55]   COND FALSE  !(cond == 0)
[L58]               lk1 = 0
[L60]               lk2 = 0
[L62]               lk3 = 0
[L64]               lk4 = 0
[L66]               lk5 = 0
[L68]               lk6 = 0
[L70]               lk7 = 0
[L72]               lk8 = 0
[L74]               lk9 = 0
[L76]               lk10 = 0
[L78]               lk11 = 0
[L80]               lk12 = 0
[L82]               lk13 = 0
[L84]               lk14 = 0
[L88]   COND FALSE  !(p1 != 0)
[L92]   COND TRUE   p2 != 0
[L93]               lk2 = 1
[L96]   COND FALSE  !(p3 != 0)
[L100]  COND FALSE  !(p4 != 0)
[L104]  COND FALSE  !(p5 != 0)
[L108]  COND FALSE  !(p6 != 0)
[L112]  COND FALSE  !(p7 != 0)
[L116]  COND FALSE  !(p8 != 0)
[L120]  COND FALSE  !(p9 != 0)
[L124]  COND FALSE  !(p10 != 0)
[L128]  COND FALSE  !(p11 != 0)
[L132]  COND FALSE  !(p12 != 0)
[L136]  COND FALSE  !(p13 != 0)
[L140]  COND TRUE   p14 != 0
[L141]              lk14 = 1
[L146]  COND FALSE  !(p1 != 0)
[L151]  COND TRUE   p2 != 0
[L152]  COND FALSE  !(lk2 != 1)
[L153]              lk2 = 0
[L156]  COND FALSE  !(p3 != 0)
[L161]  COND FALSE  !(p4 != 0)
[L166]  COND FALSE  !(p5 != 0)
[L171]  COND FALSE  !(p6 != 0)
[L176]  COND FALSE  !(p7 != 0)
[L181]  COND FALSE  !(p8 != 0)
[L186]  COND FALSE  !(p9 != 0)
[L191]  COND FALSE  !(p10 != 0)
[L196]  COND FALSE  !(p11 != 0)
[L201]  COND FALSE  !(p12 != 0)
[L206]  COND FALSE  !(p13 != 0)
[L211]  COND TRUE   p14 != 0
[L212]  COND FALSE  !(lk14 != 1)
[L213]              lk14 = 0
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2025-02-08 14:31:48,937 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)