./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:32:19,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:32:19,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:32:19,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:32:19,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:32:19,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:32:19,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:32:19,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:32:19,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:32:19,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:32:19,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:32:19,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:32:19,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:32:19,663 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:32:19,666 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:32:19,666 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:32:19,667 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:32:19,667 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:32:19,667 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:32:19,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:32:19,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:32:19,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:32:19,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:32:19,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:32:19,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:32:19,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:32:19,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:32:19,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:32:19,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:32:19,673 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:32:19,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:32:19,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:32:19,674 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:32:19,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:32:19,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:32:19,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:32:19,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:32:19,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:32:19,676 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:32:19,676 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-11-09 15:32:19,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:32:19,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:32:19,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:32:19,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:32:19,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:32:19,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2024-11-09 15:32:21,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:32:21,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:32:21,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2024-11-09 15:32:21,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3591556f1/66b5ddd4ab2e4fe7a07c4885c75acf85/FLAGe149da31b [2024-11-09 15:32:22,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3591556f1/66b5ddd4ab2e4fe7a07c4885c75acf85 [2024-11-09 15:32:22,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:32:22,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:32:22,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:22,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:32:22,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:32:22,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4d7b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22, skipping insertion in model container [2024-11-09 15:32:22,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:32:22,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:22,255 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:32:22,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:22,292 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:32:22,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22 WrapperNode [2024-11-09 15:32:22,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:22,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:22,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:32:22,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:32:22,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,327 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 171 [2024-11-09 15:32:22,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:22,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:32:22,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:32:22,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:32:22,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,353 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-09 15:32:22,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:32:22,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:32:22,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:32:22,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:32:22,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:22,430 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-09 15:32:22,440 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-09 15:32:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:32:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:32:22,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:32:22,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:32:22,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:32:22,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:32:22,822 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 15:32:22,822 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:32:22,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:32:22,834 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:32:22,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:22 BoogieIcfgContainer [2024-11-09 15:32:22,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:32:22,836 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:32:22,836 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:32:22,839 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:32:22,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:22,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:32:22" (1/3) ... [2024-11-09 15:32:22,840 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323ab7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:22, skipping insertion in model container [2024-11-09 15:32:22,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:22,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22" (2/3) ... [2024-11-09 15:32:22,841 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323ab7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:22, skipping insertion in model container [2024-11-09 15:32:22,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:22,841 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:22" (3/3) ... [2024-11-09 15:32:22,842 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2024-11-09 15:32:22,893 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:32:22,894 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:32:22,894 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:32:22,894 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:32:22,894 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:32:22,894 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:32:22,895 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:32:22,895 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:32:22,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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-09 15:32:22,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-09 15:32:22,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,922 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,923 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] [2024-11-09 15:32:22,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:32:22,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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-09 15:32:22,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-09 15:32:22,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,928 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] [2024-11-09 15:32:22,935 INFO L745 eck$LassoCheckResult]: Stem: 22#$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(16, 2);call #Ultimate.allocInit(12, 3); 28#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_~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_~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_~cond~0#1; 10#L197-1true [2024-11-09 15:32:22,936 INFO L747 eck$LassoCheckResult]: Loop: 10#L197-1true assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 48#L52true 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; 15#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 31#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 7#L87-1true assume !(0 != main_~p3~0#1); 27#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 29#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 38#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 43#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17#L119-1true assume !(0 != main_~p11~0#1); 26#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 18#L131-1true assume !(0 != main_~p1~0#1); 9#L137-1true assume !(0 != main_~p2~0#1); 5#L142-1true assume !(0 != main_~p3~0#1); 45#L147-1true assume !(0 != main_~p4~0#1); 8#L152-1true assume !(0 != main_~p5~0#1); 12#L157-1true assume !(0 != main_~p6~0#1); 34#L162-1true assume !(0 != main_~p7~0#1); 35#L167-1true assume !(0 != main_~p8~0#1); 36#L172-1true assume !(0 != main_~p9~0#1); 42#L177-1true assume !(0 != main_~p10~0#1); 49#L182-1true assume !(0 != main_~p11~0#1); 24#L187-1true assume !(0 != main_~p12~0#1); 46#L192-1true assume !(0 != main_~p13~0#1); 10#L197-1true [2024-11-09 15:32:22,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:32:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746046669] [2024-11-09 15:32:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash 203947253, now seen corresponding path program 1 times [2024-11-09 15:32:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577702999] [2024-11-09 15:32:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,232 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-09 15:32:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577702999] [2024-11-09 15:32:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577702999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992087652] [2024-11-09 15:32:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,240 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,271 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,320 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2024-11-09 15:32:23,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 165 transitions. [2024-11-09 15:32:23,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2024-11-09 15:32:23,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 83 states and 133 transitions. [2024-11-09 15:32:23,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-09 15:32:23,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-09 15:32:23,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2024-11-09 15:32:23,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-09 15:32:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2024-11-09 15:32:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 15:32:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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-09 15:32:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2024-11-09 15:32:23,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-09 15:32:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,390 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-09 15:32:23,390 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:32:23,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2024-11-09 15:32:23,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2024-11-09 15:32:23,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,396 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] [2024-11-09 15:32:23,396 INFO L745 eck$LassoCheckResult]: Stem: 197#$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(16, 2);call #Ultimate.allocInit(12, 3); 155#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_~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_~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_~cond~0#1; 156#L197-1 [2024-11-09 15:32:23,397 INFO L747 eck$LassoCheckResult]: Loop: 156#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 198#L52 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; 199#L83 assume !(0 != main_~p1~0#1); 173#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 162#L87-1 assume !(0 != main_~p3~0#1); 149#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 150#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 174#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 163#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 164#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 171#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 172#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 191#L119-1 assume !(0 != main_~p11~0#1); 192#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 183#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 184#L131-1 assume !(0 != main_~p1~0#1); 168#L137-1 assume !(0 != main_~p2~0#1); 157#L142-1 assume !(0 != main_~p3~0#1); 159#L147-1 assume !(0 != main_~p4~0#1); 161#L152-1 assume !(0 != main_~p5~0#1); 214#L157-1 assume !(0 != main_~p6~0#1); 212#L162-1 assume !(0 != main_~p7~0#1); 210#L167-1 assume !(0 != main_~p8~0#1); 207#L172-1 assume !(0 != main_~p9~0#1); 206#L177-1 assume !(0 != main_~p10~0#1); 204#L182-1 assume !(0 != main_~p11~0#1); 200#L187-1 assume !(0 != main_~p12~0#1); 186#L192-1 assume !(0 != main_~p13~0#1); 156#L197-1 [2024-11-09 15:32:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:32:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928151414] [2024-11-09 15:32:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 265986867, now seen corresponding path program 1 times [2024-11-09 15:32:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509020657] [2024-11-09 15:32:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,521 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-09 15:32:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509020657] [2024-11-09 15:32:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509020657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150775329] [2024-11-09 15:32:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,522 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,523 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,551 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2024-11-09 15:32:23,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2024-11-09 15:32:23,554 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2024-11-09 15:32:23,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2024-11-09 15:32:23,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2024-11-09 15:32:23,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2024-11-09 15:32:23,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2024-11-09 15:32:23,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-09 15:32:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2024-11-09 15:32:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-09 15:32:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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-09 15:32:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2024-11-09 15:32:23,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-09 15:32:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,582 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-09 15:32:23,582 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:32:23,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2024-11-09 15:32:23,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2024-11-09 15:32:23,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,585 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] [2024-11-09 15:32:23,586 INFO L745 eck$LassoCheckResult]: Stem: 454#$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(16, 2);call #Ultimate.allocInit(12, 3); 406#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_~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_~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_~cond~0#1; 405#L197-1 [2024-11-09 15:32:23,586 INFO L747 eck$LassoCheckResult]: Loop: 405#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 457#L52 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; 458#L83 assume !(0 != main_~p1~0#1); 509#L83-2 assume !(0 != main_~p2~0#1); 508#L87-1 assume !(0 != main_~p3~0#1); 507#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 506#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 505#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 504#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 503#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 502#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 501#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 500#L119-1 assume !(0 != main_~p11~0#1); 499#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 498#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 496#L131-1 assume !(0 != main_~p1~0#1); 495#L137-1 assume !(0 != main_~p2~0#1); 493#L142-1 assume !(0 != main_~p3~0#1); 492#L147-1 assume !(0 != main_~p4~0#1); 415#L152-1 assume !(0 != main_~p5~0#1); 416#L157-1 assume !(0 != main_~p6~0#1); 483#L162-1 assume !(0 != main_~p7~0#1); 482#L167-1 assume !(0 != main_~p8~0#1); 435#L172-1 assume !(0 != main_~p9~0#1); 436#L177-1 assume !(0 != main_~p10~0#1); 473#L182-1 assume !(0 != main_~p11~0#1); 472#L187-1 assume !(0 != main_~p12~0#1); 452#L192-1 assume !(0 != main_~p13~0#1); 405#L197-1 [2024-11-09 15:32:23,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:32:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680781462] [2024-11-09 15:32:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 406535477, now seen corresponding path program 1 times [2024-11-09 15:32:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833484717] [2024-11-09 15:32:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,668 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-09 15:32:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833484717] [2024-11-09 15:32:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833484717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389796032] [2024-11-09 15:32:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,671 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,673 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,700 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2024-11-09 15:32:23,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2024-11-09 15:32:23,703 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2024-11-09 15:32:23,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2024-11-09 15:32:23,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2024-11-09 15:32:23,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2024-11-09 15:32:23,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2024-11-09 15:32:23,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-09 15:32:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2024-11-09 15:32:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-09 15:32:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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-09 15:32:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2024-11-09 15:32:23,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-09 15:32:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,729 INFO L425 stractBuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-09 15:32:23,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:32:23,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2024-11-09 15:32:23,733 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2024-11-09 15:32:23,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,734 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] [2024-11-09 15:32:23,734 INFO L745 eck$LassoCheckResult]: Stem: 941#$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(16, 2);call #Ultimate.allocInit(12, 3); 892#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_~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_~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_~cond~0#1; 893#L197-1 [2024-11-09 15:32:23,734 INFO L747 eck$LassoCheckResult]: Loop: 893#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 992#L52 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; 990#L83 assume !(0 != main_~p1~0#1); 986#L83-2 assume !(0 != main_~p2~0#1); 984#L87-1 assume !(0 != main_~p3~0#1); 981#L91-1 assume !(0 != main_~p4~0#1); 979#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 977#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 975#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 973#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 971#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 969#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 967#L119-1 assume !(0 != main_~p11~0#1); 965#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 963#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 960#L131-1 assume !(0 != main_~p1~0#1); 961#L137-1 assume !(0 != main_~p2~0#1); 1036#L142-1 assume !(0 != main_~p3~0#1); 1031#L147-1 assume !(0 != main_~p4~0#1); 1028#L152-1 assume !(0 != main_~p5~0#1); 1024#L157-1 assume !(0 != main_~p6~0#1); 1020#L162-1 assume !(0 != main_~p7~0#1); 1016#L167-1 assume !(0 != main_~p8~0#1); 1011#L172-1 assume !(0 != main_~p9~0#1); 1008#L177-1 assume !(0 != main_~p10~0#1); 1004#L182-1 assume !(0 != main_~p11~0#1); 999#L187-1 assume !(0 != main_~p12~0#1); 996#L192-1 assume !(0 != main_~p13~0#1); 893#L197-1 [2024-11-09 15:32:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:32:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41839518] [2024-11-09 15:32:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1398902857, now seen corresponding path program 1 times [2024-11-09 15:32:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813682940] [2024-11-09 15:32:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,815 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-09 15:32:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813682940] [2024-11-09 15:32:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813682940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817877818] [2024-11-09 15:32:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,819 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,821 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,841 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2024-11-09 15:32:23,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2024-11-09 15:32:23,848 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2024-11-09 15:32:23,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2024-11-09 15:32:23,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2024-11-09 15:32:23,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2024-11-09 15:32:23,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2024-11-09 15:32:23,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-09 15:32:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2024-11-09 15:32:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2024-11-09 15:32:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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-09 15:32:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2024-11-09 15:32:23,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-09 15:32:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,899 INFO L425 stractBuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-09 15:32:23,900 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:32:23,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2024-11-09 15:32:23,903 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2024-11-09 15:32:23,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,905 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] [2024-11-09 15:32:23,905 INFO L745 eck$LassoCheckResult]: Stem: 1881#$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(16, 2);call #Ultimate.allocInit(12, 3); 1842#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_~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_~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_~cond~0#1; 1843#L197-1 [2024-11-09 15:32:23,906 INFO L747 eck$LassoCheckResult]: Loop: 1843#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1937#L52 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; 1935#L83 assume !(0 != main_~p1~0#1); 1931#L83-2 assume !(0 != main_~p2~0#1); 1929#L87-1 assume !(0 != main_~p3~0#1); 1925#L91-1 assume !(0 != main_~p4~0#1); 1921#L95-1 assume !(0 != main_~p5~0#1); 1919#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1917#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1915#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1913#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1911#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1909#L119-1 assume !(0 != main_~p11~0#1); 1907#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1905#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1902#L131-1 assume !(0 != main_~p1~0#1); 1903#L137-1 assume !(0 != main_~p2~0#1); 1981#L142-1 assume !(0 != main_~p3~0#1); 1976#L147-1 assume !(0 != main_~p4~0#1); 1972#L152-1 assume !(0 != main_~p5~0#1); 1969#L157-1 assume !(0 != main_~p6~0#1); 1965#L162-1 assume !(0 != main_~p7~0#1); 1961#L167-1 assume !(0 != main_~p8~0#1); 1956#L172-1 assume !(0 != main_~p9~0#1); 1953#L177-1 assume !(0 != main_~p10~0#1); 1949#L182-1 assume !(0 != main_~p11~0#1); 1944#L187-1 assume !(0 != main_~p12~0#1); 1941#L192-1 assume !(0 != main_~p13~0#1); 1843#L197-1 [2024-11-09 15:32:23,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-09 15:32:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439474532] [2024-11-09 15:32:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1180048139, now seen corresponding path program 1 times [2024-11-09 15:32:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374474187] [2024-11-09 15:32:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,990 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-09 15:32:23,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374474187] [2024-11-09 15:32:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374474187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039217696] [2024-11-09 15:32:23,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,992 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,993 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,010 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2024-11-09 15:32:24,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2024-11-09 15:32:24,021 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2024-11-09 15:32:24,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2024-11-09 15:32:24,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2024-11-09 15:32:24,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2024-11-09 15:32:24,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2024-11-09 15:32:24,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-09 15:32:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2024-11-09 15:32:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2024-11-09 15:32:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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-09 15:32:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2024-11-09 15:32:24,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-09 15:32:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,060 INFO L425 stractBuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-09 15:32:24,060 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:32:24,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2024-11-09 15:32:24,066 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2024-11-09 15:32:24,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,067 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,068 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] [2024-11-09 15:32:24,069 INFO L745 eck$LassoCheckResult]: Stem: 3757#$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(16, 2);call #Ultimate.allocInit(12, 3); 3708#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_~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_~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_~cond~0#1; 3709#L197-1 [2024-11-09 15:32:24,069 INFO L747 eck$LassoCheckResult]: Loop: 3709#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3846#L52 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; 3842#L83 assume !(0 != main_~p1~0#1); 3835#L83-2 assume !(0 != main_~p2~0#1); 3830#L87-1 assume !(0 != main_~p3~0#1); 3823#L91-1 assume !(0 != main_~p4~0#1); 3815#L95-1 assume !(0 != main_~p5~0#1); 3809#L99-1 assume !(0 != main_~p6~0#1); 3804#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3801#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3798#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3795#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3792#L119-1 assume !(0 != main_~p11~0#1); 3789#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3785#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3786#L131-1 assume !(0 != main_~p1~0#1); 3913#L137-1 assume !(0 != main_~p2~0#1); 3909#L142-1 assume !(0 != main_~p3~0#1); 3899#L147-1 assume !(0 != main_~p4~0#1); 3894#L152-1 assume !(0 != main_~p5~0#1); 3892#L157-1 assume !(0 != main_~p6~0#1); 3891#L162-1 assume !(0 != main_~p7~0#1); 3889#L167-1 assume !(0 != main_~p8~0#1); 3882#L172-1 assume !(0 != main_~p9~0#1); 3871#L177-1 assume !(0 != main_~p10~0#1); 3863#L182-1 assume !(0 != main_~p11~0#1); 3858#L187-1 assume !(0 != main_~p12~0#1); 3855#L192-1 assume !(0 != main_~p13~0#1); 3709#L197-1 [2024-11-09 15:32:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-09 15:32:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048847426] [2024-11-09 15:32:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -757346313, now seen corresponding path program 1 times [2024-11-09 15:32:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002670169] [2024-11-09 15:32:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,126 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-09 15:32:24,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002670169] [2024-11-09 15:32:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002670169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067863380] [2024-11-09 15:32:24,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,129 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,130 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,159 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2024-11-09 15:32:24,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2024-11-09 15:32:24,177 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2024-11-09 15:32:24,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2024-11-09 15:32:24,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2024-11-09 15:32:24,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2024-11-09 15:32:24,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2024-11-09 15:32:24,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-09 15:32:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2024-11-09 15:32:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2024-11-09 15:32:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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-09 15:32:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2024-11-09 15:32:24,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-09 15:32:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-09 15:32:24,245 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:32:24,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2024-11-09 15:32:24,258 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2024-11-09 15:32:24,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,259 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] [2024-11-09 15:32:24,260 INFO L745 eck$LassoCheckResult]: Stem: 7432#$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(16, 2);call #Ultimate.allocInit(12, 3); 7382#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_~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_~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_~cond~0#1; 7383#L197-1 [2024-11-09 15:32:24,260 INFO L747 eck$LassoCheckResult]: Loop: 7383#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7754#L52 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; 7752#L83 assume !(0 != main_~p1~0#1); 7749#L83-2 assume !(0 != main_~p2~0#1); 7746#L87-1 assume !(0 != main_~p3~0#1); 7743#L91-1 assume !(0 != main_~p4~0#1); 7739#L95-1 assume !(0 != main_~p5~0#1); 7740#L99-1 assume !(0 != main_~p6~0#1); 7619#L103-1 assume !(0 != main_~p7~0#1); 7616#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7613#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7610#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7607#L119-1 assume !(0 != main_~p11~0#1); 7604#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7600#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7601#L131-1 assume !(0 != main_~p1~0#1); 7726#L137-1 assume !(0 != main_~p2~0#1); 7590#L142-1 assume !(0 != main_~p3~0#1); 7584#L147-1 assume !(0 != main_~p4~0#1); 7586#L152-1 assume !(0 != main_~p5~0#1); 7810#L157-1 assume !(0 != main_~p6~0#1); 7806#L162-1 assume !(0 != main_~p7~0#1); 7801#L167-1 assume !(0 != main_~p8~0#1); 7794#L172-1 assume !(0 != main_~p9~0#1); 7791#L177-1 assume !(0 != main_~p10~0#1); 7787#L182-1 assume !(0 != main_~p11~0#1); 7781#L187-1 assume !(0 != main_~p12~0#1); 7768#L192-1 assume !(0 != main_~p13~0#1); 7383#L197-1 [2024-11-09 15:32:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-09 15:32:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663466368] [2024-11-09 15:32:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1574994763, now seen corresponding path program 1 times [2024-11-09 15:32:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088602720] [2024-11-09 15:32:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,304 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-09 15:32:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088602720] [2024-11-09 15:32:24,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088602720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212333799] [2024-11-09 15:32:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,306 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,307 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,337 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2024-11-09 15:32:24,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2024-11-09 15:32:24,395 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2024-11-09 15:32:24,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2024-11-09 15:32:24,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2024-11-09 15:32:24,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2024-11-09 15:32:24,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2024-11-09 15:32:24,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-09 15:32:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2024-11-09 15:32:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2024-11-09 15:32:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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-09 15:32:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2024-11-09 15:32:24,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-09 15:32:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-09 15:32:24,528 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:32:24,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2024-11-09 15:32:24,551 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2024-11-09 15:32:24,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,554 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] [2024-11-09 15:32:24,554 INFO L745 eck$LassoCheckResult]: Stem: 14670#$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(16, 2);call #Ultimate.allocInit(12, 3); 14624#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_~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_~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_~cond~0#1; 14625#L197-1 [2024-11-09 15:32:24,555 INFO L747 eck$LassoCheckResult]: Loop: 14625#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15201#L52 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; 15200#L83 assume !(0 != main_~p1~0#1); 15065#L83-2 assume !(0 != main_~p2~0#1); 15067#L87-1 assume !(0 != main_~p3~0#1); 15047#L91-1 assume !(0 != main_~p4~0#1); 15048#L95-1 assume !(0 != main_~p5~0#1); 15232#L99-1 assume !(0 != main_~p6~0#1); 15230#L103-1 assume !(0 != main_~p7~0#1); 15227#L107-1 assume !(0 != main_~p8~0#1); 15225#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 15223#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 15222#L119-1 assume !(0 != main_~p11~0#1); 15221#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 15219#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 15195#L131-1 assume !(0 != main_~p1~0#1); 15196#L137-1 assume !(0 != main_~p2~0#1); 15185#L142-1 assume !(0 != main_~p3~0#1); 15184#L147-1 assume !(0 != main_~p4~0#1); 15302#L152-1 assume !(0 != main_~p5~0#1); 15298#L157-1 assume !(0 != main_~p6~0#1); 15295#L162-1 assume !(0 != main_~p7~0#1); 15290#L167-1 assume !(0 != main_~p8~0#1); 15285#L172-1 assume !(0 != main_~p9~0#1); 15281#L177-1 assume !(0 != main_~p10~0#1); 15277#L182-1 assume !(0 != main_~p11~0#1); 15208#L187-1 assume !(0 != main_~p12~0#1); 15205#L192-1 assume !(0 != main_~p13~0#1); 14625#L197-1 [2024-11-09 15:32:24,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-09 15:32:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498992800] [2024-11-09 15:32:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1031028791, now seen corresponding path program 1 times [2024-11-09 15:32:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300131380] [2024-11-09 15:32:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,602 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-09 15:32:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300131380] [2024-11-09 15:32:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300131380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767121421] [2024-11-09 15:32:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,604 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,607 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,653 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2024-11-09 15:32:24,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2024-11-09 15:32:24,784 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2024-11-09 15:32:24,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2024-11-09 15:32:24,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2024-11-09 15:32:24,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2024-11-09 15:32:24,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2024-11-09 15:32:24,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-09 15:32:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2024-11-09 15:32:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2024-11-09 15:32:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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-09 15:32:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2024-11-09 15:32:25,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-09 15:32:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:25,048 INFO L425 stractBuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-09 15:32:25,048 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:32:25,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2024-11-09 15:32:25,162 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2024-11-09 15:32:25,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:25,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:25,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:25,163 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] [2024-11-09 15:32:25,164 INFO L745 eck$LassoCheckResult]: Stem: 28956#$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(16, 2);call #Ultimate.allocInit(12, 3); 28906#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_~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_~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_~cond~0#1; 28907#L197-1 [2024-11-09 15:32:25,164 INFO L747 eck$LassoCheckResult]: Loop: 28907#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29452#L52 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; 29445#L83 assume !(0 != main_~p1~0#1); 29438#L83-2 assume !(0 != main_~p2~0#1); 29439#L87-1 assume !(0 != main_~p3~0#1); 29544#L91-1 assume !(0 != main_~p4~0#1); 29542#L95-1 assume !(0 != main_~p5~0#1); 29540#L99-1 assume !(0 != main_~p6~0#1); 29419#L103-1 assume !(0 != main_~p7~0#1); 29421#L107-1 assume !(0 != main_~p8~0#1); 29407#L111-1 assume !(0 != main_~p9~0#1); 29409#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29398#L119-1 assume !(0 != main_~p11~0#1); 29399#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29390#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29391#L131-1 assume !(0 != main_~p1~0#1); 29526#L137-1 assume !(0 != main_~p2~0#1); 29524#L142-1 assume !(0 != main_~p3~0#1); 29521#L147-1 assume !(0 != main_~p4~0#1); 29519#L152-1 assume !(0 != main_~p5~0#1); 29517#L157-1 assume !(0 != main_~p6~0#1); 29515#L162-1 assume !(0 != main_~p7~0#1); 29508#L167-1 assume !(0 != main_~p8~0#1); 29502#L172-1 assume !(0 != main_~p9~0#1); 29493#L177-1 assume !(0 != main_~p10~0#1); 29485#L182-1 assume !(0 != main_~p11~0#1); 29468#L187-1 assume !(0 != main_~p12~0#1); 29461#L192-1 assume !(0 != main_~p13~0#1); 28907#L197-1 [2024-11-09 15:32:25,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-09 15:32:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812512664] [2024-11-09 15:32:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -963115915, now seen corresponding path program 1 times [2024-11-09 15:32:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748422090] [2024-11-09 15:32:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:25,211 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-09 15:32:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748422090] [2024-11-09 15:32:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748422090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277131853] [2024-11-09 15:32:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:25,212 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:25,212 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:25,281 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2024-11-09 15:32:25,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2024-11-09 15:32:25,371 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2024-11-09 15:32:25,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2024-11-09 15:32:25,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2024-11-09 15:32:25,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2024-11-09 15:32:25,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2024-11-09 15:32:25,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:25,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-09 15:32:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2024-11-09 15:32:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2024-11-09 15:32:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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-09 15:32:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2024-11-09 15:32:26,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-09 15:32:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:26,095 INFO L425 stractBuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-09 15:32:26,095 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:32:26,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2024-11-09 15:32:26,173 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2024-11-09 15:32:26,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:26,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:26,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:26,174 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] [2024-11-09 15:32:26,174 INFO L745 eck$LassoCheckResult]: Stem: 57125#$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(16, 2);call #Ultimate.allocInit(12, 3); 57076#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_~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_~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_~cond~0#1; 57077#L197-1 [2024-11-09 15:32:26,175 INFO L747 eck$LassoCheckResult]: Loop: 57077#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57241#L52 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; 57237#L83 assume !(0 != main_~p1~0#1); 57234#L83-2 assume !(0 != main_~p2~0#1); 57231#L87-1 assume !(0 != main_~p3~0#1); 57227#L91-1 assume !(0 != main_~p4~0#1); 57223#L95-1 assume !(0 != main_~p5~0#1); 57219#L99-1 assume !(0 != main_~p6~0#1); 57214#L103-1 assume !(0 != main_~p7~0#1); 57210#L107-1 assume !(0 != main_~p8~0#1); 57183#L111-1 assume !(0 != main_~p9~0#1); 57185#L115-1 assume !(0 != main_~p10~0#1); 57623#L119-1 assume !(0 != main_~p11~0#1); 57639#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57636#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57600#L131-1 assume !(0 != main_~p1~0#1); 57597#L137-1 assume !(0 != main_~p2~0#1); 57555#L142-1 assume !(0 != main_~p3~0#1); 57475#L147-1 assume !(0 != main_~p4~0#1); 57472#L152-1 assume !(0 != main_~p5~0#1); 57469#L157-1 assume !(0 != main_~p6~0#1); 57466#L162-1 assume !(0 != main_~p7~0#1); 57464#L167-1 assume !(0 != main_~p8~0#1); 57461#L172-1 assume !(0 != main_~p9~0#1); 57456#L177-1 assume !(0 != main_~p10~0#1); 57453#L182-1 assume !(0 != main_~p11~0#1); 57247#L187-1 assume !(0 != main_~p12~0#1); 57246#L192-1 assume !(0 != main_~p13~0#1); 57077#L197-1 [2024-11-09 15:32:26,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-09 15:32:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360529225] [2024-11-09 15:32:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:26,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:26,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1743503479, now seen corresponding path program 1 times [2024-11-09 15:32:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303410717] [2024-11-09 15:32:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:26,291 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-09 15:32:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303410717] [2024-11-09 15:32:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303410717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741410262] [2024-11-09 15:32:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:26,292 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:26,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:26,293 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:26,406 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2024-11-09 15:32:26,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2024-11-09 15:32:26,682 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2024-11-09 15:32:26,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2024-11-09 15:32:26,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2024-11-09 15:32:26,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2024-11-09 15:32:26,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2024-11-09 15:32:26,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:26,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-09 15:32:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2024-11-09 15:32:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2024-11-09 15:32:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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-09 15:32:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2024-11-09 15:32:27,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-09 15:32:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:27,709 INFO L425 stractBuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-09 15:32:27,709 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:32:27,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2024-11-09 15:32:27,819 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2024-11-09 15:32:27,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:27,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:27,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:27,820 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] [2024-11-09 15:32:27,820 INFO L745 eck$LassoCheckResult]: Stem: 112688#$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(16, 2);call #Ultimate.allocInit(12, 3); 112638#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_~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_~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_~cond~0#1; 112639#L197-1 [2024-11-09 15:32:27,820 INFO L747 eck$LassoCheckResult]: Loop: 112639#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 112884#L52 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; 112880#L83 assume !(0 != main_~p1~0#1); 112876#L83-2 assume !(0 != main_~p2~0#1); 112874#L87-1 assume !(0 != main_~p3~0#1); 112870#L91-1 assume !(0 != main_~p4~0#1); 112866#L95-1 assume !(0 != main_~p5~0#1); 112862#L99-1 assume !(0 != main_~p6~0#1); 112855#L103-1 assume !(0 != main_~p7~0#1); 112853#L107-1 assume !(0 != main_~p8~0#1); 112854#L111-1 assume !(0 != main_~p9~0#1); 112939#L115-1 assume !(0 != main_~p10~0#1); 112937#L119-1 assume !(0 != main_~p11~0#1); 112935#L123-1 assume !(0 != main_~p12~0#1); 112933#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 112929#L131-1 assume !(0 != main_~p1~0#1); 112925#L137-1 assume !(0 != main_~p2~0#1); 112922#L142-1 assume !(0 != main_~p3~0#1); 112917#L147-1 assume !(0 != main_~p4~0#1); 112913#L152-1 assume !(0 != main_~p5~0#1); 112909#L157-1 assume !(0 != main_~p6~0#1); 112905#L162-1 assume !(0 != main_~p7~0#1); 112901#L167-1 assume !(0 != main_~p8~0#1); 112897#L172-1 assume !(0 != main_~p9~0#1); 112828#L177-1 assume !(0 != main_~p10~0#1); 112824#L182-1 assume !(0 != main_~p11~0#1); 112823#L187-1 assume !(0 != main_~p12~0#1); 112888#L192-1 assume !(0 != main_~p13~0#1); 112639#L197-1 [2024-11-09 15:32:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-09 15:32:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814952047] [2024-11-09 15:32:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:27,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:27,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:27,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 463639801, now seen corresponding path program 1 times [2024-11-09 15:32:27,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:27,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561612492] [2024-11-09 15:32:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:27,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:27,850 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-09 15:32:27,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:27,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561612492] [2024-11-09 15:32:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561612492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:32:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010366021] [2024-11-09 15:32:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:27,851 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:27,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:27,853 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-09 15:32:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:28,178 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2024-11-09 15:32:28,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2024-11-09 15:32:28,620 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2024-11-09 15:32:28,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2024-11-09 15:32:28,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2024-11-09 15:32:29,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2024-11-09 15:32:29,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2024-11-09 15:32:29,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:29,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-09 15:32:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2024-11-09 15:32:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2024-11-09 15:32:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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-09 15:32:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2024-11-09 15:32:30,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-09 15:32:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:30,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-09 15:32:30,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:32:30,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2024-11-09 15:32:30,643 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2024-11-09 15:32:30,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:30,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:30,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:30,644 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] [2024-11-09 15:32:30,645 INFO L745 eck$LassoCheckResult]: Stem: 222269#$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(16, 2);call #Ultimate.allocInit(12, 3); 222216#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_~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_~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_~cond~0#1; 222217#L197-1 [2024-11-09 15:32:30,645 INFO L747 eck$LassoCheckResult]: Loop: 222217#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 222920#L52 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; 222921#L83 assume !(0 != main_~p1~0#1); 222914#L83-2 assume !(0 != main_~p2~0#1); 222916#L87-1 assume !(0 != main_~p3~0#1); 222909#L91-1 assume !(0 != main_~p4~0#1); 222911#L95-1 assume !(0 != main_~p5~0#1); 222973#L99-1 assume !(0 != main_~p6~0#1); 222969#L103-1 assume !(0 != main_~p7~0#1); 222965#L107-1 assume !(0 != main_~p8~0#1); 222962#L111-1 assume !(0 != main_~p9~0#1); 222963#L115-1 assume !(0 != main_~p10~0#1); 222768#L119-1 assume !(0 != main_~p11~0#1); 222769#L123-1 assume !(0 != main_~p12~0#1); 222752#L127-1 assume !(0 != main_~p13~0#1); 222754#L131-1 assume !(0 != main_~p1~0#1); 223183#L137-1 assume !(0 != main_~p2~0#1); 224211#L142-1 assume !(0 != main_~p3~0#1); 222443#L147-1 assume !(0 != main_~p4~0#1); 222445#L152-1 assume !(0 != main_~p5~0#1); 222860#L157-1 assume !(0 != main_~p6~0#1); 222861#L162-1 assume !(0 != main_~p7~0#1); 222849#L167-1 assume !(0 != main_~p8~0#1); 222850#L172-1 assume !(0 != main_~p9~0#1); 222935#L177-1 assume !(0 != main_~p10~0#1); 222931#L182-1 assume !(0 != main_~p11~0#1); 222930#L187-1 assume !(0 != main_~p12~0#1); 222924#L192-1 assume !(0 != main_~p13~0#1); 222217#L197-1 [2024-11-09 15:32:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-11-09 15:32:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478079711] [2024-11-09 15:32:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -547477449, now seen corresponding path program 1 times [2024-11-09 15:32:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:30,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939300344] [2024-11-09 15:32:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 496424185, now seen corresponding path program 1 times [2024-11-09 15:32:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092564120] [2024-11-09 15:32:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:31,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:32:31 BoogieIcfgContainer [2024-11-09 15:32:31,359 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:32:31,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:32:31,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:32:31,360 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:32:31,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:22" (3/4) ... [2024-11-09 15:32:31,362 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:32:31,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:32:31,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:32:31,417 INFO L158 Benchmark]: Toolchain (without parser) took 9395.79ms. Allocated memory was 155.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 86.2MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 621.3MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,418 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:31,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.93ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 72.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 155.2MB. Free memory was 72.6MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,418 INFO L158 Benchmark]: Boogie Preprocessor took 44.55ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,419 INFO L158 Benchmark]: RCFGBuilder took 461.90ms. Allocated memory is still 155.2MB. Free memory was 68.7MB in the beginning and 112.4MB in the end (delta: -43.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,419 INFO L158 Benchmark]: BuchiAutomizer took 8523.19ms. Allocated memory was 155.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.4MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 648.3MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,419 INFO L158 Benchmark]: Witness Printer took 57.09ms. Allocated memory is still 6.3GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:31,421 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.93ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 72.6MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 155.2MB. Free memory was 72.6MB in the beginning and 70.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.55ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.90ms. Allocated memory is still 155.2MB. Free memory was 68.7MB in the beginning and 112.4MB in the end (delta: -43.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 8523.19ms. Allocated memory was 155.2MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 112.4MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 648.3MB. Max. memory is 16.1GB. * Witness Printer took 57.09ms. Allocated memory is still 6.3GB. Free memory was 5.6GB in the beginning and 5.6GB 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.8s Buchi closure took 0.1s. 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, 587 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1132 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 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: 50]: 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; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: 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; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:32:31,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)