./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:27:00,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:27:00,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:27:00,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:27:00,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:27:00,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:27:00,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:27:00,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:27:00,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:27:00,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:27:00,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:27:00,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:27:00,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:27:00,408 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:27:00,408 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:27:00,409 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:27:00,409 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:27:00,409 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:27:00,409 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:27:00,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:27:00,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:27:00,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:27:00,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:27:00,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:27:00,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:27:00,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:27:00,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:27:00,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:27:00,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:27:00,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:27:00,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:27:00,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:27:00,414 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:27:00,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:27:00,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:27:00,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:27:00,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:27:00,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:27:00,416 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:27:00,417 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-11-19 14:27:00,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:27:00,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:27:00,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:27:00,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:27:00,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:27:00,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-19 14:27:02,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:27:02,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:27:02,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2024-11-19 14:27:02,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff3a02c7/db16236754f44ce298a4897d8d6043d2/FLAGe49e85053 [2024-11-19 14:27:02,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff3a02c7/db16236754f44ce298a4897d8d6043d2 [2024-11-19 14:27:02,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:27:02,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:27:02,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:02,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:27:02,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:27:02,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d766337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02, skipping insertion in model container [2024-11-19 14:27:02,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:27:02,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:02,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:27:02,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:02,748 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:27:02,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02 WrapperNode [2024-11-19 14:27:02,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:02,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:02,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:27:02,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:27:02,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,790 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 193 [2024-11-19 14:27:02,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:02,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:27:02,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:27:02,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:27:02,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,822 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-19 14:27:02,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:27:02,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:27:02,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:27:02,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:27:02,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (1/1) ... [2024-11-19 14:27:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:02,877 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-19 14:27:02,881 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-19 14:27:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:27:02,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:27:02,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:27:02,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:27:03,067 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:27:03,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:27:03,382 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 14:27:03,382 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:27:03,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:27:03,416 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:27:03,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:03 BoogieIcfgContainer [2024-11-19 14:27:03,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:27:03,418 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:27:03,418 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:27:03,422 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:27:03,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:03,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:27:02" (1/3) ... [2024-11-19 14:27:03,424 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5245e81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:03, skipping insertion in model container [2024-11-19 14:27:03,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:03,424 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:02" (2/3) ... [2024-11-19 14:27:03,425 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5245e81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:03, skipping insertion in model container [2024-11-19 14:27:03,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:03,425 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:03" (3/3) ... [2024-11-19 14:27:03,426 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2024-11-19 14:27:03,486 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:27:03,486 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:27:03,487 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:27:03,487 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:27:03,487 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:27:03,487 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:27:03,487 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:27:03,487 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:27:03,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-19 14:27:03,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:27:03,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:03,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:03,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:03,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:03,519 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:27:03,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-19 14:27:03,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-11-19 14:27:03,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:03,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:03,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:03,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:03,536 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 19#L225-1true [2024-11-19 14:27:03,538 INFO L747 eck$LassoCheckResult]: Loop: 19#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 25#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 44#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 39#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 46#L155-1true assume !(0 != main_~p2~0#1); 27#L160-1true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 45#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 38#L185-1true assume !(0 != main_~p8~0#1); 23#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 43#L205-1true assume !(0 != main_~p12~0#1); 22#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume !(0 != main_~p14~0#1); 36#L220-1true assume !(0 != main_~p15~0#1); 19#L225-1true [2024-11-19 14:27:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:27:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756266215] [2024-11-19 14:27:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:03,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:03,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:03,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2024-11-19 14:27:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792317796] [2024-11-19 14:27:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:03,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:03,829 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-19 14:27:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792317796] [2024-11-19 14:27:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792317796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182603548] [2024-11-19 14:27:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:03,836 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:03,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:03,868 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:03,906 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-11-19 14:27:03,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2024-11-19 14:27:03,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-11-19 14:27:03,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 153 transitions. [2024-11-19 14:27:03,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:27:03,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:27:03,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2024-11-19 14:27:03,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:03,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-11-19 14:27:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2024-11-19 14:27:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 14:27:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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-19 14:27:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-11-19 14:27:03,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-11-19 14:27:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:03,952 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-11-19 14:27:03,953 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:27:03,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2024-11-19 14:27:03,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-11-19 14:27:03,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:03,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:03,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:03,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:03,956 INFO L745 eck$LassoCheckResult]: Stem: 204#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 211#L225-1 [2024-11-19 14:27:03,956 INFO L747 eck$LassoCheckResult]: Loop: 211#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 222#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 221#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 217#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 256#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 191#L129-1 assume !(0 != main_~p11~0#1); 212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 254#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 253#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 252#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 251#L149-1 assume !(0 != main_~p1~0#1); 250#L155-1 assume !(0 != main_~p2~0#1); 248#L160-1 assume !(0 != main_~p3~0#1); 246#L165-1 assume !(0 != main_~p4~0#1); 243#L170-1 assume !(0 != main_~p5~0#1); 242#L175-1 assume !(0 != main_~p6~0#1); 240#L180-1 assume !(0 != main_~p7~0#1); 237#L185-1 assume !(0 != main_~p8~0#1); 236#L190-1 assume !(0 != main_~p9~0#1); 234#L195-1 assume !(0 != main_~p10~0#1); 232#L200-1 assume !(0 != main_~p11~0#1); 230#L205-1 assume !(0 != main_~p12~0#1); 228#L210-1 assume !(0 != main_~p13~0#1); 226#L215-1 assume !(0 != main_~p14~0#1); 224#L220-1 assume !(0 != main_~p15~0#1); 211#L225-1 [2024-11-19 14:27:03,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:27:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840739661] [2024-11-19 14:27:03,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:03,972 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:03,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:03,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:03,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2024-11-19 14:27:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228326938] [2024-11-19 14:27:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,062 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-19 14:27:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228326938] [2024-11-19 14:27:04,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228326938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692656342] [2024-11-19 14:27:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,066 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,069 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,100 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2024-11-19 14:27:04,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2024-11-19 14:27:04,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-11-19 14:27:04,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2024-11-19 14:27:04,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-11-19 14:27:04,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-11-19 14:27:04,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2024-11-19 14:27:04,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-11-19 14:27:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2024-11-19 14:27:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-19 14:27:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 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-19 14:27:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2024-11-19 14:27:04,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-11-19 14:27:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-11-19 14:27:04,126 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:27:04,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2024-11-19 14:27:04,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-11-19 14:27:04,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,129 INFO L745 eck$LassoCheckResult]: Stem: 491#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 498#L225-1 [2024-11-19 14:27:04,130 INFO L747 eck$LassoCheckResult]: Loop: 498#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 516#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512#L93 assume !(0 != main_~p1~0#1); 513#L93-2 assume !(0 != main_~p2~0#1); 639#L97-1 assume !(0 != main_~p3~0#1); 638#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 637#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 636#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 635#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 634#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 633#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 632#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 499#L129-1 assume !(0 != main_~p11~0#1); 500#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 527#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 528#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 523#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 524#L149-1 assume !(0 != main_~p1~0#1); 608#L155-1 assume !(0 != main_~p2~0#1); 606#L160-1 assume !(0 != main_~p3~0#1); 604#L165-1 assume !(0 != main_~p4~0#1); 599#L170-1 assume !(0 != main_~p5~0#1); 590#L175-1 assume !(0 != main_~p6~0#1); 582#L180-1 assume !(0 != main_~p7~0#1); 577#L185-1 assume !(0 != main_~p8~0#1); 572#L190-1 assume !(0 != main_~p9~0#1); 570#L195-1 assume !(0 != main_~p10~0#1); 564#L200-1 assume !(0 != main_~p11~0#1); 560#L205-1 assume !(0 != main_~p12~0#1); 552#L210-1 assume !(0 != main_~p13~0#1); 548#L215-1 assume !(0 != main_~p14~0#1); 546#L220-1 assume !(0 != main_~p15~0#1); 498#L225-1 [2024-11-19 14:27:04,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:27:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470515399] [2024-11-19 14:27:04,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,143 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:04,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:04,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2024-11-19 14:27:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100604424] [2024-11-19 14:27:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,220 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-19 14:27:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100604424] [2024-11-19 14:27:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100604424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824364343] [2024-11-19 14:27:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,223 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,249 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2024-11-19 14:27:04,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2024-11-19 14:27:04,255 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-11-19 14:27:04,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2024-11-19 14:27:04,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-11-19 14:27:04,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-11-19 14:27:04,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2024-11-19 14:27:04,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-11-19 14:27:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2024-11-19 14:27:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-19 14:27:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 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-19 14:27:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2024-11-19 14:27:04,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-11-19 14:27:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-11-19 14:27:04,284 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:27:04,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2024-11-19 14:27:04,286 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-11-19 14:27:04,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,287 INFO L745 eck$LassoCheckResult]: Stem: 1049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1050#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1056#L225-1 [2024-11-19 14:27:04,288 INFO L747 eck$LassoCheckResult]: Loop: 1056#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1133#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1129#L93 assume !(0 != main_~p1~0#1); 1123#L93-2 assume !(0 != main_~p2~0#1); 1120#L97-1 assume !(0 != main_~p3~0#1); 1114#L101-1 assume !(0 != main_~p4~0#1); 1115#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1259#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1257#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1255#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1253#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1251#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1249#L129-1 assume !(0 != main_~p11~0#1); 1247#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1246#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1243#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1241#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1239#L149-1 assume !(0 != main_~p1~0#1); 1238#L155-1 assume !(0 != main_~p2~0#1); 1237#L160-1 assume !(0 != main_~p3~0#1); 1233#L165-1 assume !(0 != main_~p4~0#1); 1234#L170-1 assume !(0 != main_~p5~0#1); 1228#L175-1 assume !(0 != main_~p6~0#1); 1220#L180-1 assume !(0 != main_~p7~0#1); 1196#L185-1 assume !(0 != main_~p8~0#1); 1171#L190-1 assume !(0 != main_~p9~0#1); 1169#L195-1 assume !(0 != main_~p10~0#1); 1167#L200-1 assume !(0 != main_~p11~0#1); 1165#L205-1 assume !(0 != main_~p12~0#1); 1163#L210-1 assume !(0 != main_~p13~0#1); 1147#L215-1 assume !(0 != main_~p14~0#1); 1143#L220-1 assume !(0 != main_~p15~0#1); 1056#L225-1 [2024-11-19 14:27:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:27:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881481424] [2024-11-19 14:27:04,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,295 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:04,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:04,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2024-11-19 14:27:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541604784] [2024-11-19 14:27:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,351 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-19 14:27:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541604784] [2024-11-19 14:27:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541604784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891131136] [2024-11-19 14:27:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,353 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,354 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,379 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2024-11-19 14:27:04,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2024-11-19 14:27:04,388 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-11-19 14:27:04,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2024-11-19 14:27:04,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2024-11-19 14:27:04,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2024-11-19 14:27:04,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2024-11-19 14:27:04,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-11-19 14:27:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2024-11-19 14:27:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-11-19 14:27:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 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-19 14:27:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2024-11-19 14:27:04,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-11-19 14:27:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,429 INFO L425 stractBuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-11-19 14:27:04,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:27:04,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2024-11-19 14:27:04,434 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-11-19 14:27:04,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,435 INFO L745 eck$LassoCheckResult]: Stem: 2146#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2113#L225-1 [2024-11-19 14:27:04,436 INFO L747 eck$LassoCheckResult]: Loop: 2113#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2152#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2153#L93 assume !(0 != main_~p1~0#1); 2564#L93-2 assume !(0 != main_~p2~0#1); 2558#L97-1 assume !(0 != main_~p3~0#1); 2526#L101-1 assume !(0 != main_~p4~0#1); 2528#L105-1 assume !(0 != main_~p5~0#1); 2556#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2554#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2552#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2550#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2548#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2546#L129-1 assume !(0 != main_~p11~0#1); 2544#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2542#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2540#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2538#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2536#L149-1 assume !(0 != main_~p1~0#1); 2490#L155-1 assume !(0 != main_~p2~0#1); 2491#L160-1 assume !(0 != main_~p3~0#1); 2623#L165-1 assume !(0 != main_~p4~0#1); 2482#L170-1 assume !(0 != main_~p5~0#1); 2479#L175-1 assume !(0 != main_~p6~0#1); 2478#L180-1 assume !(0 != main_~p7~0#1); 2158#L185-1 assume !(0 != main_~p8~0#1); 2117#L190-1 assume !(0 != main_~p9~0#1); 2628#L195-1 assume !(0 != main_~p10~0#1); 2124#L200-1 assume !(0 != main_~p11~0#1); 2125#L205-1 assume !(0 != main_~p12~0#1); 2140#L210-1 assume !(0 != main_~p13~0#1); 2108#L215-1 assume !(0 != main_~p14~0#1); 2109#L220-1 assume !(0 != main_~p15~0#1); 2113#L225-1 [2024-11-19 14:27:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:27:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468704641] [2024-11-19 14:27:04,437 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,442 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:04,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:04,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2024-11-19 14:27:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065383044] [2024-11-19 14:27:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,532 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-19 14:27:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065383044] [2024-11-19 14:27:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065383044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872222887] [2024-11-19 14:27:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,534 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,534 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,562 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2024-11-19 14:27:04,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2024-11-19 14:27:04,574 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-11-19 14:27:04,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-11-19 14:27:04,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2024-11-19 14:27:04,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2024-11-19 14:27:04,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2024-11-19 14:27:04,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-11-19 14:27:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2024-11-19 14:27:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-11-19 14:27:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 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-19 14:27:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-11-19 14:27:04,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-11-19 14:27:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-11-19 14:27:04,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:27:04,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2024-11-19 14:27:04,624 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-11-19 14:27:04,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,626 INFO L745 eck$LassoCheckResult]: Stem: 4300#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4307#L225-1 [2024-11-19 14:27:04,626 INFO L747 eck$LassoCheckResult]: Loop: 4307#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4522#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4523#L93 assume !(0 != main_~p1~0#1); 4733#L93-2 assume !(0 != main_~p2~0#1); 4732#L97-1 assume !(0 != main_~p3~0#1); 4730#L101-1 assume !(0 != main_~p4~0#1); 4727#L105-1 assume !(0 != main_~p5~0#1); 4723#L109-1 assume !(0 != main_~p6~0#1); 4721#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4719#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4717#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4715#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4713#L129-1 assume !(0 != main_~p11~0#1); 4711#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4709#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4707#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4705#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4702#L149-1 assume !(0 != main_~p1~0#1); 4703#L155-1 assume !(0 != main_~p2~0#1); 4752#L160-1 assume !(0 != main_~p3~0#1); 4651#L165-1 assume !(0 != main_~p4~0#1); 4652#L170-1 assume !(0 != main_~p5~0#1); 4639#L175-1 assume !(0 != main_~p6~0#1); 4641#L180-1 assume !(0 != main_~p7~0#1); 4625#L185-1 assume !(0 != main_~p8~0#1); 4626#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4596#L205-1 assume !(0 != main_~p12~0#1); 4588#L210-1 assume !(0 != main_~p13~0#1); 4587#L215-1 assume !(0 != main_~p14~0#1); 4543#L220-1 assume !(0 != main_~p15~0#1); 4307#L225-1 [2024-11-19 14:27:04,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:27:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575159640] [2024-11-19 14:27:04,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,636 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:04,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:04,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2024-11-19 14:27:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403645993] [2024-11-19 14:27:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,694 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-19 14:27:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403645993] [2024-11-19 14:27:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403645993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648572089] [2024-11-19 14:27:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,698 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,699 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,723 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2024-11-19 14:27:04,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2024-11-19 14:27:04,745 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-11-19 14:27:04,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-11-19 14:27:04,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2024-11-19 14:27:04,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2024-11-19 14:27:04,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2024-11-19 14:27:04,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:04,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-11-19 14:27:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2024-11-19 14:27:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-11-19 14:27:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 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-19 14:27:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-11-19 14:27:04,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-11-19 14:27:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:04,810 INFO L425 stractBuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-11-19 14:27:04,810 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:27:04,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2024-11-19 14:27:04,824 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-11-19 14:27:04,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:04,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:04,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:04,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:04,826 INFO L745 eck$LassoCheckResult]: Stem: 8551#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2024-11-19 14:27:04,826 INFO L747 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8715#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8713#L93 assume !(0 != main_~p1~0#1); 8712#L93-2 assume !(0 != main_~p2~0#1); 8706#L97-1 assume !(0 != main_~p3~0#1); 8707#L101-1 assume !(0 != main_~p4~0#1); 8813#L105-1 assume !(0 != main_~p5~0#1); 8810#L109-1 assume !(0 != main_~p6~0#1); 8806#L113-1 assume !(0 != main_~p7~0#1); 8804#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8803#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8800#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8797#L129-1 assume !(0 != main_~p11~0#1); 8794#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8790#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8786#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8781#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8775#L149-1 assume !(0 != main_~p1~0#1); 8769#L155-1 assume !(0 != main_~p2~0#1); 8764#L160-1 assume !(0 != main_~p3~0#1); 8757#L165-1 assume !(0 != main_~p4~0#1); 8751#L170-1 assume !(0 != main_~p5~0#1); 8746#L175-1 assume !(0 != main_~p6~0#1); 8744#L180-1 assume !(0 != main_~p7~0#1); 8738#L185-1 assume !(0 != main_~p8~0#1); 8735#L190-1 assume !(0 != main_~p9~0#1); 8731#L195-1 assume !(0 != main_~p10~0#1); 8725#L200-1 assume !(0 != main_~p11~0#1); 8723#L205-1 assume !(0 != main_~p12~0#1); 8721#L210-1 assume !(0 != main_~p13~0#1); 8719#L215-1 assume !(0 != main_~p14~0#1); 8717#L220-1 assume !(0 != main_~p15~0#1); 8558#L225-1 [2024-11-19 14:27:04,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:27:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161283907] [2024-11-19 14:27:04,828 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:04,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:04,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2024-11-19 14:27:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:04,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455761395] [2024-11-19 14:27:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:04,872 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-19 14:27:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455761395] [2024-11-19 14:27:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455761395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:04,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549557962] [2024-11-19 14:27:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:04,873 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:04,874 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:04,907 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2024-11-19 14:27:04,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2024-11-19 14:27:05,011 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-11-19 14:27:05,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-11-19 14:27:05,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2024-11-19 14:27:05,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2024-11-19 14:27:05,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2024-11-19 14:27:05,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:05,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-11-19 14:27:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2024-11-19 14:27:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2024-11-19 14:27:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 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-19 14:27:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-11-19 14:27:05,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-11-19 14:27:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:05,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-11-19 14:27:05,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:27:05,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2024-11-19 14:27:05,196 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-11-19 14:27:05,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:05,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:05,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:05,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:05,199 INFO L745 eck$LassoCheckResult]: Stem: 16942#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2024-11-19 14:27:05,199 INFO L747 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17204#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17198#L93 assume !(0 != main_~p1~0#1); 17194#L93-2 assume !(0 != main_~p2~0#1); 17191#L97-1 assume !(0 != main_~p3~0#1); 17185#L101-1 assume !(0 != main_~p4~0#1); 17179#L105-1 assume !(0 != main_~p5~0#1); 17175#L109-1 assume !(0 != main_~p6~0#1); 17170#L113-1 assume !(0 != main_~p7~0#1); 17164#L117-1 assume !(0 != main_~p8~0#1); 17165#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17152#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17153#L129-1 assume !(0 != main_~p11~0#1); 17144#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17145#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17136#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17126#L149-1 assume !(0 != main_~p1~0#1); 17127#L155-1 assume !(0 != main_~p2~0#1); 17116#L160-1 assume !(0 != main_~p3~0#1); 17115#L165-1 assume !(0 != main_~p4~0#1); 17102#L170-1 assume !(0 != main_~p5~0#1); 17103#L175-1 assume !(0 != main_~p6~0#1); 17093#L180-1 assume !(0 != main_~p7~0#1); 17094#L185-1 assume !(0 != main_~p8~0#1); 17246#L190-1 assume !(0 != main_~p9~0#1); 17242#L195-1 assume !(0 != main_~p10~0#1); 17238#L200-1 assume !(0 != main_~p11~0#1); 17232#L205-1 assume !(0 != main_~p12~0#1); 17226#L210-1 assume !(0 != main_~p13~0#1); 17220#L215-1 assume !(0 != main_~p14~0#1); 17214#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2024-11-19 14:27:05,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-19 14:27:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523956546] [2024-11-19 14:27:05,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:05,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,209 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:05,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:05,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:05,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2024-11-19 14:27:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231724956] [2024-11-19 14:27:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:05,254 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-19 14:27:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231724956] [2024-11-19 14:27:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231724956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:05,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105099641] [2024-11-19 14:27:05,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:05,257 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:05,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:05,257 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:05,306 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2024-11-19 14:27:05,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2024-11-19 14:27:05,367 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-11-19 14:27:05,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-11-19 14:27:05,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2024-11-19 14:27:05,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2024-11-19 14:27:05,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2024-11-19 14:27:05,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:05,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-11-19 14:27:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2024-11-19 14:27:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2024-11-19 14:27:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 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-19 14:27:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-11-19 14:27:05,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-11-19 14:27:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:05,763 INFO L425 stractBuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-11-19 14:27:05,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:27:05,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2024-11-19 14:27:05,809 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-11-19 14:27:05,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:05,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:05,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:05,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:05,810 INFO L745 eck$LassoCheckResult]: Stem: 33526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33531#L225-1 [2024-11-19 14:27:05,812 INFO L747 eck$LassoCheckResult]: Loop: 33531#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33939#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33933#L93 assume !(0 != main_~p1~0#1); 33809#L93-2 assume !(0 != main_~p2~0#1); 33799#L97-1 assume !(0 != main_~p3~0#1); 33791#L101-1 assume !(0 != main_~p4~0#1); 33780#L105-1 assume !(0 != main_~p5~0#1); 33770#L109-1 assume !(0 != main_~p6~0#1); 33763#L113-1 assume !(0 != main_~p7~0#1); 33759#L117-1 assume !(0 != main_~p8~0#1); 33754#L121-1 assume !(0 != main_~p9~0#1); 33750#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33747#L129-1 assume !(0 != main_~p11~0#1); 33744#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33741#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33737#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33738#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33970#L149-1 assume !(0 != main_~p1~0#1); 33966#L155-1 assume !(0 != main_~p2~0#1); 33963#L160-1 assume !(0 != main_~p3~0#1); 33958#L165-1 assume !(0 != main_~p4~0#1); 33944#L170-1 assume !(0 != main_~p5~0#1); 33934#L175-1 assume !(0 != main_~p6~0#1); 33936#L180-1 assume !(0 != main_~p7~0#1); 34036#L185-1 assume !(0 != main_~p8~0#1); 34034#L190-1 assume !(0 != main_~p9~0#1); 34033#L195-1 assume !(0 != main_~p10~0#1); 34031#L200-1 assume !(0 != main_~p11~0#1); 34029#L205-1 assume !(0 != main_~p12~0#1); 34027#L210-1 assume !(0 != main_~p13~0#1); 33978#L215-1 assume !(0 != main_~p14~0#1); 33955#L220-1 assume !(0 != main_~p15~0#1); 33531#L225-1 [2024-11-19 14:27:05,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-19 14:27:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866898352] [2024-11-19 14:27:05,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:05,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:05,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:05,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2024-11-19 14:27:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297507384] [2024-11-19 14:27:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:05,860 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-19 14:27:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297507384] [2024-11-19 14:27:05,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297507384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:05,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:05,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042135834] [2024-11-19 14:27:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:05,864 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:05,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:05,864 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:05,987 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2024-11-19 14:27:05,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2024-11-19 14:27:06,138 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-11-19 14:27:06,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-11-19 14:27:06,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2024-11-19 14:27:06,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2024-11-19 14:27:06,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2024-11-19 14:27:06,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:06,266 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-11-19 14:27:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2024-11-19 14:27:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2024-11-19 14:27:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 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-19 14:27:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-11-19 14:27:06,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-11-19 14:27:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:06,736 INFO L425 stractBuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-11-19 14:27:06,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:27:06,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2024-11-19 14:27:06,989 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-11-19 14:27:06,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:06,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:06,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:06,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:06,991 INFO L745 eck$LassoCheckResult]: Stem: 66304#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2024-11-19 14:27:06,991 INFO L747 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66961#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66959#L93 assume !(0 != main_~p1~0#1); 66957#L93-2 assume !(0 != main_~p2~0#1); 66956#L97-1 assume !(0 != main_~p3~0#1); 66954#L101-1 assume !(0 != main_~p4~0#1); 66952#L105-1 assume !(0 != main_~p5~0#1); 66951#L109-1 assume !(0 != main_~p6~0#1); 66949#L113-1 assume !(0 != main_~p7~0#1); 66947#L117-1 assume !(0 != main_~p8~0#1); 66945#L121-1 assume !(0 != main_~p9~0#1); 66943#L125-1 assume !(0 != main_~p10~0#1); 66941#L129-1 assume !(0 != main_~p11~0#1); 66940#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66938#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66935#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66905#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66900#L149-1 assume !(0 != main_~p1~0#1); 66897#L155-1 assume !(0 != main_~p2~0#1); 66896#L160-1 assume !(0 != main_~p3~0#1); 66891#L165-1 assume !(0 != main_~p4~0#1); 66705#L170-1 assume !(0 != main_~p5~0#1); 66706#L175-1 assume !(0 != main_~p6~0#1); 66697#L180-1 assume !(0 != main_~p7~0#1); 66698#L185-1 assume !(0 != main_~p8~0#1); 66833#L190-1 assume !(0 != main_~p9~0#1); 66835#L195-1 assume !(0 != main_~p10~0#1); 66877#L200-1 assume !(0 != main_~p11~0#1); 66872#L205-1 assume !(0 != main_~p12~0#1); 66871#L210-1 assume !(0 != main_~p13~0#1); 66965#L215-1 assume !(0 != main_~p14~0#1); 66963#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2024-11-19 14:27:06,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-19 14:27:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842393724] [2024-11-19 14:27:06,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:06,996 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:06,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:06,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:07,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2024-11-19 14:27:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291431182] [2024-11-19 14:27:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:07,023 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-19 14:27:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291431182] [2024-11-19 14:27:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291431182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760629971] [2024-11-19 14:27:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:07,025 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:07,026 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:07,148 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2024-11-19 14:27:07,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2024-11-19 14:27:07,470 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-11-19 14:27:07,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-11-19 14:27:07,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2024-11-19 14:27:07,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2024-11-19 14:27:07,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2024-11-19 14:27:07,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:07,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-11-19 14:27:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2024-11-19 14:27:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2024-11-19 14:27:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 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-19 14:27:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-11-19 14:27:08,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-11-19 14:27:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:08,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-11-19 14:27:08,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:27:08,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2024-11-19 14:27:08,690 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-11-19 14:27:08,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:08,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:08,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:08,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:08,691 INFO L745 eck$LassoCheckResult]: Stem: 131083#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131084#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131090#L225-1 [2024-11-19 14:27:08,691 INFO L747 eck$LassoCheckResult]: Loop: 131090#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131931#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131932#L93 assume !(0 != main_~p1~0#1); 131905#L93-2 assume !(0 != main_~p2~0#1); 131907#L97-1 assume !(0 != main_~p3~0#1); 131892#L101-1 assume !(0 != main_~p4~0#1); 131894#L105-1 assume !(0 != main_~p5~0#1); 132109#L109-1 assume !(0 != main_~p6~0#1); 132105#L113-1 assume !(0 != main_~p7~0#1); 132101#L117-1 assume !(0 != main_~p8~0#1); 132098#L121-1 assume !(0 != main_~p9~0#1); 132095#L125-1 assume !(0 != main_~p10~0#1); 132092#L129-1 assume !(0 != main_~p11~0#1); 132053#L133-1 assume !(0 != main_~p12~0#1); 132054#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 132056#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132051#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132022#L149-1 assume !(0 != main_~p1~0#1); 132023#L155-1 assume !(0 != main_~p2~0#1); 132108#L160-1 assume !(0 != main_~p3~0#1); 132103#L165-1 assume !(0 != main_~p4~0#1); 132100#L170-1 assume !(0 != main_~p5~0#1); 132097#L175-1 assume !(0 != main_~p6~0#1); 132093#L180-1 assume !(0 != main_~p7~0#1); 132091#L185-1 assume !(0 != main_~p8~0#1); 132088#L190-1 assume !(0 != main_~p9~0#1); 132086#L195-1 assume !(0 != main_~p10~0#1); 132083#L200-1 assume !(0 != main_~p11~0#1); 132081#L205-1 assume !(0 != main_~p12~0#1); 132080#L210-1 assume !(0 != main_~p13~0#1); 132078#L215-1 assume !(0 != main_~p14~0#1); 131939#L220-1 assume !(0 != main_~p15~0#1); 131090#L225-1 [2024-11-19 14:27:08,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-19 14:27:08,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:08,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813972445] [2024-11-19 14:27:08,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:08,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:08,696 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:08,696 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:08,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:08,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:08,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2024-11-19 14:27:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273073226] [2024-11-19 14:27:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:08,722 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-19 14:27:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273073226] [2024-11-19 14:27:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273073226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:08,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:08,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055577330] [2024-11-19 14:27:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:08,723 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:08,725 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,144 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2024-11-19 14:27:09,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2024-11-19 14:27:09,798 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-11-19 14:27:10,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-11-19 14:27:10,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2024-11-19 14:27:10,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2024-11-19 14:27:10,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2024-11-19 14:27:10,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-11-19 14:27:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2024-11-19 14:27:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2024-11-19 14:27:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 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-19 14:27:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-11-19 14:27:11,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-11-19 14:27:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:11,806 INFO L425 stractBuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-11-19 14:27:11,806 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:27:11,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2024-11-19 14:27:12,034 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-11-19 14:27:12,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:12,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:12,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:12,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:12,036 INFO L745 eck$LassoCheckResult]: Stem: 259091#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2024-11-19 14:27:12,036 INFO L747 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 259378#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 259376#L93 assume !(0 != main_~p1~0#1); 259374#L93-2 assume !(0 != main_~p2~0#1); 259373#L97-1 assume !(0 != main_~p3~0#1); 259371#L101-1 assume !(0 != main_~p4~0#1); 259369#L105-1 assume !(0 != main_~p5~0#1); 259367#L109-1 assume !(0 != main_~p6~0#1); 259365#L113-1 assume !(0 != main_~p7~0#1); 259363#L117-1 assume !(0 != main_~p8~0#1); 259361#L121-1 assume !(0 != main_~p9~0#1); 259238#L125-1 assume !(0 != main_~p10~0#1); 259184#L129-1 assume !(0 != main_~p11~0#1); 259185#L133-1 assume !(0 != main_~p12~0#1); 259359#L137-1 assume !(0 != main_~p13~0#1); 259356#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 259354#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 259351#L149-1 assume !(0 != main_~p1~0#1); 259347#L155-1 assume !(0 != main_~p2~0#1); 259344#L160-1 assume !(0 != main_~p3~0#1); 259339#L165-1 assume !(0 != main_~p4~0#1); 259335#L170-1 assume !(0 != main_~p5~0#1); 259330#L175-1 assume !(0 != main_~p6~0#1); 259324#L180-1 assume !(0 != main_~p7~0#1); 259319#L185-1 assume !(0 != main_~p8~0#1); 259313#L190-1 assume !(0 != main_~p9~0#1); 259307#L195-1 assume !(0 != main_~p10~0#1); 259235#L200-1 assume !(0 != main_~p11~0#1); 259234#L205-1 assume !(0 != main_~p12~0#1); 259297#L210-1 assume !(0 != main_~p13~0#1); 259382#L215-1 assume !(0 != main_~p14~0#1); 259380#L220-1 assume !(0 != main_~p15~0#1); 259099#L225-1 [2024-11-19 14:27:12,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:12,036 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-11-19 14:27:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997266075] [2024-11-19 14:27:12,037 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:12,041 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:12,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:12,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:12,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2024-11-19 14:27:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549075374] [2024-11-19 14:27:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:12,076 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-19 14:27:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549075374] [2024-11-19 14:27:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549075374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585950860] [2024-11-19 14:27:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:12,079 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:12,080 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:12,927 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2024-11-19 14:27:12,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2024-11-19 14:27:13,430 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-11-19 14:27:14,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-11-19 14:27:14,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2024-11-19 14:27:14,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2024-11-19 14:27:14,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2024-11-19 14:27:14,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:14,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-11-19 14:27:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2024-11-19 14:27:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2024-11-19 14:27:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 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-19 14:27:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-11-19 14:27:16,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-11-19 14:27:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:16,447 INFO L425 stractBuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-11-19 14:27:16,447 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:27:16,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2024-11-19 14:27:17,591 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-11-19 14:27:17,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:17,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:17,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:17,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:17,594 INFO L745 eck$LassoCheckResult]: Stem: 512033#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 512034#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512043#L225-1 [2024-11-19 14:27:17,594 INFO L747 eck$LassoCheckResult]: Loop: 512043#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 513169#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 513166#L93 assume !(0 != main_~p1~0#1); 513160#L93-2 assume !(0 != main_~p2~0#1); 513155#L97-1 assume !(0 != main_~p3~0#1); 513152#L101-1 assume !(0 != main_~p4~0#1); 513149#L105-1 assume !(0 != main_~p5~0#1); 513141#L109-1 assume !(0 != main_~p6~0#1); 513143#L113-1 assume !(0 != main_~p7~0#1); 513131#L117-1 assume !(0 != main_~p8~0#1); 513133#L121-1 assume !(0 != main_~p9~0#1); 513121#L125-1 assume !(0 != main_~p10~0#1); 513123#L129-1 assume !(0 != main_~p11~0#1); 513114#L133-1 assume !(0 != main_~p12~0#1); 513115#L137-1 assume !(0 != main_~p13~0#1); 513091#L141-1 assume !(0 != main_~p14~0#1); 513089#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 513090#L149-1 assume !(0 != main_~p1~0#1); 513250#L155-1 assume !(0 != main_~p2~0#1); 513245#L160-1 assume !(0 != main_~p3~0#1); 513238#L165-1 assume !(0 != main_~p4~0#1); 513232#L170-1 assume !(0 != main_~p5~0#1); 513224#L175-1 assume !(0 != main_~p6~0#1); 513216#L180-1 assume !(0 != main_~p7~0#1); 513208#L185-1 assume !(0 != main_~p8~0#1); 513204#L190-1 assume !(0 != main_~p9~0#1); 513199#L195-1 assume !(0 != main_~p10~0#1); 513194#L200-1 assume !(0 != main_~p11~0#1); 513191#L205-1 assume !(0 != main_~p12~0#1); 513189#L210-1 assume !(0 != main_~p13~0#1); 513186#L215-1 assume !(0 != main_~p14~0#1); 513182#L220-1 assume !(0 != main_~p15~0#1); 512043#L225-1 [2024-11-19 14:27:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2024-11-19 14:27:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692812612] [2024-11-19 14:27:17,594 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:17,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:17,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:17,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2024-11-19 14:27:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163085370] [2024-11-19 14:27:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:17,625 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-19 14:27:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163085370] [2024-11-19 14:27:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163085370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:27:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013983369] [2024-11-19 14:27:17,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:17,627 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:17,628 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:18,957 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2024-11-19 14:27:18,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2024-11-19 14:27:20,615 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-11-19 14:27:21,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-11-19 14:27:21,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2024-11-19 14:27:21,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2024-11-19 14:27:21,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2024-11-19 14:27:21,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:21,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-11-19 14:27:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2024-11-19 14:27:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2024-11-19 14:27:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 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-19 14:27:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-11-19 14:27:26,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-11-19 14:27:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:26,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-11-19 14:27:26,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:27:26,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2024-11-19 14:27:27,869 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-11-19 14:27:27,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:27,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:27,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:27,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:27,874 INFO L745 eck$LassoCheckResult]: Stem: 1011755#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1011756#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011761#L225-1 [2024-11-19 14:27:27,874 INFO L747 eck$LassoCheckResult]: Loop: 1011761#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012022#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012017#L93 assume !(0 != main_~p1~0#1); 1012010#L93-2 assume !(0 != main_~p2~0#1); 1012003#L97-1 assume !(0 != main_~p3~0#1); 1011997#L101-1 assume !(0 != main_~p4~0#1); 1011990#L105-1 assume !(0 != main_~p5~0#1); 1011982#L109-1 assume !(0 != main_~p6~0#1); 1011974#L113-1 assume !(0 != main_~p7~0#1); 1011964#L117-1 assume !(0 != main_~p8~0#1); 1011965#L121-1 assume !(0 != main_~p9~0#1); 1012113#L125-1 assume !(0 != main_~p10~0#1); 1012111#L129-1 assume !(0 != main_~p11~0#1); 1012107#L133-1 assume !(0 != main_~p12~0#1); 1012103#L137-1 assume !(0 != main_~p13~0#1); 1012099#L141-1 assume !(0 != main_~p14~0#1); 1012095#L145-1 assume !(0 != main_~p15~0#1); 1012091#L149-1 assume !(0 != main_~p1~0#1); 1012087#L155-1 assume !(0 != main_~p2~0#1); 1012084#L160-1 assume !(0 != main_~p3~0#1); 1012079#L165-1 assume !(0 != main_~p4~0#1); 1012075#L170-1 assume !(0 != main_~p5~0#1); 1012071#L175-1 assume !(0 != main_~p6~0#1); 1012067#L180-1 assume !(0 != main_~p7~0#1); 1012065#L185-1 assume !(0 != main_~p8~0#1); 1012062#L190-1 assume !(0 != main_~p9~0#1); 1012058#L195-1 assume !(0 != main_~p10~0#1); 1012055#L200-1 assume !(0 != main_~p11~0#1); 1012051#L205-1 assume !(0 != main_~p12~0#1); 1012046#L210-1 assume !(0 != main_~p13~0#1); 1012040#L215-1 assume !(0 != main_~p14~0#1); 1012033#L220-1 assume !(0 != main_~p15~0#1); 1011761#L225-1 [2024-11-19 14:27:27,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2024-11-19 14:27:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190464986] [2024-11-19 14:27:27,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:27,879 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:27,879 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:27,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:27,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:27,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2024-11-19 14:27:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118139833] [2024-11-19 14:27:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:27,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:27,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:27,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2024-11-19 14:27:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:27,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038554113] [2024-11-19 14:27:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:27,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:27,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:28,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:28,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:27:28 BoogieIcfgContainer [2024-11-19 14:27:28,778 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:27:28,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:27:28,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:27:28,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:27:28,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:03" (3/4) ... [2024-11-19 14:27:28,782 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:27:28,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:27:28,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:27:28,833 INFO L158 Benchmark]: Toolchain (without parser) took 26410.42ms. Allocated memory was 161.5MB in the beginning and 14.0GB in the end (delta: 13.9GB). Free memory was 114.8MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-11-19 14:27:28,833 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:28,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.21ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 101.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:27:28,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:28,834 INFO L158 Benchmark]: Boogie Preprocessor took 44.65ms. Allocated memory is still 161.5MB. Free memory was 99.3MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:28,835 INFO L158 Benchmark]: RCFGBuilder took 580.60ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 117.8MB in the end (delta: -20.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 14:27:28,835 INFO L158 Benchmark]: BuchiAutomizer took 25359.78ms. Allocated memory was 161.5MB in the beginning and 14.0GB in the end (delta: 13.9GB). Free memory was 117.2MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2024-11-19 14:27:28,835 INFO L158 Benchmark]: Witness Printer took 54.19ms. Allocated memory is still 14.0GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:28,837 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.32ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.21ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 101.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 99.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.65ms. Allocated memory is still 161.5MB. Free memory was 99.3MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.60ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 117.8MB in the end (delta: -20.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 25359.78ms. Allocated memory was 161.5MB in the beginning and 14.0GB in the end (delta: 13.9GB). Free memory was 117.2MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 54.19ms. Allocated memory is still 14.0GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 2.1MB). 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 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.2s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 20.1s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 10.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 5.9s Buchi closure took 0.3s. 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, 797 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 2495 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1529 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI13 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: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:27:28,863 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)