./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:27:05,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:27:05,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:27:05,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:27:05,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:27:05,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:27:05,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:27:05,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:27:05,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:27:05,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:27:05,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:27:05,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:27:05,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:27:05,953 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:27:05,954 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:27:05,954 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:27:05,957 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:27:05,957 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:27:05,957 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:27:05,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:27:05,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:27:05,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:27:05,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:27:05,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:27:05,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:27:05,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:27:05,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:27:05,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:27:05,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:27:05,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:27:05,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:27:05,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:27:05,961 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:27:05,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:27:05,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:27:05,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:27:05,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:27:05,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:27:05,963 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:27:05,963 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-19 14:27:06,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:27:06,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:27:06,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:27:06,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:27:06,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:27:06,288 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-19 14:27:07,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:27:07,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:27:07,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-11-19 14:27:07,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7167e5500/c47aef46fe954d62b69be667e4bbaf79/FLAGc741a2a98 [2024-11-19 14:27:07,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7167e5500/c47aef46fe954d62b69be667e4bbaf79 [2024-11-19 14:27:07,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:27:07,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:27:07,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:07,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:27:07,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:27:07,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:07" (1/1) ... [2024-11-19 14:27:07,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e212dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:07, skipping insertion in model container [2024-11-19 14:27:07,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:27:07" (1/1) ... [2024-11-19 14:27:07,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:27:08,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:08,145 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:27:08,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:27:08,196 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:27:08,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08 WrapperNode [2024-11-19 14:27:08,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:27:08,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:08,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:27:08,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:27:08,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,231 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-19 14:27:08,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:27:08,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:27:08,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:27:08,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:27:08,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 14:27:08,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:27:08,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:27:08,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:27:08,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:27:08,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (1/1) ... [2024-11-19 14:27:08,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:08,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:27:08,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:27:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:27:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:27:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:27:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:27:08,436 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:27:08,438 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:27:08,722 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 14:27:08,723 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:27:08,737 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:27:08,739 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:27:08,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:08 BoogieIcfgContainer [2024-11-19 14:27:08,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:27:08,740 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:27:08,740 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:27:08,744 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:27:08,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:08,747 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:27:07" (1/3) ... [2024-11-19 14:27:08,748 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7276491a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:08, skipping insertion in model container [2024-11-19 14:27:08,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:08,748 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:27:08" (2/3) ... [2024-11-19 14:27:08,748 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7276491a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:27:08, skipping insertion in model container [2024-11-19 14:27:08,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:27:08,748 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:08" (3/3) ... [2024-11-19 14:27:08,749 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2024-11-19 14:27:08,799 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:27:08,799 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:27:08,799 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:27:08,799 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:27:08,799 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:27:08,799 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:27:08,800 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:27:08,800 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:27:08,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:08,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-19 14:27:08,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:08,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:08,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:08,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:08,823 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:27:08,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:08,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-11-19 14:27:08,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:08,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:08,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:08,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:08,833 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 19#L127-1true [2024-11-19 14:27:08,833 INFO L747 eck$LassoCheckResult]: Loop: 19#L127-1true assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 27#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; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 28#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 33#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 21#L102-1true assume !(0 != main_~p4~0#1); 18#L107-1true assume !(0 != main_~p5~0#1); 34#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 19#L127-1true [2024-11-19 14:27:08,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:27:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406429449] [2024-11-19 14:27:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:08,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:08,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2024-11-19 14:27:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279448445] [2024-11-19 14:27:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279448445] [2024-11-19 14:27:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279448445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519276995] [2024-11-19 14:27:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,088 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,128 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,170 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2024-11-19 14:27:09,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 105 transitions. [2024-11-19 14:27:09,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-11-19 14:27:09,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 83 transitions. [2024-11-19 14:27:09,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-19 14:27:09,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-19 14:27:09,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2024-11-19 14:27:09,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-11-19 14:27:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2024-11-19 14:27:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 14:27:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2024-11-19 14:27:09,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-11-19 14:27:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,219 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-11-19 14:27:09,220 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:27:09,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2024-11-19 14:27:09,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-11-19 14:27:09,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,223 INFO L745 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 112#L127-1 [2024-11-19 14:27:09,223 INFO L747 eck$LassoCheckResult]: Loop: 112#L127-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#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 156#L62-1 assume !(0 != main_~p3~0#1); 155#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 153#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 152#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 151#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 150#L86-1 assume !(0 != main_~p1~0#1); 108#L92-1 assume !(0 != main_~p2~0#1); 107#L97-1 assume !(0 != main_~p3~0#1); 122#L102-1 assume !(0 != main_~p4~0#1); 127#L107-1 assume !(0 != main_~p5~0#1); 142#L112-1 assume !(0 != main_~p6~0#1); 135#L117-1 assume !(0 != main_~p7~0#1); 129#L122-1 assume !(0 != main_~p8~0#1); 112#L127-1 [2024-11-19 14:27:09,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:27:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712513173] [2024-11-19 14:27:09,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:09,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:09,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2024-11-19 14:27:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813392812] [2024-11-19 14:27:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813392812] [2024-11-19 14:27:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813392812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465968023] [2024-11-19 14:27:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,286 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,287 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,308 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2024-11-19 14:27:09,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2024-11-19 14:27:09,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2024-11-19 14:27:09,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2024-11-19 14:27:09,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2024-11-19 14:27:09,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2024-11-19 14:27:09,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2024-11-19 14:27:09,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-11-19 14:27:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2024-11-19 14:27:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-19 14:27:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2024-11-19 14:27:09,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-11-19 14:27:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,334 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-11-19 14:27:09,334 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:27:09,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2024-11-19 14:27:09,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2024-11-19 14:27:09,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,340 INFO L745 eck$LassoCheckResult]: Stem: 299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 273#L127-1 [2024-11-19 14:27:09,340 INFO L747 eck$LassoCheckResult]: Loop: 273#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 321#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; 319#L58 assume !(0 != main_~p1~0#1); 316#L58-2 assume !(0 != main_~p2~0#1); 314#L62-1 assume !(0 != main_~p3~0#1); 312#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 310#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 308#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 306#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 304#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 303#L86-1 assume !(0 != main_~p1~0#1); 300#L92-1 assume !(0 != main_~p2~0#1); 301#L97-1 assume !(0 != main_~p3~0#1); 343#L102-1 assume !(0 != main_~p4~0#1); 337#L107-1 assume !(0 != main_~p5~0#1); 332#L112-1 assume !(0 != main_~p6~0#1); 329#L117-1 assume !(0 != main_~p7~0#1); 325#L122-1 assume !(0 != main_~p8~0#1); 273#L127-1 [2024-11-19 14:27:09,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:27:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140159137] [2024-11-19 14:27:09,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:27:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,351 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:27:09,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:09,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2024-11-19 14:27:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282660677] [2024-11-19 14:27:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282660677] [2024-11-19 14:27:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282660677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968135863] [2024-11-19 14:27:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,425 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,428 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,454 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2024-11-19 14:27:09,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2024-11-19 14:27:09,457 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2024-11-19 14:27:09,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2024-11-19 14:27:09,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2024-11-19 14:27:09,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2024-11-19 14:27:09,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2024-11-19 14:27:09,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-11-19 14:27:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2024-11-19 14:27:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-19 14:27:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2024-11-19 14:27:09,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-11-19 14:27:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-11-19 14:27:09,490 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:27:09,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2024-11-19 14:27:09,492 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2024-11-19 14:27:09,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,497 INFO L745 eck$LassoCheckResult]: Stem: 605#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 579#L127-1 [2024-11-19 14:27:09,497 INFO L747 eck$LassoCheckResult]: Loop: 579#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 667#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; 665#L58 assume !(0 != main_~p1~0#1); 666#L58-2 assume !(0 != main_~p2~0#1); 718#L62-1 assume !(0 != main_~p3~0#1); 706#L66-1 assume !(0 != main_~p4~0#1); 707#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 716#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 705#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 702#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 692#L86-1 assume !(0 != main_~p1~0#1); 687#L92-1 assume !(0 != main_~p2~0#1); 685#L97-1 assume !(0 != main_~p3~0#1); 680#L102-1 assume !(0 != main_~p4~0#1); 677#L107-1 assume !(0 != main_~p5~0#1); 673#L112-1 assume !(0 != main_~p6~0#1); 671#L117-1 assume !(0 != main_~p7~0#1); 669#L122-1 assume !(0 != main_~p8~0#1); 579#L127-1 [2024-11-19 14:27:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:27:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521154253] [2024-11-19 14:27:09,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:27:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,508 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:27:09,509 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:09,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2024-11-19 14:27:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345082287] [2024-11-19 14:27:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345082287] [2024-11-19 14:27:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345082287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862387254] [2024-11-19 14:27:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,561 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,562 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,578 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2024-11-19 14:27:09,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2024-11-19 14:27:09,581 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2024-11-19 14:27:09,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2024-11-19 14:27:09,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2024-11-19 14:27:09,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2024-11-19 14:27:09,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2024-11-19 14:27:09,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-11-19 14:27:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2024-11-19 14:27:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-19 14:27:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2024-11-19 14:27:09,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-11-19 14:27:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-11-19 14:27:09,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:27:09,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2024-11-19 14:27:09,618 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2024-11-19 14:27:09,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,619 INFO L745 eck$LassoCheckResult]: Stem: 1198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 1170#L127-1 [2024-11-19 14:27:09,619 INFO L747 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1274#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; 1259#L58 assume !(0 != main_~p1~0#1); 1261#L58-2 assume !(0 != main_~p2~0#1); 1239#L62-1 assume !(0 != main_~p3~0#1); 1240#L66-1 assume !(0 != main_~p4~0#1); 1351#L70-1 assume !(0 != main_~p5~0#1); 1343#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1344#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1335#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1336#L86-1 assume !(0 != main_~p1~0#1); 1369#L92-1 assume !(0 != main_~p2~0#1); 1367#L97-1 assume !(0 != main_~p3~0#1); 1365#L102-1 assume !(0 != main_~p4~0#1); 1363#L107-1 assume !(0 != main_~p5~0#1); 1360#L112-1 assume !(0 != main_~p6~0#1); 1358#L117-1 assume !(0 != main_~p7~0#1); 1355#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2024-11-19 14:27:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:27:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268493532] [2024-11-19 14:27:09,620 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,625 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:09,625 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:09,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2024-11-19 14:27:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321817674] [2024-11-19 14:27:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321817674] [2024-11-19 14:27:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321817674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839581695] [2024-11-19 14:27:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,670 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,671 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,691 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2024-11-19 14:27:09,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2024-11-19 14:27:09,698 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2024-11-19 14:27:09,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2024-11-19 14:27:09,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2024-11-19 14:27:09,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2024-11-19 14:27:09,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2024-11-19 14:27:09,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-11-19 14:27:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2024-11-19 14:27:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-11-19 14:27:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2024-11-19 14:27:09,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-11-19 14:27:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,734 INFO L425 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-11-19 14:27:09,734 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:27:09,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2024-11-19 14:27:09,739 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2024-11-19 14:27:09,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,740 INFO L745 eck$LassoCheckResult]: Stem: 2345#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 2316#L127-1 [2024-11-19 14:27:09,740 INFO L747 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2408#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; 2404#L58 assume !(0 != main_~p1~0#1); 2402#L58-2 assume !(0 != main_~p2~0#1); 2400#L62-1 assume !(0 != main_~p3~0#1); 2396#L66-1 assume !(0 != main_~p4~0#1); 2392#L70-1 assume !(0 != main_~p5~0#1); 2388#L74-1 assume !(0 != main_~p6~0#1); 2386#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2384#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2380#L86-1 assume !(0 != main_~p1~0#1); 2378#L92-1 assume !(0 != main_~p2~0#1); 2370#L97-1 assume !(0 != main_~p3~0#1); 2371#L102-1 assume !(0 != main_~p4~0#1); 2423#L107-1 assume !(0 != main_~p5~0#1); 2419#L112-1 assume !(0 != main_~p6~0#1); 2416#L117-1 assume !(0 != main_~p7~0#1); 2412#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2024-11-19 14:27:09,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:27:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408446572] [2024-11-19 14:27:09,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:27:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,750 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:27:09,754 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:09,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2024-11-19 14:27:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057486024] [2024-11-19 14:27:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057486024] [2024-11-19 14:27:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057486024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:27:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754371672] [2024-11-19 14:27:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,811 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,812 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,837 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2024-11-19 14:27:09,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2024-11-19 14:27:09,853 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2024-11-19 14:27:09,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2024-11-19 14:27:09,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2024-11-19 14:27:09,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2024-11-19 14:27:09,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2024-11-19 14:27:09,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:09,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-11-19 14:27:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2024-11-19 14:27:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2024-11-19 14:27:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2024-11-19 14:27:09,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-11-19 14:27:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:09,896 INFO L425 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-11-19 14:27:09,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:27:09,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2024-11-19 14:27:09,905 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2024-11-19 14:27:09,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:09,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:09,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:09,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:09,906 INFO L745 eck$LassoCheckResult]: Stem: 4577#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 4547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 4548#L127-1 [2024-11-19 14:27:09,906 INFO L747 eck$LassoCheckResult]: Loop: 4548#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4854#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; 4851#L58 assume !(0 != main_~p1~0#1); 4852#L58-2 assume !(0 != main_~p2~0#1); 4823#L62-1 assume !(0 != main_~p3~0#1); 4824#L66-1 assume !(0 != main_~p4~0#1); 4897#L70-1 assume !(0 != main_~p5~0#1); 4895#L74-1 assume !(0 != main_~p6~0#1); 4891#L78-1 assume !(0 != main_~p7~0#1); 4885#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4882#L86-1 assume !(0 != main_~p1~0#1); 4878#L92-1 assume !(0 != main_~p2~0#1); 4876#L97-1 assume !(0 != main_~p3~0#1); 4870#L102-1 assume !(0 != main_~p4~0#1); 4869#L107-1 assume !(0 != main_~p5~0#1); 4866#L112-1 assume !(0 != main_~p6~0#1); 4862#L117-1 assume !(0 != main_~p7~0#1); 4859#L122-1 assume !(0 != main_~p8~0#1); 4548#L127-1 [2024-11-19 14:27:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:27:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276775722] [2024-11-19 14:27:09,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:09,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2024-11-19 14:27:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:09,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52195439] [2024-11-19 14:27:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:27:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52195439] [2024-11-19 14:27:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52195439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:27:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:27:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:27:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918378777] [2024-11-19 14:27:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:27:09,959 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:27:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:27:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:27:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:27:09,960 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:27:09,996 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2024-11-19 14:27:09,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2024-11-19 14:27:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2024-11-19 14:27:10,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2024-11-19 14:27:10,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2024-11-19 14:27:10,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2024-11-19 14:27:10,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2024-11-19 14:27:10,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:27:10,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-11-19 14:27:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2024-11-19 14:27:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2024-11-19 14:27:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:27:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2024-11-19 14:27:10,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-11-19 14:27:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:27:10,134 INFO L425 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-11-19 14:27:10,134 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:27:10,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2024-11-19 14:27:10,147 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2024-11-19 14:27:10,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:10,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:10,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:27:10,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:10,149 INFO L745 eck$LassoCheckResult]: Stem: 8945#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 8909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~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; 8910#L127-1 [2024-11-19 14:27:10,149 INFO L747 eck$LassoCheckResult]: Loop: 8910#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9083#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; 9080#L58 assume !(0 != main_~p1~0#1); 9077#L58-2 assume !(0 != main_~p2~0#1); 9071#L62-1 assume !(0 != main_~p3~0#1); 9072#L66-1 assume !(0 != main_~p4~0#1); 9134#L70-1 assume !(0 != main_~p5~0#1); 9128#L74-1 assume !(0 != main_~p6~0#1); 9122#L78-1 assume !(0 != main_~p7~0#1); 9115#L82-1 assume !(0 != main_~p8~0#1); 9108#L86-1 assume !(0 != main_~p1~0#1); 9107#L92-1 assume !(0 != main_~p2~0#1); 9104#L97-1 assume !(0 != main_~p3~0#1); 9101#L102-1 assume !(0 != main_~p4~0#1); 9099#L107-1 assume !(0 != main_~p5~0#1); 9095#L112-1 assume !(0 != main_~p6~0#1); 9091#L117-1 assume !(0 != main_~p7~0#1); 9087#L122-1 assume !(0 != main_~p8~0#1); 8910#L127-1 [2024-11-19 14:27:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-19 14:27:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534285861] [2024-11-19 14:27:10,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:27:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,155 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:27:10,155 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:10,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2024-11-19 14:27:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909228375] [2024-11-19 14:27:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:10,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2024-11-19 14:27:10,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274571362] [2024-11-19 14:27:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:10,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:27:10 BoogieIcfgContainer [2024-11-19 14:27:10,624 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:27:10,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:27:10,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:27:10,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:27:10,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:27:08" (3/4) ... [2024-11-19 14:27:10,628 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:27:10,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:27:10,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:27:10,679 INFO L158 Benchmark]: Toolchain (without parser) took 2760.63ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 124.0MB in the beginning and 111.3MB in the end (delta: 12.7MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,680 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:27:10,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.07ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 110.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 157.3MB. Free memory was 110.8MB in the beginning and 109.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,681 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,681 INFO L158 Benchmark]: RCFGBuilder took 464.16ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 123.7MB in the end (delta: -16.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,681 INFO L158 Benchmark]: BuchiAutomizer took 1884.03ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 123.7MB in the beginning and 114.5MB in the end (delta: 9.2MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,682 INFO L158 Benchmark]: Witness Printer took 54.00ms. Allocated memory is still 201.3MB. Free memory was 113.4MB in the beginning and 111.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:27:10,685 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.18ms. Allocated memory is still 104.9MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.07ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 110.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 157.3MB. Free memory was 110.8MB in the beginning and 109.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 157.3MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.16ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 123.7MB in the end (delta: -16.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1884.03ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 123.7MB in the beginning and 114.5MB in the end (delta: 9.2MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 54.00ms. Allocated memory is still 201.3MB. Free memory was 113.4MB in the beginning and 111.3MB 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 234 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 458 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 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-19 14:27:10,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)