./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_5.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_5.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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 14:31:42,401 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 14:31:42,448 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:42,451 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 14:31:42,451 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 14:31:42,452 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-08 14:31:42,465 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 14:31:42,466 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 14:31:42,466 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 14:31:42,466 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 14:31:42,466 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 14:31:42,467 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 14:31:42,467 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-08 14:31:42,467 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-08 14:31:42,468 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 14:31:42,468 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 14:31:42,469 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-08 14:31:42,469 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 14:31:42,469 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 14:31:42,469 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 14:31:42,469 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 14:31:42,469 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 14:31:42,469 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 14:31:42,469 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-08 14:31:42,469 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685
[2025-02-08 14:31:42,645 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 14:31:42,650 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 14:31:42,652 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 14:31:42,653 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 14:31:42,653 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 14:31:42,654 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c
[2025-02-08 14:31:43,758 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb45328c3/43fbc53652ce42e29a53757d62c59ea3/FLAGe5e625c57
[2025-02-08 14:31:43,966 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 14:31:43,966 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c
[2025-02-08 14:31:43,990 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb45328c3/43fbc53652ce42e29a53757d62c59ea3/FLAGe5e625c57
[2025-02-08 14:31:44,326 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb45328c3/43fbc53652ce42e29a53757d62c59ea3
[2025-02-08 14:31:44,328 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 14:31:44,329 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 14:31:44,330 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 14:31:44,330 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 14:31:44,333 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 14:31:44,333 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:44" (1/1) ...
[2025-02-08 14:31:44,335 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:44, skipping insertion in model container
[2025-02-08 14:31:44,335 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:31:44" (1/1) ...
[2025-02-08 14:31:44,347 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 14:31:44,459 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:31:44,467 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 14:31:44,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 14:31:44,495 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 14:31:44,495 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:44 WrapperNode
[2025-02-08 14:31:44,496 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 14:31:44,496 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 14:31:44,496 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 14:31:44,497 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 14:31:44,501 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:44" (1/1) ...
[2025-02-08 14:31:44,506 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:44" (1/1) ...
[2025-02-08 14:31:44,516 INFO  L138                Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80
[2025-02-08 14:31:44,516 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 14:31:44,517 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 14:31:44,517 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 14:31:44,517 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 14:31:44,522 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:44" (1/1) ...
[2025-02-08 14:31:44,522 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:44" (1/1) ...
[2025-02-08 14:31:44,522 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:44" (1/1) ...
[2025-02-08 14:31:44,529 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:44,530 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:44" (1/1) ...
[2025-02-08 14:31:44,530 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:44" (1/1) ...
[2025-02-08 14:31:44,535 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:44" (1/1) ...
[2025-02-08 14:31:44,535 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:44" (1/1) ...
[2025-02-08 14:31:44,536 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:44" (1/1) ...
[2025-02-08 14:31:44,536 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:44" (1/1) ...
[2025-02-08 14:31:44,537 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 14:31:44,541 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 14:31:44,541 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 14:31:44,541 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 14:31:44,542 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:44" (1/1) ...
[2025-02-08 14:31:44,547 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-08 14:31:44,558 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 14:31:44,573 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:44,582 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:44,601 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 14:31:44,601 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 14:31:44,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 14:31:44,602 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 14:31:44,646 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 14:31:44,647 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 14:31:44,759 INFO  L1324  $ProcedureCfgBuilder]: dead code at ProgramPoint L93: 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:44,766 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-02-08 14:31:44,766 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 14:31:44,774 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 14:31:44,774 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 14:31:44,774 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:44 BoogieIcfgContainer
[2025-02-08 14:31:44,774 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 14:31:44,775 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-08 14:31:44,776 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-08 14:31:44,780 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-08 14:31:44,781 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:44,781 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:31:44" (1/3) ...
[2025-02-08 14:31:44,782 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c3f516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:44, skipping insertion in model container
[2025-02-08 14:31:44,782 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:44,782 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:31:44" (2/3) ...
[2025-02-08 14:31:44,783 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c3f516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:31:44, skipping insertion in model container
[2025-02-08 14:31:44,783 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-08 14:31:44,783 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:31:44" (3/3) ...
[2025-02-08 14:31:44,784 INFO  L363   chiAutomizerObserver]: Analyzing ICFG test_locks_5.c
[2025-02-08 14:31:44,826 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-08 14:31:44,827 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-08 14:31:44,827 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-08 14:31:44,827 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-08 14:31:44,827 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-08 14:31:44,827 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-08 14:31:44,827 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-08 14:31:44,827 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-08 14:31:44,832 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 23 states, 20 states have (on average 1.85) internal successors, (37), 22 states have internal predecessors, (37), 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,849 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2025-02-08 14:31:44,849 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,849 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,857 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,857 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:44,857 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-08 14:31:44,857 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 23 states, 20 states have (on average 1.85) internal successors, (37), 22 states have internal predecessors, (37), 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,858 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 17
[2025-02-08 14:31:44,859 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:44,859 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:44,859 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:44,859 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:44,866 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:44,869 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "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;main_~lk3~0#1 := 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_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:44,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times
[2025-02-08 14:31:44,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305956363]
[2025-02-08 14:31:44,889 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,961 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,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,962 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:44,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:44,968 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,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:44,984 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:44,986 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:44,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 1055666957, now seen corresponding path program 1 times
[2025-02-08 14:31:44,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:44,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892564223]
[2025-02-08 14:31:44,986 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:44,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:44,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:44,999 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:44,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:44,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,079 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,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892564223]
[2025-02-08 14:31:45,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892564223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831485256]
[2025-02-08 14:31:45,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,087 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,109 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,110 INFO  L87              Difference]: Start difference. First operand  has 23 states, 20 states have (on average 1.85) internal successors, (37), 22 states have internal predecessors, (37), 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 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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,141 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,142 INFO  L93              Difference]: Finished difference Result 38 states and 63 transitions.
[2025-02-08 14:31:45,143 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 63 transitions.
[2025-02-08 14:31:45,144 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 33
[2025-02-08 14:31:45,149 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 52 transitions.
[2025-02-08 14:31:45,149 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 34
[2025-02-08 14:31:45,150 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 34
[2025-02-08 14:31:45,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 52 transitions.
[2025-02-08 14:31:45,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,151 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 34 states and 52 transitions.
[2025-02-08 14:31:45,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states and 52 transitions.
[2025-02-08 14:31:45,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2025-02-08 14:31:45,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 33 states have internal predecessors, (52), 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,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions.
[2025-02-08 14:31:45,168 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 34 states and 52 transitions.
[2025-02-08 14:31:45,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,171 INFO  L432   stractBuchiCegarLoop]: Abstraction has 34 states and 52 transitions.
[2025-02-08 14:31:45,171 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-08 14:31:45,171 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions.
[2025-02-08 14:31:45,172 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 33
[2025-02-08 14:31:45,172 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,172 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,172 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,172 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:45,173 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:45,173 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "assume !(0 != main_~p1~0#1);" "assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1;" "assume 0 != main_~p3~0#1;main_~lk3~0#1 := 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_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:45,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 2 times
[2025-02-08 14:31:45,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156695853]
[2025-02-08 14:31:45,174 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 14:31:45,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,177 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,179 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,179 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:45,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,180 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,190 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,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,192 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,192 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 859153452, now seen corresponding path program 1 times
[2025-02-08 14:31:45,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929335001]
[2025-02-08 14:31:45,193 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,201 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:45,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:45,212 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,212 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,232 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,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929335001]
[2025-02-08 14:31:45,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929335001] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243499404]
[2025-02-08 14:31:45,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,234 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,235 INFO  L87              Difference]: Start difference. First operand 34 states and 52 transitions. cyclomatic complexity: 20 Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,247 INFO  L93              Difference]: Finished difference Result 65 states and 97 transitions.
[2025-02-08 14:31:45,247 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 97 transitions.
[2025-02-08 14:31:45,248 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 64
[2025-02-08 14:31:45,249 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 97 transitions.
[2025-02-08 14:31:45,249 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 65
[2025-02-08 14:31:45,249 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 65
[2025-02-08 14:31:45,250 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions.
[2025-02-08 14:31:45,250 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,250 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 65 states and 97 transitions.
[2025-02-08 14:31:45,250 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions.
[2025-02-08 14:31:45,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2025-02-08 14:31:45,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 65 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 64 states have internal predecessors, (97), 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,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions.
[2025-02-08 14:31:45,253 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 65 states and 97 transitions.
[2025-02-08 14:31:45,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,254 INFO  L432   stractBuchiCegarLoop]: Abstraction has 65 states and 97 transitions.
[2025-02-08 14:31:45,254 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-08 14:31:45,254 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions.
[2025-02-08 14:31:45,255 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 64
[2025-02-08 14:31:45,255 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,255 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,255 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,255 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:45,256 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:45,256 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume 0 != main_~p3~0#1;main_~lk3~0#1 := 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_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:45,256 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 3 times
[2025-02-08 14:31:45,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047404538]
[2025-02-08 14:31:45,256 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-08 14:31:45,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,262 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,263 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,263 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-08 14:31:45,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,264 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,266 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,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,267 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -948301011, now seen corresponding path program 1 times
[2025-02-08 14:31:45,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896076481]
[2025-02-08 14:31:45,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:45,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:45,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,286 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,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896076481]
[2025-02-08 14:31:45,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896076481] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017945671]
[2025-02-08 14:31:45,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,287 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,288 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,288 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,288 INFO  L87              Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 36 Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,300 INFO  L93              Difference]: Finished difference Result 125 states and 181 transitions.
[2025-02-08 14:31:45,300 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 181 transitions.
[2025-02-08 14:31:45,302 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 124
[2025-02-08 14:31:45,303 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 181 transitions.
[2025-02-08 14:31:45,303 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 125
[2025-02-08 14:31:45,303 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 125
[2025-02-08 14:31:45,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 125 states and 181 transitions.
[2025-02-08 14:31:45,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,304 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 125 states and 181 transitions.
[2025-02-08 14:31:45,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states and 181 transitions.
[2025-02-08 14:31:45,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2025-02-08 14:31:45,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 125 states, 125 states have (on average 1.448) internal successors, (181), 124 states have internal predecessors, (181), 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,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions.
[2025-02-08 14:31:45,309 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 125 states and 181 transitions.
[2025-02-08 14:31:45,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,310 INFO  L432   stractBuchiCegarLoop]: Abstraction has 125 states and 181 transitions.
[2025-02-08 14:31:45,310 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-08 14:31:45,310 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 181 transitions.
[2025-02-08 14:31:45,312 INFO  L131   ngComponentsAnalysis]: Automaton has 8 accepting balls. 124
[2025-02-08 14:31:45,312 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,312 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,312 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,312 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:45,312 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:45,313 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#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_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:45,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 4 times
[2025-02-08 14:31:45,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880243394]
[2025-02-08 14:31:45,314 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-08 14:31:45,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,317 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes.
[2025-02-08 14:31:45,319 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:45,319 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-08 14:31:45,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,319 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,320 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,321 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,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,322 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,323 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,323 INFO  L85        PathProgramCache]: Analyzing trace with hash 794509324, now seen corresponding path program 1 times
[2025-02-08 14:31:45,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807453044]
[2025-02-08 14:31:45,323 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 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 12 of 12 statements.
[2025-02-08 14:31:45,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 14:31:45,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807453044]
[2025-02-08 14:31:45,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807453044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 14:31:45,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651074410]
[2025-02-08 14:31:45,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,341 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,342 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 125 states and 181 transitions. cyclomatic complexity: 64 Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,358 INFO  L93              Difference]: Finished difference Result 241 states and 337 transitions.
[2025-02-08 14:31:45,358 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 337 transitions.
[2025-02-08 14:31:45,360 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 240
[2025-02-08 14:31:45,362 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 337 transitions.
[2025-02-08 14:31:45,362 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 241
[2025-02-08 14:31:45,363 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 241
[2025-02-08 14:31:45,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 241 states and 337 transitions.
[2025-02-08 14:31:45,363 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,364 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 241 states and 337 transitions.
[2025-02-08 14:31:45,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 241 states and 337 transitions.
[2025-02-08 14:31:45,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241.
[2025-02-08 14:31:45,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 241 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 240 states have internal predecessors, (337), 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,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions.
[2025-02-08 14:31:45,373 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 241 states and 337 transitions.
[2025-02-08 14:31:45,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,374 INFO  L432   stractBuchiCegarLoop]: Abstraction has 241 states and 337 transitions.
[2025-02-08 14:31:45,374 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-08 14:31:45,374 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 337 transitions.
[2025-02-08 14:31:45,376 INFO  L131   ngComponentsAnalysis]: Automaton has 16 accepting balls. 240
[2025-02-08 14:31:45,376 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,376 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,376 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,376 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:45,376 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:45,376 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#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_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:45,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 5 times
[2025-02-08 14:31:45,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731688104]
[2025-02-08 14:31:45,377 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-08 14:31:45,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,380 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,382 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:45,382 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-08 14:31:45,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,382 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,384 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,385 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,385 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,386 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,386 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 1682013005, now seen corresponding path program 1 times
[2025-02-08 14:31:45,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,386 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404806767]
[2025-02-08 14:31:45,387 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,389 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:45,390 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:45,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 14:31:45,403 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,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 14:31:45,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404806767]
[2025-02-08 14:31:45,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404806767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 14:31:45,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 14:31:45,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 14:31:45,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214409062]
[2025-02-08 14:31:45,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 14:31:45,404 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-08 14:31:45,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 14:31:45,404 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 14:31:45,404 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 14:31:45,404 INFO  L87              Difference]: Start difference. First operand 241 states and 337 transitions. cyclomatic complexity: 112 Second operand  has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 14:31:45,418 INFO  L93              Difference]: Finished difference Result 465 states and 625 transitions.
[2025-02-08 14:31:45,418 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 625 transitions.
[2025-02-08 14:31:45,421 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 464
[2025-02-08 14:31:45,423 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 465 states and 625 transitions.
[2025-02-08 14:31:45,424 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 465
[2025-02-08 14:31:45,424 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 465
[2025-02-08 14:31:45,424 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 465 states and 625 transitions.
[2025-02-08 14:31:45,425 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-08 14:31:45,426 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 465 states and 625 transitions.
[2025-02-08 14:31:45,426 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 465 states and 625 transitions.
[2025-02-08 14:31:45,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465.
[2025-02-08 14:31:45,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 465 states, 465 states have (on average 1.3440860215053763) internal successors, (625), 464 states have internal predecessors, (625), 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,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 625 transitions.
[2025-02-08 14:31:45,440 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 465 states and 625 transitions.
[2025-02-08 14:31:45,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 14:31:45,441 INFO  L432   stractBuchiCegarLoop]: Abstraction has 465 states and 625 transitions.
[2025-02-08 14:31:45,441 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-08 14:31:45,441 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 625 transitions.
[2025-02-08 14:31:45,443 INFO  L131   ngComponentsAnalysis]: Automaton has 32 accepting balls. 464
[2025-02-08 14:31:45,443 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-08 14:31:45,443 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-08 14:31:45,444 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1]
[2025-02-08 14:31:45,444 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 14:31:45,444 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(15, 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_~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_~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_~cond~0#1;" 
[2025-02-08 14:31:45,444 INFO  L754   eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#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;" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" "assume !(0 != main_~p1~0#1);" "assume !(0 != main_~p2~0#1);" "assume !(0 != main_~p3~0#1);" "assume !(0 != main_~p4~0#1);" "assume !(0 != main_~p5~0#1);" 
[2025-02-08 14:31:45,444 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 6 times
[2025-02-08 14:31:45,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100328078]
[2025-02-08 14:31:45,445 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-08 14:31:45,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,448 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,450 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:45,450 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-02-08 14:31:45,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,450 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,452 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,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,453 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 1710642156, now seen corresponding path program 1 times
[2025-02-08 14:31:45,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736424629]
[2025-02-08 14:31:45,454 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,457 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:45,458 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:45,458 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,458 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,458 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,459 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-08 14:31:45,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-08 14:31:45,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,462 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,462 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 14:31:45,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -2047179966, now seen corresponding path program 1 times
[2025-02-08 14:31:45,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 14:31:45,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453044460]
[2025-02-08 14:31:45,463 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 14:31:45,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 14:31:45,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-08 14:31:45,468 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-08 14:31:45,468 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,468 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,468 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-02-08 14:31:45,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-02-08 14:31:45,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,472 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,474 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-08 14:31:45,673 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,674 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,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,674 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-08 14:31:45,677 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-02-08 14:31:45,678 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,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 14:31:45,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-08 14:31:45,701 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:31:45 BoogieIcfgContainer
[2025-02-08 14:31:45,701 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-08 14:31:45,702 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-08 14:31:45,702 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-08 14:31:45,702 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-08 14:31:45,706 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:44" (3/4) ...
[2025-02-08 14:31:45,708 INFO  L143         WitnessPrinter]: Generating witness for non-termination counterexample
[2025-02-08 14:31:45,758 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-08 14:31:45,758 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-08 14:31:45,758 INFO  L158              Benchmark]: Toolchain (without parser) took 1429.65ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 61.8MB in the end (delta: 94.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
[2025-02-08 14:31:45,758 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:45,758 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 166.31ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 145.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-08 14:31:45,759 INFO  L158              Benchmark]: Boogie Procedure Inliner took 19.79ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 143.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:45,759 INFO  L158              Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 142.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:45,759 INFO  L158              Benchmark]: IcfgBuilder took 233.76ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 130.5MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-08 14:31:45,759 INFO  L158              Benchmark]: BuchiAutomizer took 925.64ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 64.6MB in the end (delta: 65.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
[2025-02-08 14:31:45,763 INFO  L158              Benchmark]: Witness Printer took 56.12ms. Allocated memory is still 201.3MB. Free memory was 64.6MB in the beginning and 61.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-08 14:31:45,764 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 166.31ms. Allocated memory is still 201.3MB. Free memory was 155.4MB in the beginning and 145.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 19.79ms. Allocated memory is still 201.3MB. Free memory was 145.0MB in the beginning and 143.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 23.75ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 142.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 233.76ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 130.5MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 925.64ms. Allocated memory is still 201.3MB. Free memory was 130.5MB in the beginning and 64.6MB in the end (delta: 65.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB.
 * Witness Printer took 56.12ms. Allocated memory is still 201.3MB. Free memory was 64.6MB in the beginning and 61.8MB in the end (delta: 2.7MB). 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 465 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 0.8s and 6 iterations.  TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 106 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 206 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI5 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: 26]: 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;
[L24]        int cond;
Loop:
[L26]  COND TRUE   1
[L27]              cond = __VERIFIER_nondet_int()
[L28]  COND FALSE  !(cond == 0)
[L31]              lk1 = 0
[L33]              lk2 = 0
[L35]              lk3 = 0
[L37]              lk4 = 0
[L39]              lk5 = 0
[L43]  COND FALSE  !(p1 != 0)
[L47]  COND FALSE  !(p2 != 0)
[L51]  COND FALSE  !(p3 != 0)
[L55]  COND FALSE  !(p4 != 0)
[L59]  COND FALSE  !(p5 != 0)
[L65]  COND FALSE  !(p1 != 0)
[L70]  COND FALSE  !(p2 != 0)
[L75]  COND FALSE  !(p3 != 0)
[L80]  COND FALSE  !(p4 != 0)
[L85]  COND FALSE  !(p5 != 0)
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 26]: 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;
[L24]        int cond;
Loop:
[L26]  COND TRUE   1
[L27]              cond = __VERIFIER_nondet_int()
[L28]  COND FALSE  !(cond == 0)
[L31]              lk1 = 0
[L33]              lk2 = 0
[L35]              lk3 = 0
[L37]              lk4 = 0
[L39]              lk5 = 0
[L43]  COND FALSE  !(p1 != 0)
[L47]  COND FALSE  !(p2 != 0)
[L51]  COND FALSE  !(p3 != 0)
[L55]  COND FALSE  !(p4 != 0)
[L59]  COND FALSE  !(p5 != 0)
[L65]  COND FALSE  !(p1 != 0)
[L70]  COND FALSE  !(p2 != 0)
[L75]  COND FALSE  !(p3 != 0)
[L80]  COND FALSE  !(p4 != 0)
[L85]  COND FALSE  !(p5 != 0)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2025-02-08 14:31:45,790 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)