./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:15:09,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:15:09,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:15:09,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:15:09,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:15:09,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:15:09,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:15:09,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:15:09,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:15:09,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:15:09,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:15:09,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:15:09,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:15:09,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:15:09,690 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:15:09,691 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:15:09,691 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:15:09,691 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:15:09,691 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:15:09,692 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:15:09,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:15:09,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:15:09,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:15:09,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:15:09,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:15:09,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:15:09,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:15:09,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:15:09,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:15:09,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:15:09,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:15:09,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:15:09,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:15:09,695 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:15:09,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:15:09,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:15:09,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:15:09,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:15:09,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:15:09,697 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:15:09,698 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2024-11-17 08:15:09,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:15:10,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:15:10,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:15:10,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:15:10,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:15:10,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2024-11-17 08:15:11,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:15:11,748 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:15:11,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-17 08:15:11,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd756f732/184ab85003774e85adeef637da6ca61e/FLAG82eae51c1 [2024-11-17 08:15:12,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd756f732/184ab85003774e85adeef637da6ca61e [2024-11-17 08:15:12,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:15:12,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:15:12,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:12,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:15:12,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:15:12,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9ff1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12, skipping insertion in model container [2024-11-17 08:15:12,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:15:12,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:12,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:15:12,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:12,519 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:15:12,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12 WrapperNode [2024-11-17 08:15:12,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:12,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:12,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:15:12,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:15:12,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,560 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2024-11-17 08:15:12,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:12,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:15:12,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:15:12,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:15:12,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,589 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]. [2024-11-17 08:15:12,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:15:12,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:15:12,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:15:12,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:15:12,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (1/1) ... [2024-11-17 08:15:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:12,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:15:12,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:15:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:15:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:15:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:15:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:15:12,772 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:15:12,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:15:12,957 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-17 08:15:12,957 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:15:12,975 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:15:12,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:15:12,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:12 BoogieIcfgContainer [2024-11-17 08:15:12,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:15:12,977 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:15:12,977 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:15:12,983 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:15:12,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:12,985 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:15:12" (1/3) ... [2024-11-17 08:15:12,986 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28b52bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:12, skipping insertion in model container [2024-11-17 08:15:12,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:12,986 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:12" (2/3) ... [2024-11-17 08:15:12,986 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28b52bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:12, skipping insertion in model container [2024-11-17 08:15:12,987 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:12,987 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:12" (3/3) ... [2024-11-17 08:15:12,988 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2024-11-17 08:15:13,064 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:15:13,064 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:15:13,064 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:15:13,064 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:15:13,065 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:15:13,065 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:15:13,065 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:15:13,066 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:15:13,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 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) [2024-11-17 08:15:13,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:15:13,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,107 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:15:13,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 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) [2024-11-17 08:15:13,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-17 08:15:13,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,121 INFO L745 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue 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); 31#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 18#L35true [2024-11-17 08:15:13,123 INFO L747 eck$LassoCheckResult]: Loop: 18#L35true assume true; 11#L35-1true assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 29#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 8#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 32#L62true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 5#L66true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 35#L70true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L74true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 27#L78true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 28#L82true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3#L86true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 12#L92true assume !(0 != main_~p1~0#1); 9#L97true assume !(0 != main_~p2~0#1); 14#L102true assume !(0 != main_~p3~0#1); 30#L107true assume !(0 != main_~p4~0#1); 22#L112true assume !(0 != main_~p5~0#1); 7#L117true assume !(0 != main_~p6~0#1); 17#L122true assume !(0 != main_~p7~0#1); 26#L127true assume !(0 != main_~p8~0#1); 18#L35true [2024-11-17 08:15:13,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 1 times [2024-11-17 08:15:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738559974] [2024-11-17 08:15:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash -5806578, now seen corresponding path program 1 times [2024-11-17 08:15:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154273155] [2024-11-17 08:15:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154273155] [2024-11-17 08:15:13,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154273155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:13,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:13,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194077021] [2024-11-17 08:15:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:13,397 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:13,440 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 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 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:13,488 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2024-11-17 08:15:13,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 107 transitions. [2024-11-17 08:15:13,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2024-11-17 08:15:13,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2024-11-17 08:15:13,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-17 08:15:13,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-17 08:15:13,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2024-11-17 08:15:13,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:13,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-17 08:15:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2024-11-17 08:15:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-17 08:15:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 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) [2024-11-17 08:15:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-11-17 08:15:13,540 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-17 08:15:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:13,546 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-17 08:15:13,546 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:15:13,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 85 transitions. [2024-11-17 08:15:13,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2024-11-17 08:15:13,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,551 INFO L745 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY 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); 133#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 136#L35 [2024-11-17 08:15:13,551 INFO L747 eck$LassoCheckResult]: Loop: 136#L35 assume true; 140#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 139#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 137#L58 assume !(0 != main_~p1~0#1); 138#L62 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 161#L66 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 159#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 156#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 153#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 152#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 149#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 145#L92 assume !(0 != main_~p1~0#1); 146#L97 assume !(0 != main_~p2~0#1); 158#L102 assume !(0 != main_~p3~0#1); 155#L107 assume !(0 != main_~p4~0#1); 150#L112 assume !(0 != main_~p5~0#1); 148#L117 assume !(0 != main_~p6~0#1); 144#L122 assume !(0 != main_~p7~0#1); 142#L127 assume !(0 != main_~p8~0#1); 136#L35 [2024-11-17 08:15:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 2 times [2024-11-17 08:15:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467492215] [2024-11-17 08:15:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:13,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -516340755, now seen corresponding path program 1 times [2024-11-17 08:15:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950536171] [2024-11-17 08:15:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950536171] [2024-11-17 08:15:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950536171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5663850] [2024-11-17 08:15:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:13,615 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:13,617 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:13,636 INFO L93 Difference]: Finished difference Result 106 states and 162 transitions. [2024-11-17 08:15:13,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 162 transitions. [2024-11-17 08:15:13,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2024-11-17 08:15:13,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 162 transitions. [2024-11-17 08:15:13,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2024-11-17 08:15:13,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2024-11-17 08:15:13,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 162 transitions. [2024-11-17 08:15:13,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:13,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-17 08:15:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 162 transitions. [2024-11-17 08:15:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-17 08:15:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.528301886792453) internal successors, (162), 105 states have internal predecessors, (162), 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) [2024-11-17 08:15:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-17 08:15:13,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-17 08:15:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:13,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-17 08:15:13,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:15:13,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 162 transitions. [2024-11-17 08:15:13,659 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2024-11-17 08:15:13,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,660 INFO L745 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY 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); 302#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 307#L35 [2024-11-17 08:15:13,660 INFO L747 eck$LassoCheckResult]: Loop: 307#L35 assume true; 328#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 327#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 325#L58 assume !(0 != main_~p1~0#1); 323#L62 assume !(0 != main_~p2~0#1); 324#L66 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 318#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 319#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 314#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 315#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 310#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 311#L92 assume !(0 != main_~p1~0#1); 341#L97 assume !(0 != main_~p2~0#1); 340#L102 assume !(0 != main_~p3~0#1); 338#L107 assume !(0 != main_~p4~0#1); 335#L112 assume !(0 != main_~p5~0#1); 334#L117 assume !(0 != main_~p6~0#1); 332#L122 assume !(0 != main_~p7~0#1); 330#L127 assume !(0 != main_~p8~0#1); 307#L35 [2024-11-17 08:15:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 3 times [2024-11-17 08:15:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483886304] [2024-11-17 08:15:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash 991211054, now seen corresponding path program 1 times [2024-11-17 08:15:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272067151] [2024-11-17 08:15:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272067151] [2024-11-17 08:15:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272067151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:13,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:13,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19732230] [2024-11-17 08:15:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:13,752 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:13,752 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:13,774 INFO L93 Difference]: Finished difference Result 206 states and 310 transitions. [2024-11-17 08:15:13,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 310 transitions. [2024-11-17 08:15:13,777 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2024-11-17 08:15:13,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 310 transitions. [2024-11-17 08:15:13,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2024-11-17 08:15:13,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2024-11-17 08:15:13,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 310 transitions. [2024-11-17 08:15:13,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:13,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-17 08:15:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 310 transitions. [2024-11-17 08:15:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-17 08:15:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.5048543689320388) internal successors, (310), 205 states have internal predecessors, (310), 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) [2024-11-17 08:15:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2024-11-17 08:15:13,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-17 08:15:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:13,801 INFO L425 stractBuchiCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-17 08:15:13,801 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:15:13,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 310 transitions. [2024-11-17 08:15:13,803 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2024-11-17 08:15:13,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,804 INFO L745 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY 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); 621#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 625#L35 [2024-11-17 08:15:13,804 INFO L747 eck$LassoCheckResult]: Loop: 625#L35 assume true; 659#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 657#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 655#L58 assume !(0 != main_~p1~0#1); 651#L62 assume !(0 != main_~p2~0#1); 648#L66 assume !(0 != main_~p3~0#1); 646#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 644#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 642#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 640#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 638#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 636#L92 assume !(0 != main_~p1~0#1); 632#L97 assume !(0 != main_~p2~0#1); 633#L102 assume !(0 != main_~p3~0#1); 679#L107 assume !(0 != main_~p4~0#1); 674#L112 assume !(0 != main_~p5~0#1); 671#L117 assume !(0 != main_~p6~0#1); 667#L122 assume !(0 != main_~p7~0#1); 663#L127 assume !(0 != main_~p8~0#1); 625#L35 [2024-11-17 08:15:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 4 times [2024-11-17 08:15:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878553140] [2024-11-17 08:15:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:13,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 485652429, now seen corresponding path program 1 times [2024-11-17 08:15:13,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277954336] [2024-11-17 08:15:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277954336] [2024-11-17 08:15:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277954336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:13,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425602100] [2024-11-17 08:15:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:13,902 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:13,903 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:13,924 INFO L93 Difference]: Finished difference Result 402 states and 594 transitions. [2024-11-17 08:15:13,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 402 states and 594 transitions. [2024-11-17 08:15:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2024-11-17 08:15:13,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 402 states to 402 states and 594 transitions. [2024-11-17 08:15:13,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2024-11-17 08:15:13,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2024-11-17 08:15:13,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 594 transitions. [2024-11-17 08:15:13,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:13,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-17 08:15:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 594 transitions. [2024-11-17 08:15:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-17 08:15:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 1.4776119402985075) internal successors, (594), 401 states have internal predecessors, (594), 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) [2024-11-17 08:15:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 594 transitions. [2024-11-17 08:15:13,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-17 08:15:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:13,965 INFO L425 stractBuchiCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-17 08:15:13,966 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:15:13,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 594 transitions. [2024-11-17 08:15:13,969 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2024-11-17 08:15:13,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:13,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:13,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:13,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:13,970 INFO L745 eck$LassoCheckResult]: Stem: 1234#ULTIMATE.startENTRY 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); 1235#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1242#L35 [2024-11-17 08:15:13,970 INFO L747 eck$LassoCheckResult]: Loop: 1242#L35 assume true; 1287#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1285#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1283#L58 assume !(0 != main_~p1~0#1); 1279#L62 assume !(0 != main_~p2~0#1); 1275#L66 assume !(0 != main_~p3~0#1); 1271#L70 assume !(0 != main_~p4~0#1); 1269#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1267#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1265#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1263#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1260#L92 assume !(0 != main_~p1~0#1); 1261#L97 assume !(0 != main_~p2~0#1); 1308#L102 assume !(0 != main_~p3~0#1); 1306#L107 assume !(0 != main_~p4~0#1); 1302#L112 assume !(0 != main_~p5~0#1); 1299#L117 assume !(0 != main_~p6~0#1); 1295#L122 assume !(0 != main_~p7~0#1); 1291#L127 assume !(0 != main_~p8~0#1); 1242#L35 [2024-11-17 08:15:13,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 5 times [2024-11-17 08:15:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913110559] [2024-11-17 08:15:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:13,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 192249422, now seen corresponding path program 1 times [2024-11-17 08:15:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622286004] [2024-11-17 08:15:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622286004] [2024-11-17 08:15:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622286004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076651772] [2024-11-17 08:15:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:14,019 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:14,020 INFO L87 Difference]: Start difference. First operand 402 states and 594 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:14,050 INFO L93 Difference]: Finished difference Result 786 states and 1138 transitions. [2024-11-17 08:15:14,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1138 transitions. [2024-11-17 08:15:14,058 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2024-11-17 08:15:14,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 786 states and 1138 transitions. [2024-11-17 08:15:14,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2024-11-17 08:15:14,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2024-11-17 08:15:14,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1138 transitions. [2024-11-17 08:15:14,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:14,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-17 08:15:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1138 transitions. [2024-11-17 08:15:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2024-11-17 08:15:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 786 states have (on average 1.4478371501272265) internal successors, (1138), 785 states have internal predecessors, (1138), 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) [2024-11-17 08:15:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1138 transitions. [2024-11-17 08:15:14,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-17 08:15:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:14,118 INFO L425 stractBuchiCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-17 08:15:14,118 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:15:14,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 786 states and 1138 transitions. [2024-11-17 08:15:14,125 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2024-11-17 08:15:14,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:14,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:14,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:14,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:14,127 INFO L745 eck$LassoCheckResult]: Stem: 2430#ULTIMATE.startENTRY 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); 2431#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2440#L35 [2024-11-17 08:15:14,127 INFO L747 eck$LassoCheckResult]: Loop: 2440#L35 assume true; 2579#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2578#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2577#L58 assume !(0 != main_~p1~0#1); 2576#L62 assume !(0 != main_~p2~0#1); 2573#L66 assume !(0 != main_~p3~0#1); 2567#L70 assume !(0 != main_~p4~0#1); 2569#L74 assume !(0 != main_~p5~0#1); 2558#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2559#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2550#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2551#L92 assume !(0 != main_~p1~0#1); 2536#L97 assume !(0 != main_~p2~0#1); 2538#L102 assume !(0 != main_~p3~0#1); 2588#L107 assume !(0 != main_~p4~0#1); 2586#L112 assume !(0 != main_~p5~0#1); 2585#L117 assume !(0 != main_~p6~0#1); 2583#L122 assume !(0 != main_~p7~0#1); 2581#L127 assume !(0 != main_~p8~0#1); 2440#L35 [2024-11-17 08:15:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 6 times [2024-11-17 08:15:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157658125] [2024-11-17 08:15:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:14,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 321332141, now seen corresponding path program 1 times [2024-11-17 08:15:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154518107] [2024-11-17 08:15:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:14,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154518107] [2024-11-17 08:15:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154518107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:14,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:14,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910636452] [2024-11-17 08:15:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:14,206 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:14,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:14,206 INFO L87 Difference]: Start difference. First operand 786 states and 1138 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:14,232 INFO L93 Difference]: Finished difference Result 1538 states and 2178 transitions. [2024-11-17 08:15:14,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1538 states and 2178 transitions. [2024-11-17 08:15:14,247 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2024-11-17 08:15:14,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1538 states to 1538 states and 2178 transitions. [2024-11-17 08:15:14,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1538 [2024-11-17 08:15:14,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1538 [2024-11-17 08:15:14,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1538 states and 2178 transitions. [2024-11-17 08:15:14,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:14,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-17 08:15:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states and 2178 transitions. [2024-11-17 08:15:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2024-11-17 08:15:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1538 states have (on average 1.4161248374512354) internal successors, (2178), 1537 states have internal predecessors, (2178), 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) [2024-11-17 08:15:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2178 transitions. [2024-11-17 08:15:14,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-17 08:15:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:14,294 INFO L425 stractBuchiCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-17 08:15:14,295 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:15:14,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1538 states and 2178 transitions. [2024-11-17 08:15:14,303 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2024-11-17 08:15:14,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:14,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:14,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:14,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:14,304 INFO L745 eck$LassoCheckResult]: Stem: 4760#ULTIMATE.startENTRY 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); 4761#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4773#L35 [2024-11-17 08:15:14,305 INFO L747 eck$LassoCheckResult]: Loop: 4773#L35 assume true; 4920#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4919#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4917#L58 assume !(0 != main_~p1~0#1); 4915#L62 assume !(0 != main_~p2~0#1); 4912#L66 assume !(0 != main_~p3~0#1); 4906#L70 assume !(0 != main_~p4~0#1); 4908#L74 assume !(0 != main_~p5~0#1); 4896#L78 assume !(0 != main_~p6~0#1); 4898#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4888#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4889#L92 assume !(0 != main_~p1~0#1); 4872#L97 assume !(0 != main_~p2~0#1); 4874#L102 assume !(0 != main_~p3~0#1); 4931#L107 assume !(0 != main_~p4~0#1); 4929#L112 assume !(0 != main_~p5~0#1); 4927#L117 assume !(0 != main_~p6~0#1); 4925#L122 assume !(0 != main_~p7~0#1); 4922#L127 assume !(0 != main_~p8~0#1); 4773#L35 [2024-11-17 08:15:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 7 times [2024-11-17 08:15:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127193055] [2024-11-17 08:15:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:14,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1475619218, now seen corresponding path program 1 times [2024-11-17 08:15:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90908547] [2024-11-17 08:15:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:14,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90908547] [2024-11-17 08:15:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90908547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:14,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:14,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:14,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622844504] [2024-11-17 08:15:14,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:14,360 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:14,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:14,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:14,361 INFO L87 Difference]: Start difference. First operand 1538 states and 2178 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:14,393 INFO L93 Difference]: Finished difference Result 3010 states and 4162 transitions. [2024-11-17 08:15:14,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3010 states and 4162 transitions. [2024-11-17 08:15:14,419 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2024-11-17 08:15:14,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3010 states to 3010 states and 4162 transitions. [2024-11-17 08:15:14,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3010 [2024-11-17 08:15:14,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3010 [2024-11-17 08:15:14,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3010 states and 4162 transitions. [2024-11-17 08:15:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:14,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-17 08:15:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states and 4162 transitions. [2024-11-17 08:15:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3010. [2024-11-17 08:15:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3010 states have (on average 1.3827242524916943) internal successors, (4162), 3009 states have internal predecessors, (4162), 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) [2024-11-17 08:15:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4162 transitions. [2024-11-17 08:15:14,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-17 08:15:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:14,512 INFO L425 stractBuchiCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-17 08:15:14,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:15:14,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3010 states and 4162 transitions. [2024-11-17 08:15:14,528 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2024-11-17 08:15:14,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:14,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:14,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:14,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:14,531 INFO L745 eck$LassoCheckResult]: Stem: 9313#ULTIMATE.startENTRY 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); 9314#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 9324#L35 [2024-11-17 08:15:14,531 INFO L747 eck$LassoCheckResult]: Loop: 9324#L35 assume true; 9389#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9387#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9385#L58 assume !(0 != main_~p1~0#1); 9381#L62 assume !(0 != main_~p2~0#1); 9377#L66 assume !(0 != main_~p3~0#1); 9373#L70 assume !(0 != main_~p4~0#1); 9369#L74 assume !(0 != main_~p5~0#1); 9365#L78 assume !(0 != main_~p6~0#1); 9361#L82 assume !(0 != main_~p7~0#1); 9359#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 9356#L92 assume !(0 != main_~p1~0#1); 9357#L97 assume !(0 != main_~p2~0#1); 9412#L102 assume !(0 != main_~p3~0#1); 9408#L107 assume !(0 != main_~p4~0#1); 9404#L112 assume !(0 != main_~p5~0#1); 9400#L117 assume !(0 != main_~p6~0#1); 9396#L122 assume !(0 != main_~p7~0#1); 9393#L127 assume !(0 != main_~p8~0#1); 9324#L35 [2024-11-17 08:15:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 8 times [2024-11-17 08:15:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447680060] [2024-11-17 08:15:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:14,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1672132723, now seen corresponding path program 1 times [2024-11-17 08:15:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143688523] [2024-11-17 08:15:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:15:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143688523] [2024-11-17 08:15:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143688523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:15:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733469081] [2024-11-17 08:15:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:14,586 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:14,587 INFO L87 Difference]: Start difference. First operand 3010 states and 4162 transitions. cyclomatic complexity: 1280 Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-17 08:15:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:14,624 INFO L93 Difference]: Finished difference Result 5890 states and 7938 transitions. [2024-11-17 08:15:14,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5890 states and 7938 transitions. [2024-11-17 08:15:14,688 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 5888 [2024-11-17 08:15:14,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5890 states to 5890 states and 7938 transitions. [2024-11-17 08:15:14,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5890 [2024-11-17 08:15:14,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5890 [2024-11-17 08:15:14,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5890 states and 7938 transitions. [2024-11-17 08:15:14,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:14,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-17 08:15:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states and 7938 transitions. [2024-11-17 08:15:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 5890. [2024-11-17 08:15:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5890 states, 5890 states have (on average 1.3477079796264855) internal successors, (7938), 5889 states have internal predecessors, (7938), 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) [2024-11-17 08:15:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 7938 transitions. [2024-11-17 08:15:14,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-17 08:15:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:14,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-17 08:15:14,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:15:14,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5890 states and 7938 transitions. [2024-11-17 08:15:14,869 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 5888 [2024-11-17 08:15:14,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:14,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:14,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:14,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:14,870 INFO L745 eck$LassoCheckResult]: Stem: 18219#ULTIMATE.startENTRY 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); 18220#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 18231#L35 [2024-11-17 08:15:14,871 INFO L747 eck$LassoCheckResult]: Loop: 18231#L35 assume true; 18375#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 18374#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 18372#L58 assume !(0 != main_~p1~0#1); 18370#L62 assume !(0 != main_~p2~0#1); 18368#L66 assume !(0 != main_~p3~0#1); 18366#L70 assume !(0 != main_~p4~0#1); 18364#L74 assume !(0 != main_~p5~0#1); 18362#L78 assume !(0 != main_~p6~0#1); 18360#L82 assume !(0 != main_~p7~0#1); 18357#L86 assume !(0 != main_~p8~0#1); 18349#L92 assume !(0 != main_~p1~0#1); 18351#L97 assume !(0 != main_~p2~0#1); 18337#L102 assume !(0 != main_~p3~0#1); 18339#L107 assume !(0 != main_~p4~0#1); 18325#L112 assume !(0 != main_~p5~0#1); 18327#L117 assume !(0 != main_~p6~0#1); 18315#L122 assume !(0 != main_~p7~0#1); 18316#L127 assume !(0 != main_~p8~0#1); 18231#L35 [2024-11-17 08:15:14,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 9 times [2024-11-17 08:15:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159309616] [2024-11-17 08:15:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 815380110, now seen corresponding path program 1 times [2024-11-17 08:15:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632772828] [2024-11-17 08:15:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -997756625, now seen corresponding path program 1 times [2024-11-17 08:15:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965085493] [2024-11-17 08:15:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:14,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:15,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:15,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:15:15 BoogieIcfgContainer [2024-11-17 08:15:15,347 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:15:15,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:15:15,348 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:15:15,349 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:15:15,349 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:12" (3/4) ... [2024-11-17 08:15:15,351 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:15:15,400 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:15:15,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:15:15,405 INFO L158 Benchmark]: Toolchain (without parser) took 3268.93ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 82.1MB in the beginning and 62.7MB in the end (delta: 19.5MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,405 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:15,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.35ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 82.0MB in the beginning and 173.0MB in the end (delta: -91.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 201.3MB. Free memory was 173.0MB in the beginning and 171.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,406 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 201.3MB. Free memory was 171.0MB in the beginning and 170.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:15,406 INFO L158 Benchmark]: IcfgBuilder took 377.78ms. Allocated memory is still 201.3MB. Free memory was 170.0MB in the beginning and 156.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,407 INFO L158 Benchmark]: BuchiAutomizer took 2370.73ms. Allocated memory is still 201.3MB. Free memory was 156.3MB in the beginning and 64.6MB in the end (delta: 91.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,407 INFO L158 Benchmark]: Witness Printer took 56.21ms. Allocated memory is still 201.3MB. Free memory was 64.6MB in the beginning and 62.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:15,413 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.15ms. Allocated memory is still 155.2MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.35ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 82.0MB in the beginning and 173.0MB in the end (delta: -91.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 201.3MB. Free memory was 173.0MB in the beginning and 171.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 201.3MB. Free memory was 171.0MB in the beginning and 170.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 377.78ms. Allocated memory is still 201.3MB. Free memory was 170.0MB in the beginning and 156.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2370.73ms. Allocated memory is still 201.3MB. Free memory was 156.3MB in the beginning and 64.6MB in the end (delta: 91.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 56.21ms. Allocated memory is still 201.3MB. Free memory was 64.6MB in the beginning and 62.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5890 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s 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, 274 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 860 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 538 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 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: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:15:15,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)