./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:32:18,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:32:18,877 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:18,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:32:18,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:32:18,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:32:18,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:32:18,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:32:18,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:32:18,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:32:18,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:32:18,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:32:18,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:32:18,910 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:32:18,910 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:32:18,911 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:32:18,911 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:32:18,911 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:32:18,912 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:32:18,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:32:18,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:32:18,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:32:18,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:32:18,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:32:18,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:32:18,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:32:18,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:32:18,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:32:18,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:32:18,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:32:18,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:32:18,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:32:18,915 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:32:18,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:32:18,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:32:18,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:32:18,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:32:18,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:32:18,917 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:32:18,917 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2024-11-09 15:32:19,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:32:19,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:32:19,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:32:19,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:32:19,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:32:19,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 15:32:20,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:32:20,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:32:20,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2024-11-09 15:32:20,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6d79f00/e9bab93aa96343e3993fa171f235198c/FLAG55902d9d6 [2024-11-09 15:32:21,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6d79f00/e9bab93aa96343e3993fa171f235198c [2024-11-09 15:32:21,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:32:21,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:32:21,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:21,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:32:21,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:32:21,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:21" (1/1) ... [2024-11-09 15:32:21,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc72efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:21, skipping insertion in model container [2024-11-09 15:32:21,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:21" (1/1) ... [2024-11-09 15:32:21,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:32:21,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:21,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:32:21,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:21,359 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:32:21,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:21 WrapperNode [2024-11-09 15:32:21,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:21,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:21,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:32:21,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:32:21,365 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:21" (1/1) ... [2024-11-09 15:32:21,369 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:21" (1/1) ... [2024-11-09 15:32:21,381 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-09 15:32:21,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:21,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:32:21,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:32:21,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:32:21,388 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:21" (1/1) ... [2024-11-09 15:32:21,388 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:21" (1/1) ... [2024-11-09 15:32:21,389 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:21" (1/1) ... [2024-11-09 15:32:21,396 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:21,397 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:21" (1/1) ... [2024-11-09 15:32:21,397 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:21" (1/1) ... [2024-11-09 15:32:21,399 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:21" (1/1) ... [2024-11-09 15:32:21,401 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:21" (1/1) ... [2024-11-09 15:32:21,402 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:21" (1/1) ... [2024-11-09 15:32:21,403 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:21" (1/1) ... [2024-11-09 15:32:21,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:32:21,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:32:21,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:32:21,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:32:21,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:21" (1/1) ... [2024-11-09 15:32:21,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:21,434 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:21,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:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:32:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:32:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:32:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:32:21,543 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:32:21,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:32:21,743 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 15:32:21,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:32:21,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:32:21,753 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:32:21,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:21 BoogieIcfgContainer [2024-11-09 15:32:21,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:32:21,754 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:32:21,754 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:32:21,757 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:32:21,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:21,758 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:32:21" (1/3) ... [2024-11-09 15:32:21,758 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50df6b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:21, skipping insertion in model container [2024-11-09 15:32:21,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:21,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:21" (2/3) ... [2024-11-09 15:32:21,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50df6b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:21, skipping insertion in model container [2024-11-09 15:32:21,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:21,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:21" (3/3) ... [2024-11-09 15:32:21,760 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2024-11-09 15:32:21,798 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:32:21,798 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:32:21,798 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:32:21,798 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:32:21,798 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:32:21,799 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:32:21,799 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:32:21,799 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:32:21,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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:21,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-09 15:32:21,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:21,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:21,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:21,819 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] [2024-11-09 15:32:21,819 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:32:21,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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:21,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-11-09 15:32:21,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:21,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:21,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:21,822 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] [2024-11-09 15:32:21,827 INFO L745 eck$LassoCheckResult]: Stem: 39#$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); 9#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_~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_~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_~cond~0#1; 26#L169-1true [2024-11-09 15:32:21,830 INFO L747 eck$LassoCheckResult]: Loop: 26#L169-1true assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true 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; 41#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 42#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 23#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 28#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 36#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 37#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 26#L169-1true [2024-11-09 15:32:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:32:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:21,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056814768] [2024-11-09 15:32:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:21,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:21,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:21,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2024-11-09 15:32:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358907737] [2024-11-09 15:32:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,020 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:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358907737] [2024-11-09 15:32:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358907737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92038378] [2024-11-09 15:32:22,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,030 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,076 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,121 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2024-11-09 15:32:22,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 141 transitions. [2024-11-09 15:32:22,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2024-11-09 15:32:22,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 71 states and 113 transitions. [2024-11-09 15:32:22,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-09 15:32:22,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-11-09 15:32:22,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2024-11-09 15:32:22,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2024-11-09 15:32:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2024-11-09 15:32:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 15:32:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2024-11-09 15:32:22,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2024-11-09 15:32:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2024-11-09 15:32:22,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:32:22,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2024-11-09 15:32:22,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2024-11-09 15:32:22,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,171 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] [2024-11-09 15:32:22,172 INFO L745 eck$LassoCheckResult]: Stem: 168#$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); 144#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_~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_~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_~cond~0#1; 145#L169-1 [2024-11-09 15:32:22,172 INFO L747 eck$LassoCheckResult]: Loop: 145#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 176#L46 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; 175#L73 assume !(0 != main_~p1~0#1); 170#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 164#L77-1 assume !(0 != main_~p3~0#1); 134#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 135#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 157#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 148#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 149#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 160#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 174#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 173#L109-1 assume !(0 != main_~p11~0#1); 171#L113-1 assume !(0 != main_~p1~0#1); 172#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 193#L129-1 assume !(0 != main_~p4~0#1); 190#L134-1 assume !(0 != main_~p5~0#1); 188#L139-1 assume !(0 != main_~p6~0#1); 186#L144-1 assume !(0 != main_~p7~0#1); 184#L149-1 assume !(0 != main_~p8~0#1); 182#L154-1 assume !(0 != main_~p9~0#1); 180#L159-1 assume !(0 != main_~p10~0#1); 178#L164-1 assume !(0 != main_~p11~0#1); 145#L169-1 [2024-11-09 15:32:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,173 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:32:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309874072] [2024-11-09 15:32:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2024-11-09 15:32:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942880723] [2024-11-09 15:32:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,311 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:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942880723] [2024-11-09 15:32:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942880723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602435524] [2024-11-09 15:32:22,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,312 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,313 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,326 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2024-11-09 15:32:22,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2024-11-09 15:32:22,330 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2024-11-09 15:32:22,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2024-11-09 15:32:22,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2024-11-09 15:32:22,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2024-11-09 15:32:22,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2024-11-09 15:32:22,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2024-11-09 15:32:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2024-11-09 15:32:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 15:32:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2024-11-09 15:32:22,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2024-11-09 15:32:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,341 INFO L425 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2024-11-09 15:32:22,342 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:32:22,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2024-11-09 15:32:22,343 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2024-11-09 15:32:22,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,344 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] [2024-11-09 15:32:22,344 INFO L745 eck$LassoCheckResult]: Stem: 387#$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); 359#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_~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_~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_~cond~0#1; 360#L169-1 [2024-11-09 15:32:22,344 INFO L747 eck$LassoCheckResult]: Loop: 360#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 402#L46 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; 403#L73 assume !(0 != main_~p1~0#1); 404#L73-2 assume !(0 != main_~p2~0#1); 481#L77-1 assume !(0 != main_~p3~0#1); 479#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 477#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 473#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 469#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 467#L109-1 assume !(0 != main_~p11~0#1); 465#L113-1 assume !(0 != main_~p1~0#1); 466#L119-1 assume !(0 != main_~p2~0#1); 356#L124-1 assume !(0 != main_~p3~0#1); 357#L129-1 assume !(0 != main_~p4~0#1); 352#L134-1 assume !(0 != main_~p5~0#1); 361#L139-1 assume !(0 != main_~p6~0#1); 346#L144-1 assume !(0 != main_~p7~0#1); 348#L149-1 assume !(0 != main_~p8~0#1); 370#L154-1 assume !(0 != main_~p9~0#1); 371#L159-1 assume !(0 != main_~p10~0#1); 411#L164-1 assume !(0 != main_~p11~0#1); 360#L169-1 [2024-11-09 15:32:22,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:32:22,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015108764] [2024-11-09 15:32:22,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2024-11-09 15:32:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085232794] [2024-11-09 15:32:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,383 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:22,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085232794] [2024-11-09 15:32:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085232794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50865404] [2024-11-09 15:32:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,385 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,386 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,399 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2024-11-09 15:32:22,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2024-11-09 15:32:22,401 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2024-11-09 15:32:22,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2024-11-09 15:32:22,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2024-11-09 15:32:22,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2024-11-09 15:32:22,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2024-11-09 15:32:22,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2024-11-09 15:32:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2024-11-09 15:32:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-09 15:32:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2024-11-09 15:32:22,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2024-11-09 15:32:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2024-11-09 15:32:22,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:32:22,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2024-11-09 15:32:22,419 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2024-11-09 15:32:22,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,420 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] [2024-11-09 15:32:22,420 INFO L745 eck$LassoCheckResult]: Stem: 805#$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); 773#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_~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_~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_~cond~0#1; 774#L169-1 [2024-11-09 15:32:22,420 INFO L747 eck$LassoCheckResult]: Loop: 774#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 859#L46 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; 853#L73 assume !(0 != main_~p1~0#1); 847#L73-2 assume !(0 != main_~p2~0#1); 848#L77-1 assume !(0 != main_~p3~0#1); 928#L81-1 assume !(0 != main_~p4~0#1); 926#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 923#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 834#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 835#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 830#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 803#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 794#L109-1 assume !(0 != main_~p11~0#1); 795#L113-1 assume !(0 != main_~p1~0#1); 905#L119-1 assume !(0 != main_~p2~0#1); 906#L124-1 assume !(0 != main_~p3~0#1); 947#L129-1 assume !(0 != main_~p4~0#1); 946#L134-1 assume !(0 != main_~p5~0#1); 944#L139-1 assume !(0 != main_~p6~0#1); 942#L144-1 assume !(0 != main_~p7~0#1); 940#L149-1 assume !(0 != main_~p8~0#1); 938#L154-1 assume !(0 != main_~p9~0#1); 936#L159-1 assume !(0 != main_~p10~0#1); 867#L164-1 assume !(0 != main_~p11~0#1); 774#L169-1 [2024-11-09 15:32:22,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:32:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326041820] [2024-11-09 15:32:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2024-11-09 15:32:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260645497] [2024-11-09 15:32:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,483 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:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260645497] [2024-11-09 15:32:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260645497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974843354] [2024-11-09 15:32:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,485 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,486 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,516 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2024-11-09 15:32:22,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2024-11-09 15:32:22,519 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2024-11-09 15:32:22,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2024-11-09 15:32:22,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2024-11-09 15:32:22,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2024-11-09 15:32:22,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2024-11-09 15:32:22,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2024-11-09 15:32:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2024-11-09 15:32:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-11-09 15:32:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2024-11-09 15:32:22,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2024-11-09 15:32:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,545 INFO L425 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2024-11-09 15:32:22,545 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:32:22,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2024-11-09 15:32:22,548 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2024-11-09 15:32:22,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,548 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] [2024-11-09 15:32:22,549 INFO L745 eck$LassoCheckResult]: Stem: 1611#$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); 1579#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_~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_~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_~cond~0#1; 1580#L169-1 [2024-11-09 15:32:22,549 INFO L747 eck$LassoCheckResult]: Loop: 1580#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1703#L46 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; 1696#L73 assume !(0 != main_~p1~0#1); 1688#L73-2 assume !(0 != main_~p2~0#1); 1690#L77-1 assume !(0 != main_~p3~0#1); 1668#L81-1 assume !(0 != main_~p4~0#1); 1670#L85-1 assume !(0 != main_~p5~0#1); 1811#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1857#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1856#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1855#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1854#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1853#L109-1 assume !(0 != main_~p11~0#1); 1852#L113-1 assume !(0 != main_~p1~0#1); 1851#L119-1 assume !(0 != main_~p2~0#1); 1850#L124-1 assume !(0 != main_~p3~0#1); 1844#L129-1 assume !(0 != main_~p4~0#1); 1839#L134-1 assume !(0 != main_~p5~0#1); 1840#L139-1 assume !(0 != main_~p6~0#1); 1847#L144-1 assume !(0 != main_~p7~0#1); 1832#L149-1 assume !(0 != main_~p8~0#1); 1774#L154-1 assume !(0 != main_~p9~0#1); 1773#L159-1 assume !(0 != main_~p10~0#1); 1715#L164-1 assume !(0 != main_~p11~0#1); 1580#L169-1 [2024-11-09 15:32:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-09 15:32:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16367038] [2024-11-09 15:32:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2024-11-09 15:32:22,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879725911] [2024-11-09 15:32:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,580 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:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879725911] [2024-11-09 15:32:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879725911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294175992] [2024-11-09 15:32:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,582 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,583 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,596 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2024-11-09 15:32:22,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2024-11-09 15:32:22,602 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2024-11-09 15:32:22,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2024-11-09 15:32:22,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2024-11-09 15:32:22,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2024-11-09 15:32:22,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2024-11-09 15:32:22,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2024-11-09 15:32:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2024-11-09 15:32:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2024-11-09 15:32:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2024-11-09 15:32:22,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2024-11-09 15:32:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,627 INFO L425 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2024-11-09 15:32:22,627 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:32:22,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2024-11-09 15:32:22,631 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2024-11-09 15:32:22,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,632 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] [2024-11-09 15:32:22,632 INFO L745 eck$LassoCheckResult]: Stem: 3187#$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); 3157#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_~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_~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_~cond~0#1; 3158#L169-1 [2024-11-09 15:32:22,632 INFO L747 eck$LassoCheckResult]: Loop: 3158#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3278#L46 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; 3274#L73 assume !(0 != main_~p1~0#1); 3270#L73-2 assume !(0 != main_~p2~0#1); 3268#L77-1 assume !(0 != main_~p3~0#1); 3239#L81-1 assume !(0 != main_~p4~0#1); 3237#L85-1 assume !(0 != main_~p5~0#1); 3238#L89-1 assume !(0 != main_~p6~0#1); 3375#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3371#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3368#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3363#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3362#L109-1 assume !(0 != main_~p11~0#1); 3329#L113-1 assume !(0 != main_~p1~0#1); 3325#L119-1 assume !(0 != main_~p2~0#1); 3324#L124-1 assume !(0 != main_~p3~0#1); 3321#L129-1 assume !(0 != main_~p4~0#1); 3319#L134-1 assume !(0 != main_~p5~0#1); 3317#L139-1 assume !(0 != main_~p6~0#1); 3316#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3312#L154-1 assume !(0 != main_~p9~0#1); 3310#L159-1 assume !(0 != main_~p10~0#1); 3282#L164-1 assume !(0 != main_~p11~0#1); 3158#L169-1 [2024-11-09 15:32:22,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-09 15:32:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682038488] [2024-11-09 15:32:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2024-11-09 15:32:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669297648] [2024-11-09 15:32:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,665 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:22,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669297648] [2024-11-09 15:32:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669297648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185808752] [2024-11-09 15:32:22,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,666 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,667 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,685 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2024-11-09 15:32:22,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2024-11-09 15:32:22,701 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2024-11-09 15:32:22,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2024-11-09 15:32:22,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2024-11-09 15:32:22,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2024-11-09 15:32:22,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2024-11-09 15:32:22,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2024-11-09 15:32:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2024-11-09 15:32:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2024-11-09 15:32:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2024-11-09 15:32:22,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2024-11-09 15:32:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,743 INFO L425 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2024-11-09 15:32:22,743 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:32:22,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2024-11-09 15:32:22,751 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2024-11-09 15:32:22,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,753 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] [2024-11-09 15:32:22,753 INFO L745 eck$LassoCheckResult]: Stem: 6284#$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); 6254#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_~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_~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_~cond~0#1; 6255#L169-1 [2024-11-09 15:32:22,753 INFO L747 eck$LassoCheckResult]: Loop: 6255#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6353#L46 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; 6351#L73 assume !(0 != main_~p1~0#1); 6347#L73-2 assume !(0 != main_~p2~0#1); 6345#L77-1 assume !(0 != main_~p3~0#1); 6341#L81-1 assume !(0 != main_~p4~0#1); 6337#L85-1 assume !(0 != main_~p5~0#1); 6333#L89-1 assume !(0 != main_~p6~0#1); 6329#L93-1 assume !(0 != main_~p7~0#1); 6327#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6325#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6323#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6321#L109-1 assume !(0 != main_~p11~0#1); 6318#L113-1 assume !(0 != main_~p1~0#1); 6319#L119-1 assume !(0 != main_~p2~0#1); 6389#L124-1 assume !(0 != main_~p3~0#1); 6384#L129-1 assume !(0 != main_~p4~0#1); 6380#L134-1 assume !(0 != main_~p5~0#1); 6376#L139-1 assume !(0 != main_~p6~0#1); 6372#L144-1 assume !(0 != main_~p7~0#1); 6369#L149-1 assume !(0 != main_~p8~0#1); 6365#L154-1 assume !(0 != main_~p9~0#1); 6361#L159-1 assume !(0 != main_~p10~0#1); 6357#L164-1 assume !(0 != main_~p11~0#1); 6255#L169-1 [2024-11-09 15:32:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-09 15:32:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785551457] [2024-11-09 15:32:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2024-11-09 15:32:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801940631] [2024-11-09 15:32:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,782 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:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801940631] [2024-11-09 15:32:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801940631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627531216] [2024-11-09 15:32:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,784 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,785 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:22,809 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2024-11-09 15:32:22,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2024-11-09 15:32:22,832 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2024-11-09 15:32:22,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2024-11-09 15:32:22,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2024-11-09 15:32:22,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2024-11-09 15:32:22,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2024-11-09 15:32:22,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:22,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2024-11-09 15:32:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2024-11-09 15:32:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2024-11-09 15:32:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2024-11-09 15:32:22,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2024-11-09 15:32:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:22,918 INFO L425 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2024-11-09 15:32:22,918 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:32:22,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2024-11-09 15:32:22,930 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2024-11-09 15:32:22,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:22,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:22,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:22,931 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] [2024-11-09 15:32:22,931 INFO L745 eck$LassoCheckResult]: Stem: 12378#$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); 12344#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_~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_~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_~cond~0#1; 12345#L169-1 [2024-11-09 15:32:22,931 INFO L747 eck$LassoCheckResult]: Loop: 12345#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12485#L46 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; 12481#L73 assume !(0 != main_~p1~0#1); 12474#L73-2 assume !(0 != main_~p2~0#1); 12469#L77-1 assume !(0 != main_~p3~0#1); 12462#L81-1 assume !(0 != main_~p4~0#1); 12454#L85-1 assume !(0 != main_~p5~0#1); 12446#L89-1 assume !(0 != main_~p6~0#1); 12438#L93-1 assume !(0 != main_~p7~0#1); 12432#L97-1 assume !(0 != main_~p8~0#1); 12427#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12424#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12420#L109-1 assume !(0 != main_~p11~0#1); 12421#L113-1 assume !(0 != main_~p1~0#1); 12410#L119-1 assume !(0 != main_~p2~0#1); 12412#L124-1 assume !(0 != main_~p3~0#1); 12562#L129-1 assume !(0 != main_~p4~0#1); 12560#L134-1 assume !(0 != main_~p5~0#1); 12550#L139-1 assume !(0 != main_~p6~0#1); 12546#L144-1 assume !(0 != main_~p7~0#1); 12543#L149-1 assume !(0 != main_~p8~0#1); 12539#L154-1 assume !(0 != main_~p9~0#1); 12508#L159-1 assume !(0 != main_~p10~0#1); 12494#L164-1 assume !(0 != main_~p11~0#1); 12345#L169-1 [2024-11-09 15:32:22,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-09 15:32:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113772822] [2024-11-09 15:32:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:22,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2024-11-09 15:32:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267578033] [2024-11-09 15:32:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:22,970 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:22,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267578033] [2024-11-09 15:32:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267578033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:22,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:22,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193721590] [2024-11-09 15:32:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:22,971 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:22,972 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,020 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2024-11-09 15:32:23,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2024-11-09 15:32:23,053 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2024-11-09 15:32:23,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2024-11-09 15:32:23,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2024-11-09 15:32:23,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2024-11-09 15:32:23,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2024-11-09 15:32:23,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2024-11-09 15:32:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2024-11-09 15:32:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2024-11-09 15:32:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2024-11-09 15:32:23,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2024-11-09 15:32:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2024-11-09 15:32:23,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:32:23,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2024-11-09 15:32:23,231 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2024-11-09 15:32:23,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,233 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] [2024-11-09 15:32:23,233 INFO L745 eck$LassoCheckResult]: Stem: 24362#$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); 24322#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_~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_~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_~cond~0#1; 24323#L169-1 [2024-11-09 15:32:23,233 INFO L747 eck$LassoCheckResult]: Loop: 24323#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24513#L46 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; 24498#L73 assume !(0 != main_~p1~0#1); 24500#L73-2 assume !(0 != main_~p2~0#1); 24477#L77-1 assume !(0 != main_~p3~0#1); 24478#L81-1 assume !(0 != main_~p4~0#1); 24454#L85-1 assume !(0 != main_~p5~0#1); 24456#L89-1 assume !(0 != main_~p6~0#1); 24430#L93-1 assume !(0 != main_~p7~0#1); 24432#L97-1 assume !(0 != main_~p8~0#1); 24568#L101-1 assume !(0 != main_~p9~0#1); 24567#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24566#L109-1 assume !(0 != main_~p11~0#1); 24564#L113-1 assume !(0 != main_~p1~0#1); 24560#L119-1 assume !(0 != main_~p2~0#1); 24557#L124-1 assume !(0 != main_~p3~0#1); 24552#L129-1 assume !(0 != main_~p4~0#1); 24548#L134-1 assume !(0 != main_~p5~0#1); 24544#L139-1 assume !(0 != main_~p6~0#1); 24540#L144-1 assume !(0 != main_~p7~0#1); 24537#L149-1 assume !(0 != main_~p8~0#1); 24538#L154-1 assume !(0 != main_~p9~0#1); 24529#L159-1 assume !(0 != main_~p10~0#1); 24528#L164-1 assume !(0 != main_~p11~0#1); 24323#L169-1 [2024-11-09 15:32:23,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-09 15:32:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397618950] [2024-11-09 15:32:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2024-11-09 15:32:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952285703] [2024-11-09 15:32:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:23,269 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,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:23,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952285703] [2024-11-09 15:32:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952285703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600453734] [2024-11-09 15:32:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:23,271 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:23,272 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:23,310 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2024-11-09 15:32:23,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2024-11-09 15:32:23,369 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2024-11-09 15:32:23,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2024-11-09 15:32:23,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2024-11-09 15:32:23,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2024-11-09 15:32:23,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2024-11-09 15:32:23,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:23,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2024-11-09 15:32:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2024-11-09 15:32:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2024-11-09 15:32:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2024-11-09 15:32:23,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2024-11-09 15:32:23,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:23,775 INFO L425 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2024-11-09 15:32:23,775 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:32:23,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2024-11-09 15:32:23,814 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2024-11-09 15:32:23,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,816 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] [2024-11-09 15:32:23,816 INFO L745 eck$LassoCheckResult]: Stem: 47922#$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); 47883#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_~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_~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_~cond~0#1; 47884#L169-1 [2024-11-09 15:32:23,817 INFO L747 eck$LassoCheckResult]: Loop: 47884#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48302#L46 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; 48299#L73 assume !(0 != main_~p1~0#1); 48295#L73-2 assume !(0 != main_~p2~0#1); 48292#L77-1 assume !(0 != main_~p3~0#1); 48289#L81-1 assume !(0 != main_~p4~0#1); 48285#L85-1 assume !(0 != main_~p5~0#1); 48280#L89-1 assume !(0 != main_~p6~0#1); 48276#L93-1 assume !(0 != main_~p7~0#1); 48272#L97-1 assume !(0 != main_~p8~0#1); 48268#L101-1 assume !(0 != main_~p9~0#1); 48269#L105-1 assume !(0 != main_~p10~0#1); 48277#L109-1 assume !(0 != main_~p11~0#1); 48274#L113-1 assume !(0 != main_~p1~0#1); 48270#L119-1 assume !(0 != main_~p2~0#1); 48266#L124-1 assume !(0 != main_~p3~0#1); 48261#L129-1 assume !(0 != main_~p4~0#1); 48258#L134-1 assume !(0 != main_~p5~0#1); 48224#L139-1 assume !(0 != main_~p6~0#1); 48211#L144-1 assume !(0 != main_~p7~0#1); 48209#L149-1 assume !(0 != main_~p8~0#1); 48205#L154-1 assume !(0 != main_~p9~0#1); 48206#L159-1 assume !(0 != main_~p10~0#1); 48307#L164-1 assume !(0 != main_~p11~0#1); 47884#L169-1 [2024-11-09 15:32:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-09 15:32:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524066073] [2024-11-09 15:32:23,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2024-11-09 15:32:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105999697] [2024-11-09 15:32:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:23,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2024-11-09 15:32:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596267780] [2024-11-09 15:32:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:23,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:32:24 BoogieIcfgContainer [2024-11-09 15:32:24,266 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:32:24,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:32:24,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:32:24,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:32:24,267 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:21" (3/4) ... [2024-11-09 15:32:24,268 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:32:24,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:32:24,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:32:24,294 INFO L158 Benchmark]: Toolchain (without parser) took 3121.77ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 135.1MB in the beginning and 295.7MB in the end (delta: -160.6MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,294 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:24,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.75ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 122.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.24ms. Allocated memory is still 184.5MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,295 INFO L158 Benchmark]: Boogie Preprocessor took 22.48ms. Allocated memory is still 184.5MB. Free memory was 120.0MB in the beginning and 118.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,295 INFO L158 Benchmark]: RCFGBuilder took 348.58ms. Allocated memory is still 184.5MB. Free memory was 117.9MB in the beginning and 103.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,295 INFO L158 Benchmark]: BuchiAutomizer took 2511.90ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 102.8MB in the beginning and 297.8MB in the end (delta: -195.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,295 INFO L158 Benchmark]: Witness Printer took 27.46ms. Allocated memory is still 436.2MB. Free memory was 297.8MB in the beginning and 295.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:24,296 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.75ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 122.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.24ms. Allocated memory is still 184.5MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.48ms. Allocated memory is still 184.5MB. Free memory was 120.0MB in the beginning and 118.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.58ms. Allocated memory is still 184.5MB. Free memory was 117.9MB in the beginning and 103.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2511.90ms. Allocated memory was 184.5MB in the beginning and 436.2MB in the end (delta: 251.7MB). Free memory was 102.8MB in the beginning and 297.8MB in the end (delta: -195.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 27.46ms. Allocated memory is still 436.2MB. Free memory was 297.8MB in the beginning and 295.7MB 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 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 795 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 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: 44]: 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; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: 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; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:32:24,318 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)