./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:26:32,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:26:32,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:26:32,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:26:32,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:26:32,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:26:32,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:26:32,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:26:32,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:26:32,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:26:32,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:26:32,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:26:32,339 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:26:32,342 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:26:32,342 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:26:32,342 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:26:32,343 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:26:32,344 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:26:32,346 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:26:32,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:26:32,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:26:32,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:26:32,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:26:32,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:26:32,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:26:32,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:26:32,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:26:32,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:26:32,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:26:32,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:26:32,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:26:32,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:26:32,353 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:26:32,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:26:32,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:26:32,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:26:32,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:26:32,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:26:32,355 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:26:32,355 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-clean/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-clean/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-10-12 00:26:32,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:26:32,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:26:32,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:26:32,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:26:32,730 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:26:32,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-10-12 00:26:34,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:26:34,451 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:26:34,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2024-10-12 00:26:34,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/88f598b11/026a1b2196cd47fab57c1cc3a4f501ed/FLAG3b2947296 [2024-10-12 00:26:34,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/88f598b11/026a1b2196cd47fab57c1cc3a4f501ed [2024-10-12 00:26:34,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:26:34,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:26:34,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:34,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:26:34,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:26:34,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34dbf696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34, skipping insertion in model container [2024-10-12 00:26:34,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:26:34,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:34,735 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:26:34,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:34,769 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:26:34,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34 WrapperNode [2024-10-12 00:26:34,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:34,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:34,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:26:34,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:26:34,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,801 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-10-12 00:26:34,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:34,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:26:34,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:26:34,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:26:34,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 00:26:34,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:26:34,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:26:34,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:26:34,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:26:34,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (1/1) ... [2024-10-12 00:26:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:34,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:26:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:26:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:26:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:26:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:26:34,987 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:26:34,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:26:35,225 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-12 00:26:35,225 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:26:35,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:26:35,237 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:26:35,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:35 BoogieIcfgContainer [2024-10-12 00:26:35,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:26:35,238 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:26:35,238 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:26:35,242 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:26:35,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:35,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:26:34" (1/3) ... [2024-10-12 00:26:35,244 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c3b5b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:35, skipping insertion in model container [2024-10-12 00:26:35,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:35,244 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:34" (2/3) ... [2024-10-12 00:26:35,246 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c3b5b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:35, skipping insertion in model container [2024-10-12 00:26:35,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:35,246 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:35" (3/3) ... [2024-10-12 00:26:35,248 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2024-10-12 00:26:35,310 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:26:35,311 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:26:35,311 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:26:35,311 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:26:35,311 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:26:35,312 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:26:35,312 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:26:35,312 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:26:35,318 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-10-12 00:26:35,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-12 00:26:35,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:35,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:35,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:35,350 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-10-12 00:26:35,351 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:26:35,351 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-10-12 00:26:35,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-12 00:26:35,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:35,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:35,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:35,357 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-10-12 00:26:35,366 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-10-12 00:26:35,367 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-10-12 00:26:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:26:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672103549] [2024-10-12 00:26:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:35,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2024-10-12 00:26:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676637149] [2024-10-12 00:26:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676637149] [2024-10-12 00:26:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676637149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:35,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574883294] [2024-10-12 00:26:35,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:35,661 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:35,689 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-10-12 00:26:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:35,728 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2024-10-12 00:26:35,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 105 transitions. [2024-10-12 00:26:35,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-10-12 00:26:35,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 83 transitions. [2024-10-12 00:26:35,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-10-12 00:26:35,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-12 00:26:35,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2024-10-12 00:26:35,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:35,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-10-12 00:26:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2024-10-12 00:26:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 00:26:35,774 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-10-12 00:26:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2024-10-12 00:26:35,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-10-12 00:26:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:35,786 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2024-10-12 00:26:35,786 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:26:35,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2024-10-12 00:26:35,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-10-12 00:26:35,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:35,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:35,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:35,791 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-10-12 00:26:35,791 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-10-12 00:26:35,791 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-10-12 00:26:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:26:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141054854] [2024-10-12 00:26:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2024-10-12 00:26:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039611550] [2024-10-12 00:26:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039611550] [2024-10-12 00:26:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039611550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:35,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:35,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956243515] [2024-10-12 00:26:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:35,881 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:35,882 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-10-12 00:26:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:35,899 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2024-10-12 00:26:35,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2024-10-12 00:26:35,902 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2024-10-12 00:26:35,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2024-10-12 00:26:35,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2024-10-12 00:26:35,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2024-10-12 00:26:35,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2024-10-12 00:26:35,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:35,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-10-12 00:26:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2024-10-12 00:26:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-12 00:26:35,921 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-10-12 00:26:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2024-10-12 00:26:35,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-10-12 00:26:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:35,928 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-10-12 00:26:35,929 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:26:35,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2024-10-12 00:26:35,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2024-10-12 00:26:35,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:35,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:35,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:35,936 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-10-12 00:26:35,937 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-10-12 00:26:35,937 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-10-12 00:26:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:26:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27942239] [2024-10-12 00:26:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:35,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:35,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2024-10-12 00:26:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:35,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287921976] [2024-10-12 00:26:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287921976] [2024-10-12 00:26:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287921976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:36,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279792708] [2024-10-12 00:26:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:36,038 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:36,039 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-10-12 00:26:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:36,064 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2024-10-12 00:26:36,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2024-10-12 00:26:36,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2024-10-12 00:26:36,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2024-10-12 00:26:36,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2024-10-12 00:26:36,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2024-10-12 00:26:36,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2024-10-12 00:26:36,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:36,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-10-12 00:26:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2024-10-12 00:26:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-12 00:26:36,096 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-10-12 00:26:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2024-10-12 00:26:36,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-10-12 00:26:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:36,102 INFO L425 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2024-10-12 00:26:36,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:26:36,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2024-10-12 00:26:36,105 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2024-10-12 00:26:36,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,106 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-10-12 00:26:36,106 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-10-12 00:26:36,106 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-10-12 00:26:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:26:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687329721] [2024-10-12 00:26:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2024-10-12 00:26:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141225559] [2024-10-12 00:26:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141225559] [2024-10-12 00:26:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141225559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:36,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:36,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:36,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463273553] [2024-10-12 00:26:36,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:36,189 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:36,190 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-10-12 00:26:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:36,226 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2024-10-12 00:26:36,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2024-10-12 00:26:36,229 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2024-10-12 00:26:36,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2024-10-12 00:26:36,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2024-10-12 00:26:36,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2024-10-12 00:26:36,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2024-10-12 00:26:36,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:36,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-10-12 00:26:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2024-10-12 00:26:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-12 00:26:36,260 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-10-12 00:26:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2024-10-12 00:26:36,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-10-12 00:26:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:36,264 INFO L425 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-10-12 00:26:36,264 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:26:36,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2024-10-12 00:26:36,267 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2024-10-12 00:26:36,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,268 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-10-12 00:26:36,268 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-10-12 00:26:36,268 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-10-12 00:26:36,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:26:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537912335] [2024-10-12 00:26:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2024-10-12 00:26:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759069663] [2024-10-12 00:26:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759069663] [2024-10-12 00:26:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759069663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786880300] [2024-10-12 00:26:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:36,315 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:36,317 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-10-12 00:26:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:36,344 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2024-10-12 00:26:36,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2024-10-12 00:26:36,353 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2024-10-12 00:26:36,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2024-10-12 00:26:36,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2024-10-12 00:26:36,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2024-10-12 00:26:36,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2024-10-12 00:26:36,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:36,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-10-12 00:26:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2024-10-12 00:26:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-12 00:26:36,390 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-10-12 00:26:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2024-10-12 00:26:36,398 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-10-12 00:26:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:36,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2024-10-12 00:26:36,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:26:36,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2024-10-12 00:26:36,404 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2024-10-12 00:26:36,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,407 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-10-12 00:26:36,408 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-10-12 00:26:36,408 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-10-12 00:26:36,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-12 00:26:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712423288] [2024-10-12 00:26:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2024-10-12 00:26:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138523513] [2024-10-12 00:26:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:36,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138523513] [2024-10-12 00:26:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138523513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:36,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207438379] [2024-10-12 00:26:36,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:36,482 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:36,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:36,483 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-10-12 00:26:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:36,514 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2024-10-12 00:26:36,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2024-10-12 00:26:36,534 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2024-10-12 00:26:36,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2024-10-12 00:26:36,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2024-10-12 00:26:36,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2024-10-12 00:26:36,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2024-10-12 00:26:36,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:36,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-10-12 00:26:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2024-10-12 00:26:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2024-10-12 00:26:36,587 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-10-12 00:26:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2024-10-12 00:26:36,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-10-12 00:26:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:36,596 INFO L425 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2024-10-12 00:26:36,597 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:26:36,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2024-10-12 00:26:36,608 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2024-10-12 00:26:36,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,609 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-10-12 00:26:36,610 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-10-12 00:26:36,610 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-10-12 00:26:36,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-12 00:26:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047353642] [2024-10-12 00:26:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2024-10-12 00:26:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653459422] [2024-10-12 00:26:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:36,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653459422] [2024-10-12 00:26:36,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653459422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:36,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:26:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140337614] [2024-10-12 00:26:36,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:36,696 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:36,697 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-10-12 00:26:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:36,723 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2024-10-12 00:26:36,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2024-10-12 00:26:36,747 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2024-10-12 00:26:36,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2024-10-12 00:26:36,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2024-10-12 00:26:36,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2024-10-12 00:26:36,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2024-10-12 00:26:36,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:36,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-10-12 00:26:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2024-10-12 00:26:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2024-10-12 00:26:36,830 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-10-12 00:26:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2024-10-12 00:26:36,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-10-12 00:26:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:36,843 INFO L425 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2024-10-12 00:26:36,844 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:26:36,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2024-10-12 00:26:36,862 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2024-10-12 00:26:36,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,863 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-10-12 00:26:36,863 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-10-12 00:26:36,863 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-10-12 00:26:36,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-12 00:26:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281305066] [2024-10-12 00:26:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2024-10-12 00:26:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911379061] [2024-10-12 00:26:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2024-10-12 00:26:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110019671] [2024-10-12 00:26:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:37,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:37,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:26:37 BoogieIcfgContainer [2024-10-12 00:26:37,360 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:26:37,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:26:37,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:26:37,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:26:37,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:35" (3/4) ... [2024-10-12 00:26:37,363 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:26:37,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:26:37,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:26:37,405 INFO L158 Benchmark]: Toolchain (without parser) took 2920.48ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 62.6MB in the end (delta: 78.2MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,405 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:37,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.82ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 128.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.89ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 127.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:37,406 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 176.2MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,406 INFO L158 Benchmark]: RCFGBuilder took 398.97ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 141.8MB in the end (delta: -16.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,407 INFO L158 Benchmark]: BuchiAutomizer took 2121.50ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 64.6MB in the end (delta: 77.2MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,407 INFO L158 Benchmark]: Witness Printer took 43.70ms. Allocated memory is still 176.2MB. Free memory was 64.6MB in the beginning and 62.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:37,409 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.16ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.82ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 128.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.89ms. Allocated memory is still 176.2MB. Free memory was 128.2MB in the beginning and 127.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 176.2MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.97ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 141.8MB in the end (delta: -16.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2121.50ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 64.6MB in the end (delta: 77.2MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Witness Printer took 43.70ms. Allocated memory is still 176.2MB. Free memory was 64.6MB in the beginning and 62.6MB in the end (delta: 2.0MB). 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 2.0s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. 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.1s 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-10-12 00:26:37,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)