./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:45:47,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:45:47,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:45:47,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:45:47,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:45:47,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:45:47,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:45:47,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:45:47,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:45:47,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:45:47,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:45:47,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:45:47,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:45:47,482 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:45:47,484 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:45:47,484 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:45:47,484 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:45:47,484 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:45:47,485 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:45:47,485 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:45:47,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:45:47,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:45:47,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:45:47,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:45:47,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:45:47,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:45:47,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:45:47,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:45:47,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:45:47,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:45:47,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:45:47,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:45:47,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:45:47,492 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:45:47,492 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:45:47,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:45:47,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:45:47,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:45:47,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:45:47,494 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:45:47,495 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2024-11-10 22:45:47,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:45:47,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:45:47,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:45:47,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:45:47,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:45:47,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2024-11-10 22:45:49,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:45:49,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:45:49,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-10 22:45:49,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08efc2690/c32c4b6ffd124b5db446c156288fb1c0/FLAG155831068 [2024-11-10 22:45:49,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08efc2690/c32c4b6ffd124b5db446c156288fb1c0 [2024-11-10 22:45:49,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:45:49,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:45:49,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:49,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:45:49,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:45:49,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54208d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49, skipping insertion in model container [2024-11-10 22:45:49,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:45:49,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:49,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:45:49,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:49,781 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:45:49,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49 WrapperNode [2024-11-10 22:45:49,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:49,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:49,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:45:49,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:45:49,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,818 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 115 [2024-11-10 22:45:49,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:49,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:45:49,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:45:49,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:45:49,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,841 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-10 22:45:49,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:45:49,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:45:49,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:45:49,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:45:49,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (1/1) ... [2024-11-10 22:45:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:49,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:49,899 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-10 22:45:49,904 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-10 22:45:49,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:45:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:45:49,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:45:49,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:45:50,009 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:45:50,011 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:45:50,191 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 22:45:50,191 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:45:50,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:45:50,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:45:50,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:50 BoogieIcfgContainer [2024-11-10 22:45:50,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:45:50,205 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:45:50,205 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:45:50,209 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:45:50,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:50,209 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:45:49" (1/3) ... [2024-11-10 22:45:50,210 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1331adb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:50, skipping insertion in model container [2024-11-10 22:45:50,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:50,211 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:49" (2/3) ... [2024-11-10 22:45:50,211 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1331adb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:50, skipping insertion in model container [2024-11-10 22:45:50,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:50,211 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:50" (3/3) ... [2024-11-10 22:45:50,212 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2024-11-10 22:45:50,258 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:45:50,258 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:45:50,258 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:45:50,258 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:45:50,258 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:45:50,258 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:45:50,258 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:45:50,259 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:45:50,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-10 22:45:50,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:50,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:50,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:50,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:50,285 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:45:50,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2024-11-10 22:45:50,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:50,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:50,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:50,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:50,294 INFO L745 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 31#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 18#L35true [2024-11-10 22:45:50,295 INFO L747 eck$LassoCheckResult]: Loop: 18#L35true assume true; 11#L35-1true assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 29#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 8#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 32#L62true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 5#L66true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 35#L70true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L74true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 27#L78true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 28#L82true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3#L86true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 12#L92true assume !(0 != main_~p1~0#1); 9#L97true assume !(0 != main_~p2~0#1); 14#L102true assume !(0 != main_~p3~0#1); 30#L107true assume !(0 != main_~p4~0#1); 22#L112true assume !(0 != main_~p5~0#1); 7#L117true assume !(0 != main_~p6~0#1); 17#L122true assume !(0 != main_~p7~0#1); 26#L127true assume !(0 != main_~p8~0#1); 18#L35true [2024-11-10 22:45:50,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 1 times [2024-11-10 22:45:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904967608] [2024-11-10 22:45:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -5806578, now seen corresponding path program 1 times [2024-11-10 22:45:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556326685] [2024-11-10 22:45:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:50,513 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-10 22:45:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:50,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556326685] [2024-11-10 22:45:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556326685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522318733] [2024-11-10 22:45:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:50,519 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:50,546 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:50,575 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2024-11-10 22:45:50,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 107 transitions. [2024-11-10 22:45:50,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2024-11-10 22:45:50,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2024-11-10 22:45:50,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-10 22:45:50,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-10 22:45:50,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2024-11-10 22:45:50,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:50,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-10 22:45:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2024-11-10 22:45:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 22:45:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 54 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-11-10 22:45:50,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-10 22:45:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:50,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-11-10 22:45:50,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:45:50,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 85 transitions. [2024-11-10 22:45:50,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2024-11-10 22:45:50,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:50,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:50,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:50,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:50,619 INFO L745 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 133#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 136#L35 [2024-11-10 22:45:50,619 INFO L747 eck$LassoCheckResult]: Loop: 136#L35 assume true; 140#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 139#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 137#L58 assume !(0 != main_~p1~0#1); 138#L62 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 161#L66 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 159#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 156#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 153#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 152#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 149#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 145#L92 assume !(0 != main_~p1~0#1); 146#L97 assume !(0 != main_~p2~0#1); 158#L102 assume !(0 != main_~p3~0#1); 155#L107 assume !(0 != main_~p4~0#1); 150#L112 assume !(0 != main_~p5~0#1); 148#L117 assume !(0 != main_~p6~0#1); 144#L122 assume !(0 != main_~p7~0#1); 142#L127 assume !(0 != main_~p8~0#1); 136#L35 [2024-11-10 22:45:50,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 2 times [2024-11-10 22:45:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518170923] [2024-11-10 22:45:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:50,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -516340755, now seen corresponding path program 1 times [2024-11-10 22:45:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428500519] [2024-11-10 22:45:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:50,702 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-10 22:45:50,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428500519] [2024-11-10 22:45:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428500519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777172736] [2024-11-10 22:45:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:50,707 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:50,708 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:50,729 INFO L93 Difference]: Finished difference Result 106 states and 162 transitions. [2024-11-10 22:45:50,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 162 transitions. [2024-11-10 22:45:50,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2024-11-10 22:45:50,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 162 transitions. [2024-11-10 22:45:50,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2024-11-10 22:45:50,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2024-11-10 22:45:50,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 162 transitions. [2024-11-10 22:45:50,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:50,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-10 22:45:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 162 transitions. [2024-11-10 22:45:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 22:45:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.528301886792453) internal successors, (162), 105 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-10 22:45:50,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-10 22:45:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:50,753 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-10 22:45:50,754 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:45:50,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 162 transitions. [2024-11-10 22:45:50,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2024-11-10 22:45:50,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:50,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:50,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:50,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:50,761 INFO L745 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 302#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 307#L35 [2024-11-10 22:45:50,761 INFO L747 eck$LassoCheckResult]: Loop: 307#L35 assume true; 328#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 327#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 325#L58 assume !(0 != main_~p1~0#1); 323#L62 assume !(0 != main_~p2~0#1); 324#L66 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 318#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 319#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 314#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 315#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 310#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 311#L92 assume !(0 != main_~p1~0#1); 341#L97 assume !(0 != main_~p2~0#1); 340#L102 assume !(0 != main_~p3~0#1); 338#L107 assume !(0 != main_~p4~0#1); 335#L112 assume !(0 != main_~p5~0#1); 334#L117 assume !(0 != main_~p6~0#1); 332#L122 assume !(0 != main_~p7~0#1); 330#L127 assume !(0 != main_~p8~0#1); 307#L35 [2024-11-10 22:45:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 3 times [2024-11-10 22:45:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570001028] [2024-11-10 22:45:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash 991211054, now seen corresponding path program 1 times [2024-11-10 22:45:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712955750] [2024-11-10 22:45:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:50,838 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-10 22:45:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712955750] [2024-11-10 22:45:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712955750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318507201] [2024-11-10 22:45:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:50,840 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:50,841 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:50,865 INFO L93 Difference]: Finished difference Result 206 states and 310 transitions. [2024-11-10 22:45:50,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 310 transitions. [2024-11-10 22:45:50,871 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2024-11-10 22:45:50,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 206 states and 310 transitions. [2024-11-10 22:45:50,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2024-11-10 22:45:50,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2024-11-10 22:45:50,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 310 transitions. [2024-11-10 22:45:50,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:50,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-10 22:45:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 310 transitions. [2024-11-10 22:45:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-10 22:45:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.5048543689320388) internal successors, (310), 205 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2024-11-10 22:45:50,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-10 22:45:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:50,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 206 states and 310 transitions. [2024-11-10 22:45:50,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:45:50,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 310 transitions. [2024-11-10 22:45:50,913 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 204 [2024-11-10 22:45:50,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:50,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:50,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:50,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:50,915 INFO L745 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 621#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 625#L35 [2024-11-10 22:45:50,915 INFO L747 eck$LassoCheckResult]: Loop: 625#L35 assume true; 659#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 657#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 655#L58 assume !(0 != main_~p1~0#1); 651#L62 assume !(0 != main_~p2~0#1); 648#L66 assume !(0 != main_~p3~0#1); 646#L70 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 644#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 642#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 640#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 638#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 636#L92 assume !(0 != main_~p1~0#1); 632#L97 assume !(0 != main_~p2~0#1); 633#L102 assume !(0 != main_~p3~0#1); 679#L107 assume !(0 != main_~p4~0#1); 674#L112 assume !(0 != main_~p5~0#1); 671#L117 assume !(0 != main_~p6~0#1); 667#L122 assume !(0 != main_~p7~0#1); 663#L127 assume !(0 != main_~p8~0#1); 625#L35 [2024-11-10 22:45:50,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 4 times [2024-11-10 22:45:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579473919] [2024-11-10 22:45:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:50,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:50,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash 485652429, now seen corresponding path program 1 times [2024-11-10 22:45:50,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100699266] [2024-11-10 22:45:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:50,983 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-10 22:45:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100699266] [2024-11-10 22:45:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100699266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516736262] [2024-11-10 22:45:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:50,985 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:50,986 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:51,012 INFO L93 Difference]: Finished difference Result 402 states and 594 transitions. [2024-11-10 22:45:51,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 402 states and 594 transitions. [2024-11-10 22:45:51,020 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2024-11-10 22:45:51,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 402 states to 402 states and 594 transitions. [2024-11-10 22:45:51,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2024-11-10 22:45:51,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2024-11-10 22:45:51,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 594 transitions. [2024-11-10 22:45:51,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:51,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-10 22:45:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 594 transitions. [2024-11-10 22:45:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-10 22:45:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 1.4776119402985075) internal successors, (594), 401 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 594 transitions. [2024-11-10 22:45:51,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-10 22:45:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:51,059 INFO L425 stractBuchiCegarLoop]: Abstraction has 402 states and 594 transitions. [2024-11-10 22:45:51,059 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:45:51,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 594 transitions. [2024-11-10 22:45:51,063 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 400 [2024-11-10 22:45:51,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:51,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:51,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:51,065 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:51,065 INFO L745 eck$LassoCheckResult]: Stem: 1234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1235#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1242#L35 [2024-11-10 22:45:51,065 INFO L747 eck$LassoCheckResult]: Loop: 1242#L35 assume true; 1287#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1285#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1283#L58 assume !(0 != main_~p1~0#1); 1279#L62 assume !(0 != main_~p2~0#1); 1275#L66 assume !(0 != main_~p3~0#1); 1271#L70 assume !(0 != main_~p4~0#1); 1269#L74 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1267#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1265#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1263#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1260#L92 assume !(0 != main_~p1~0#1); 1261#L97 assume !(0 != main_~p2~0#1); 1308#L102 assume !(0 != main_~p3~0#1); 1306#L107 assume !(0 != main_~p4~0#1); 1302#L112 assume !(0 != main_~p5~0#1); 1299#L117 assume !(0 != main_~p6~0#1); 1295#L122 assume !(0 != main_~p7~0#1); 1291#L127 assume !(0 != main_~p8~0#1); 1242#L35 [2024-11-10 22:45:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 5 times [2024-11-10 22:45:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784752440] [2024-11-10 22:45:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 192249422, now seen corresponding path program 1 times [2024-11-10 22:45:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844677299] [2024-11-10 22:45:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:51,146 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-10 22:45:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844677299] [2024-11-10 22:45:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844677299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438322987] [2024-11-10 22:45:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:51,160 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:51,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:51,161 INFO L87 Difference]: Start difference. First operand 402 states and 594 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:51,179 INFO L93 Difference]: Finished difference Result 786 states and 1138 transitions. [2024-11-10 22:45:51,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 1138 transitions. [2024-11-10 22:45:51,187 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2024-11-10 22:45:51,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 786 states and 1138 transitions. [2024-11-10 22:45:51,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2024-11-10 22:45:51,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2024-11-10 22:45:51,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 1138 transitions. [2024-11-10 22:45:51,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:51,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-10 22:45:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 1138 transitions. [2024-11-10 22:45:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2024-11-10 22:45:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 786 states have (on average 1.4478371501272265) internal successors, (1138), 785 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1138 transitions. [2024-11-10 22:45:51,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-10 22:45:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:51,230 INFO L425 stractBuchiCegarLoop]: Abstraction has 786 states and 1138 transitions. [2024-11-10 22:45:51,230 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:51,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 786 states and 1138 transitions. [2024-11-10 22:45:51,235 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 784 [2024-11-10 22:45:51,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:51,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:51,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:51,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:51,237 INFO L745 eck$LassoCheckResult]: Stem: 2430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2431#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2440#L35 [2024-11-10 22:45:51,237 INFO L747 eck$LassoCheckResult]: Loop: 2440#L35 assume true; 2579#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2578#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2577#L58 assume !(0 != main_~p1~0#1); 2576#L62 assume !(0 != main_~p2~0#1); 2573#L66 assume !(0 != main_~p3~0#1); 2567#L70 assume !(0 != main_~p4~0#1); 2569#L74 assume !(0 != main_~p5~0#1); 2558#L78 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2559#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2550#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2551#L92 assume !(0 != main_~p1~0#1); 2536#L97 assume !(0 != main_~p2~0#1); 2538#L102 assume !(0 != main_~p3~0#1); 2588#L107 assume !(0 != main_~p4~0#1); 2586#L112 assume !(0 != main_~p5~0#1); 2585#L117 assume !(0 != main_~p6~0#1); 2583#L122 assume !(0 != main_~p7~0#1); 2581#L127 assume !(0 != main_~p8~0#1); 2440#L35 [2024-11-10 22:45:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 6 times [2024-11-10 22:45:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497976983] [2024-11-10 22:45:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:51,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 321332141, now seen corresponding path program 1 times [2024-11-10 22:45:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350808852] [2024-11-10 22:45:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:51,302 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-10 22:45:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350808852] [2024-11-10 22:45:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350808852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995881285] [2024-11-10 22:45:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:51,305 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:51,308 INFO L87 Difference]: Start difference. First operand 786 states and 1138 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:51,332 INFO L93 Difference]: Finished difference Result 1538 states and 2178 transitions. [2024-11-10 22:45:51,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1538 states and 2178 transitions. [2024-11-10 22:45:51,354 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2024-11-10 22:45:51,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1538 states to 1538 states and 2178 transitions. [2024-11-10 22:45:51,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1538 [2024-11-10 22:45:51,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1538 [2024-11-10 22:45:51,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1538 states and 2178 transitions. [2024-11-10 22:45:51,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:51,368 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-10 22:45:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states and 2178 transitions. [2024-11-10 22:45:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2024-11-10 22:45:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1538 states have (on average 1.4161248374512354) internal successors, (2178), 1537 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2178 transitions. [2024-11-10 22:45:51,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-10 22:45:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:51,407 INFO L425 stractBuchiCegarLoop]: Abstraction has 1538 states and 2178 transitions. [2024-11-10 22:45:51,407 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:51,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1538 states and 2178 transitions. [2024-11-10 22:45:51,419 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1536 [2024-11-10 22:45:51,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:51,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:51,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:51,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] [2024-11-10 22:45:51,421 INFO L745 eck$LassoCheckResult]: Stem: 4760#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 4761#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4773#L35 [2024-11-10 22:45:51,421 INFO L747 eck$LassoCheckResult]: Loop: 4773#L35 assume true; 4920#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4919#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4917#L58 assume !(0 != main_~p1~0#1); 4915#L62 assume !(0 != main_~p2~0#1); 4912#L66 assume !(0 != main_~p3~0#1); 4906#L70 assume !(0 != main_~p4~0#1); 4908#L74 assume !(0 != main_~p5~0#1); 4896#L78 assume !(0 != main_~p6~0#1); 4898#L82 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4888#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4889#L92 assume !(0 != main_~p1~0#1); 4872#L97 assume !(0 != main_~p2~0#1); 4874#L102 assume !(0 != main_~p3~0#1); 4931#L107 assume !(0 != main_~p4~0#1); 4929#L112 assume !(0 != main_~p5~0#1); 4927#L117 assume !(0 != main_~p6~0#1); 4925#L122 assume !(0 != main_~p7~0#1); 4922#L127 assume !(0 != main_~p8~0#1); 4773#L35 [2024-11-10 22:45:51,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 7 times [2024-11-10 22:45:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555853392] [2024-11-10 22:45:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1475619218, now seen corresponding path program 1 times [2024-11-10 22:45:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335866864] [2024-11-10 22:45:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:51,469 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-10 22:45:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:51,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335866864] [2024-11-10 22:45:51,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335866864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:51,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:51,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887088166] [2024-11-10 22:45:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:51,471 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:51,472 INFO L87 Difference]: Start difference. First operand 1538 states and 2178 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:51,500 INFO L93 Difference]: Finished difference Result 3010 states and 4162 transitions. [2024-11-10 22:45:51,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3010 states and 4162 transitions. [2024-11-10 22:45:51,525 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2024-11-10 22:45:51,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3010 states to 3010 states and 4162 transitions. [2024-11-10 22:45:51,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3010 [2024-11-10 22:45:51,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3010 [2024-11-10 22:45:51,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3010 states and 4162 transitions. [2024-11-10 22:45:51,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:51,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-10 22:45:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states and 4162 transitions. [2024-11-10 22:45:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3010. [2024-11-10 22:45:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 3010 states have (on average 1.3827242524916943) internal successors, (4162), 3009 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4162 transitions. [2024-11-10 22:45:51,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-10 22:45:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:51,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 3010 states and 4162 transitions. [2024-11-10 22:45:51,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:45:51,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3010 states and 4162 transitions. [2024-11-10 22:45:51,630 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3008 [2024-11-10 22:45:51,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:51,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:51,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:51,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:51,632 INFO L745 eck$LassoCheckResult]: Stem: 9313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 9314#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 9324#L35 [2024-11-10 22:45:51,632 INFO L747 eck$LassoCheckResult]: Loop: 9324#L35 assume true; 9389#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9387#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9385#L58 assume !(0 != main_~p1~0#1); 9381#L62 assume !(0 != main_~p2~0#1); 9377#L66 assume !(0 != main_~p3~0#1); 9373#L70 assume !(0 != main_~p4~0#1); 9369#L74 assume !(0 != main_~p5~0#1); 9365#L78 assume !(0 != main_~p6~0#1); 9361#L82 assume !(0 != main_~p7~0#1); 9359#L86 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 9356#L92 assume !(0 != main_~p1~0#1); 9357#L97 assume !(0 != main_~p2~0#1); 9412#L102 assume !(0 != main_~p3~0#1); 9408#L107 assume !(0 != main_~p4~0#1); 9404#L112 assume !(0 != main_~p5~0#1); 9400#L117 assume !(0 != main_~p6~0#1); 9396#L122 assume !(0 != main_~p7~0#1); 9393#L127 assume !(0 != main_~p8~0#1); 9324#L35 [2024-11-10 22:45:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 8 times [2024-11-10 22:45:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541799995] [2024-11-10 22:45:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:51,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1672132723, now seen corresponding path program 1 times [2024-11-10 22:45:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670042323] [2024-11-10 22:45:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:51,682 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-10 22:45:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670042323] [2024-11-10 22:45:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670042323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:45:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952595068] [2024-11-10 22:45:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:51,687 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:51,687 INFO L87 Difference]: Start difference. First operand 3010 states and 4162 transitions. cyclomatic complexity: 1280 Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:51,747 INFO L93 Difference]: Finished difference Result 5890 states and 7938 transitions. [2024-11-10 22:45:51,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5890 states and 7938 transitions. [2024-11-10 22:45:51,832 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 5888 [2024-11-10 22:45:51,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5890 states to 5890 states and 7938 transitions. [2024-11-10 22:45:51,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5890 [2024-11-10 22:45:51,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5890 [2024-11-10 22:45:51,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5890 states and 7938 transitions. [2024-11-10 22:45:51,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:51,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-10 22:45:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states and 7938 transitions. [2024-11-10 22:45:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 5890. [2024-11-10 22:45:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5890 states, 5890 states have (on average 1.3477079796264855) internal successors, (7938), 5889 states have internal predecessors, (7938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 7938 transitions. [2024-11-10 22:45:51,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-10 22:45:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:51,974 INFO L425 stractBuchiCegarLoop]: Abstraction has 5890 states and 7938 transitions. [2024-11-10 22:45:51,974 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:45:51,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5890 states and 7938 transitions. [2024-11-10 22:45:51,999 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 5888 [2024-11-10 22:45:51,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:51,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:52,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:52,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:52,000 INFO L745 eck$LassoCheckResult]: Stem: 18219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 18220#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 18231#L35 [2024-11-10 22:45:52,001 INFO L747 eck$LassoCheckResult]: Loop: 18231#L35 assume true; 18375#L35-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 18374#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 18372#L58 assume !(0 != main_~p1~0#1); 18370#L62 assume !(0 != main_~p2~0#1); 18368#L66 assume !(0 != main_~p3~0#1); 18366#L70 assume !(0 != main_~p4~0#1); 18364#L74 assume !(0 != main_~p5~0#1); 18362#L78 assume !(0 != main_~p6~0#1); 18360#L82 assume !(0 != main_~p7~0#1); 18357#L86 assume !(0 != main_~p8~0#1); 18349#L92 assume !(0 != main_~p1~0#1); 18351#L97 assume !(0 != main_~p2~0#1); 18337#L102 assume !(0 != main_~p3~0#1); 18339#L107 assume !(0 != main_~p4~0#1); 18325#L112 assume !(0 != main_~p5~0#1); 18327#L117 assume !(0 != main_~p6~0#1); 18315#L122 assume !(0 != main_~p7~0#1); 18316#L127 assume !(0 != main_~p8~0#1); 18231#L35 [2024-11-10 22:45:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 3840, now seen corresponding path program 9 times [2024-11-10 22:45:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97915848] [2024-11-10 22:45:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 815380110, now seen corresponding path program 1 times [2024-11-10 22:45:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:52,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098231588] [2024-11-10 22:45:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash -997756625, now seen corresponding path program 1 times [2024-11-10 22:45:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485016471] [2024-11-10 22:45:52,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:52,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:52 BoogieIcfgContainer [2024-11-10 22:45:52,460 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:52,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:52,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:52,461 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:52,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:50" (3/4) ... [2024-11-10 22:45:52,463 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:45:52,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:45:52,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:52,501 INFO L158 Benchmark]: Toolchain (without parser) took 3040.75ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 103.7MB in the beginning and 57.9MB in the end (delta: 45.8MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,501 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:52,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.04ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 135.7MB in the end (delta: -32.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.90ms. Allocated memory is still 165.7MB. Free memory was 135.7MB in the beginning and 134.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:52,502 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 132.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,503 INFO L158 Benchmark]: IcfgBuilder took 348.43ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 118.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,506 INFO L158 Benchmark]: BuchiAutomizer took 2254.87ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 118.6MB in the beginning and 60.0MB in the end (delta: 58.6MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,507 INFO L158 Benchmark]: Witness Printer took 40.04ms. Allocated memory is still 199.2MB. Free memory was 60.0MB in the beginning and 57.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:52,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.04ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 135.7MB in the end (delta: -32.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.90ms. Allocated memory is still 165.7MB. Free memory was 135.7MB in the beginning and 134.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 132.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 348.43ms. Allocated memory is still 165.7MB. Free memory was 132.5MB in the beginning and 118.6MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2254.87ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 118.6MB in the beginning and 60.0MB in the end (delta: 58.6MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. * Witness Printer took 40.04ms. Allocated memory is still 199.2MB. Free memory was 60.0MB in the beginning and 57.9MB 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5890 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 860 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 538 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:45:52,532 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)