./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 067fe51884f92ae3774f211cf9d4291369df85b7690d3eee54cd23a70c2ea301 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:44:28,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:44:28,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:44:28,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:44:28,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:44:28,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:44:28,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:44:28,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:44:28,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:44:28,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:44:28,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:44:28,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:44:28,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:44:28,292 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:44:28,292 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:44:28,292 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:44:28,293 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:44:28,293 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:44:28,293 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:44:28,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:44:28,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:44:28,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:44:28,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:44:28,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:44:28,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:44:28,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:44:28,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:44:28,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:44:28,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:44:28,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:44:28,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:44:28,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:44:28,297 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:44:28,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:44:28,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:44:28,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:44:28,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:44:28,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:44:28,302 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:44:28,302 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 067fe51884f92ae3774f211cf9d4291369df85b7690d3eee54cd23a70c2ea301 [2024-11-12 21:44:28,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:44:28,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:44:28,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:44:28,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:44:28,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:44:28,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c [2024-11-12 21:44:30,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:44:30,321 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:44:30,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c [2024-11-12 21:44:30,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5282249/ed17e055ee264084a85a86e11164495c/FLAG2e36f27c1 [2024-11-12 21:44:30,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5282249/ed17e055ee264084a85a86e11164495c [2024-11-12 21:44:30,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:44:30,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:44:30,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:30,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:44:30,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:44:30,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:30" (1/1) ... [2024-11-12 21:44:30,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@310d1131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:30, skipping insertion in model container [2024-11-12 21:44:30,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:30" (1/1) ... [2024-11-12 21:44:30,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:44:31,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:31,062 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:44:31,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:31,174 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:44:31,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31 WrapperNode [2024-11-12 21:44:31,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:31,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:31,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:44:31,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:44:31,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,230 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 889 [2024-11-12 21:44:31,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:31,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:44:31,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:44:31,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:44:31,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,264 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 21:44:31,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:44:31,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:44:31,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:44:31,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:44:31,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (1/1) ... [2024-11-12 21:44:31,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:44:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:31,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:44:31,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 21:44:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:44:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:44:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:44:31,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:44:31,618 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:44:31,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:44:32,354 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-12 21:44:32,354 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:44:32,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:44:32,374 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-12 21:44:32,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:32 BoogieIcfgContainer [2024-11-12 21:44:32,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:44:32,376 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:44:32,376 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:44:32,379 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:44:32,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:32,380 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:44:30" (1/3) ... [2024-11-12 21:44:32,381 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b9e03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:32, skipping insertion in model container [2024-11-12 21:44:32,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:32,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:31" (2/3) ... [2024-11-12 21:44:32,381 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21b9e03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:32, skipping insertion in model container [2024-11-12 21:44:32,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:32,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:32" (3/3) ... [2024-11-12 21:44:32,383 INFO L332 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.5.cil.c [2024-11-12 21:44:32,437 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:44:32,437 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:44:32,437 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:44:32,437 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:44:32,437 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:44:32,437 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:44:32,438 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:44:32,438 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:44:32,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 285 states, 284 states have (on average 1.8133802816901408) internal successors, (515), 284 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:32,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 261 [2024-11-12 21:44:32,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:32,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:32,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,484 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:44:32,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 285 states, 284 states have (on average 1.8133802816901408) internal successors, (515), 284 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:32,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 261 [2024-11-12 21:44:32,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:32,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:32,496 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,504 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_memory4~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume !(1 == ~m_run_i~0);~m_run_st~0 := 2;" "assume !(1 == ~s_run_i~0);~s_run_st~0 := 2;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" [2024-11-12 21:44:32,505 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !true;" "havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2024-11-12 21:44:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203204374] [2024-11-12 21:44:32,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203204374] [2024-11-12 21:44:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203204374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741206369] [2024-11-12 21:44:32,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:32,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:32,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 21:44:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:44:32,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:32,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741206369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:32,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:32,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-12 21:44:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623739151] [2024-11-12 21:44:32,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:32,952 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 538284795, now seen corresponding path program 1 times [2024-11-12 21:44:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879731367] [2024-11-12 21:44:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879731367] [2024-11-12 21:44:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879731367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151851685] [2024-11-12 21:44:32,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:32,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:32,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:32,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 21:44:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 21:44:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:33,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:33,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151851685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:33,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103937437] [2024-11-12 21:44:33,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:33,033 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:33,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:44:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:44:33,070 INFO L87 Difference]: Start difference. First operand has 285 states, 284 states have (on average 1.8133802816901408) internal successors, (515), 284 states have internal predecessors, (515), 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 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:33,506 INFO L93 Difference]: Finished difference Result 464 states and 717 transitions. [2024-11-12 21:44:33,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 464 states and 717 transitions. [2024-11-12 21:44:33,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 432 [2024-11-12 21:44:33,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 464 states to 446 states and 699 transitions. [2024-11-12 21:44:33,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2024-11-12 21:44:33,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 446 [2024-11-12 21:44:33,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 699 transitions. [2024-11-12 21:44:33,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:33,538 INFO L218 hiAutomatonCegarLoop]: Abstraction has 446 states and 699 transitions. [2024-11-12 21:44:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 699 transitions. [2024-11-12 21:44:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-11-12 21:44:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 1.575) internal successors, (693), 439 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 693 transitions. [2024-11-12 21:44:33,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 440 states and 693 transitions. [2024-11-12 21:44:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 21:44:33,613 INFO L426 stractBuchiCegarLoop]: Abstraction has 440 states and 693 transitions. [2024-11-12 21:44:33,613 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:44:33,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 693 transitions. [2024-11-12 21:44:33,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 426 [2024-11-12 21:44:33,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:33,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:33,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:33,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:33,618 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_memory4~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume !(1 == ~s_run_i~0);~s_run_st~0 := 2;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" [2024-11-12 21:44:33,619 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !false;" "assume !(0 == ~m_run_st~0);" "assume !(0 == ~s_run_st~0);" "havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2037071525, now seen corresponding path program 1 times [2024-11-12 21:44:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767410335] [2024-11-12 21:44:33,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767410335] [2024-11-12 21:44:33,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767410335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029493085] [2024-11-12 21:44:33,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:33,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:33,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:33,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 21:44:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:33,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:33,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:33,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029493085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:33,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:33,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 21:44:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023606265] [2024-11-12 21:44:33,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:33,769 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1502378198, now seen corresponding path program 1 times [2024-11-12 21:44:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842682498] [2024-11-12 21:44:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842682498] [2024-11-12 21:44:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842682498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362236260] [2024-11-12 21:44:33,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:33,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:33,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 21:44:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:33,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:33,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362236260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:33,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:33,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217176923] [2024-11-12 21:44:33,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:33,908 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:33,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:33,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:33,910 INFO L87 Difference]: Start difference. First operand 440 states and 693 transitions. cyclomatic complexity: 254 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:33,922 INFO L93 Difference]: Finished difference Result 440 states and 692 transitions. [2024-11-12 21:44:33,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 692 transitions. [2024-11-12 21:44:33,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 426 [2024-11-12 21:44:33,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 440 states and 692 transitions. [2024-11-12 21:44:33,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 440 [2024-11-12 21:44:33,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2024-11-12 21:44:33,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 440 states and 692 transitions. [2024-11-12 21:44:33,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:33,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 440 states and 692 transitions. [2024-11-12 21:44:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states and 692 transitions. [2024-11-12 21:44:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-12 21:44:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 1.5727272727272728) internal successors, (692), 439 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 692 transitions. [2024-11-12 21:44:33,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 440 states and 692 transitions. [2024-11-12 21:44:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:33,962 INFO L426 stractBuchiCegarLoop]: Abstraction has 440 states and 692 transitions. [2024-11-12 21:44:33,962 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:44:33,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 692 transitions. [2024-11-12 21:44:33,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 426 [2024-11-12 21:44:33,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:33,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:33,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:33,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:33,966 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_memory4~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" [2024-11-12 21:44:33,967 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !false;" "assume !(0 == ~m_run_st~0);" "assume !(0 == ~s_run_st~0);" "havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:33,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2024-11-12 21:44:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066697636] [2024-11-12 21:44:33,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,991 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:34,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1502369983, now seen corresponding path program 1 times [2024-11-12 21:44:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97003567] [2024-11-12 21:44:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97003567] [2024-11-12 21:44:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97003567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568532924] [2024-11-12 21:44:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:34,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 21:44:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:34,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:34,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568532924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:34,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:34,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071486505] [2024-11-12 21:44:34,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:34,155 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:34,156 INFO L87 Difference]: Start difference. First operand 440 states and 692 transitions. cyclomatic complexity: 253 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:34,263 INFO L93 Difference]: Finished difference Result 715 states and 1148 transitions. [2024-11-12 21:44:34,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 1148 transitions. [2024-11-12 21:44:34,268 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 691 [2024-11-12 21:44:34,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 715 states and 1148 transitions. [2024-11-12 21:44:34,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 715 [2024-11-12 21:44:34,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 715 [2024-11-12 21:44:34,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1148 transitions. [2024-11-12 21:44:34,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:34,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1148 transitions. [2024-11-12 21:44:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1148 transitions. [2024-11-12 21:44:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2024-11-12 21:44:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 709 states have (on average 1.6107193229901269) internal successors, (1142), 708 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1142 transitions. [2024-11-12 21:44:34,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 709 states and 1142 transitions. [2024-11-12 21:44:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:34,296 INFO L426 stractBuchiCegarLoop]: Abstraction has 709 states and 1142 transitions. [2024-11-12 21:44:34,296 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:44:34,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 709 states and 1142 transitions. [2024-11-12 21:44:34,300 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 685 [2024-11-12 21:44:34,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:34,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:34,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:34,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 21:44:34,301 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_memory4~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2024-11-12 21:44:34,301 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume !(0 == ~s_run_st~0);" [2024-11-12 21:44:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2024-11-12 21:44:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070019000] [2024-11-12 21:44:34,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,321 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:34,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 151895926, now seen corresponding path program 1 times [2024-11-12 21:44:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294059632] [2024-11-12 21:44:34,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,344 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -840624164, now seen corresponding path program 1 times [2024-11-12 21:44:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167797299] [2024-11-12 21:44:34,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167797299] [2024-11-12 21:44:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167797299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295684165] [2024-11-12 21:44:34,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:34,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:34,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:34,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 21:44:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:34,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:34,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295684165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:34,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130558330] [2024-11-12 21:44:34,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:34,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:34,578 INFO L87 Difference]: Start difference. First operand 709 states and 1142 transitions. cyclomatic complexity: 436 Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:34,668 INFO L93 Difference]: Finished difference Result 1336 states and 2152 transitions. [2024-11-12 21:44:34,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1336 states and 2152 transitions. [2024-11-12 21:44:34,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1303 [2024-11-12 21:44:34,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1336 states to 1336 states and 2152 transitions. [2024-11-12 21:44:34,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1336 [2024-11-12 21:44:34,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1336 [2024-11-12 21:44:34,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1336 states and 2152 transitions. [2024-11-12 21:44:34,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:34,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1336 states and 2152 transitions. [2024-11-12 21:44:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states and 2152 transitions. [2024-11-12 21:44:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1124. [2024-11-12 21:44:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1124 states have (on average 1.612099644128114) internal successors, (1812), 1123 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1812 transitions. [2024-11-12 21:44:34,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1124 states and 1812 transitions. [2024-11-12 21:44:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:34,709 INFO L426 stractBuchiCegarLoop]: Abstraction has 1124 states and 1812 transitions. [2024-11-12 21:44:34,709 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:44:34,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1124 states and 1812 transitions. [2024-11-12 21:44:34,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1091 [2024-11-12 21:44:34,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:34,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:34,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:34,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:44:34,716 INFO L747 eck$LassoCheckResult]: Stem: "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(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_memory4~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0;" "assume 1 == ~m_run_i~0;~m_run_st~0 := 0;" "assume 1 == ~s_run_i~0;~s_run_st~0 := 0;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" [2024-11-12 21:44:34,716 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "assume 0 == ~m_run_st~0;" "assume 0 == ~m_run_st~0;havoc eval_#t~nondet5#1;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1;" "assume !(0 != eval_~tmp~0#1);" "assume 0 == ~s_run_st~0;havoc eval_#t~nondet6#1;eval_~tmp___0~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1;" "assume !(0 != eval_~tmp___0~0#1);" [2024-11-12 21:44:34,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2024-11-12 21:44:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918114200] [2024-11-12 21:44:34,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,731 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:34,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 413796722, now seen corresponding path program 1 times [2024-11-12 21:44:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916116144] [2024-11-12 21:44:34,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,769 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -289554996, now seen corresponding path program 1 times [2024-11-12 21:44:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222242144] [2024-11-12 21:44:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,792 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:34,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:36,053 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:36,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:44:36 BoogieIcfgContainer [2024-11-12 21:44:36,187 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:44:36,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:44:36,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:44:36,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:44:36,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:32" (3/4) ... [2024-11-12 21:44:36,191 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:44:36,265 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:44:36,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:44:36,266 INFO L158 Benchmark]: Toolchain (without parser) took 5581.80ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 87.2MB in the beginning and 130.5MB in the end (delta: -43.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,266 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:44:36,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.69ms. Allocated memory is still 134.2MB. Free memory was 86.8MB in the beginning and 64.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.52ms. Allocated memory is still 134.2MB. Free memory was 64.0MB in the beginning and 60.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,267 INFO L158 Benchmark]: Boogie Preprocessor took 63.62ms. Allocated memory is still 134.2MB. Free memory was 60.5MB in the beginning and 55.7MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,268 INFO L158 Benchmark]: RCFGBuilder took 1078.98ms. Allocated memory is still 134.2MB. Free memory was 55.7MB in the beginning and 51.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,268 INFO L158 Benchmark]: BuchiAutomizer took 3811.24ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 51.4MB in the beginning and 135.7MB in the end (delta: -84.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:44:36,268 INFO L158 Benchmark]: Witness Printer took 77.73ms. Allocated memory is still 197.1MB. Free memory was 135.7MB in the beginning and 130.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 21:44:36,270 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.22ms. Allocated memory is still 100.7MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.69ms. Allocated memory is still 134.2MB. Free memory was 86.8MB in the beginning and 64.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.52ms. Allocated memory is still 134.2MB. Free memory was 64.0MB in the beginning and 60.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.62ms. Allocated memory is still 134.2MB. Free memory was 60.5MB in the beginning and 55.7MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1078.98ms. Allocated memory is still 134.2MB. Free memory was 55.7MB in the beginning and 51.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3811.24ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 51.4MB in the beginning and 135.7MB in the end (delta: -84.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.73ms. Allocated memory is still 197.1MB. Free memory was 135.7MB in the beginning and 130.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1124 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 224 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2063 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2063 mSDsluCounter, 3055 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1041 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 2014 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 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: 1138]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L29] int s_memory1 ; [L30] int s_memory2 ; [L31] int s_memory3 ; [L32] int s_memory4 ; [L33] int s_run_st ; [L34] int s_run_i ; [L35] int s_run_pc ; [L36] int c_m_lock ; [L37] int c_m_ev ; [L38] int c_req_type ; [L39] int c_req_a ; [L40] int c_req_d ; [L41] int c_rsp_type ; [L42] int c_rsp_status ; [L43] int c_rsp_d ; [L44] int c_empty_req ; [L45] int c_empty_rsp ; [L46] int c_read_req_ev ; [L47] int c_write_req_ev ; [L48] int c_read_rsp_ev ; [L49] int c_write_rsp_ev ; [L50] static int d_t ; [L51] static int a_t ; [L52] static int req_t_type ; [L53] static int req_t_a ; [L54] static int req_t_d ; [L55] static int rsp_t_type ; [L56] static int rsp_t_status ; [L57] static int rsp_t_d ; [L58] static int req_tt_type ; [L59] static int req_tt_a ; [L60] static int req_tt_d ; [L61] static int rsp_tt_type ; [L62] static int rsp_tt_status ; [L63] static int rsp_tt_d ; [L864] static int req_t_type___0 ; [L865] static int req_t_a___0 ; [L866] static int req_t_d___0 ; [L867] static int rsp_t_type___0 ; [L868] static int rsp_t_status___0 ; [L869] static int rsp_t_d___0 ; VAL [a_t=0, c_empty_req=0, c_empty_rsp=0, c_m_ev=0, c_m_lock=0, c_read_req_ev=0, c_read_rsp_ev=0, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=0, c_write_rsp_ev=0, d_t=0, m_run_i=0, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=0, s_run_pc=0, s_run_st=0] [L1371] int __retres1 ; [L1375] c_m_lock = 0 [L1376] c_m_ev = 2 [L1378] m_run_i = 1 [L1379] m_run_pc = 0 [L1380] s_run_i = 1 [L1381] s_run_pc = 0 [L1382] c_empty_req = 1 [L1383] c_empty_rsp = 1 [L1384] c_read_req_ev = 2 [L1385] c_write_req_ev = 2 [L1386] c_read_rsp_ev = 2 [L1387] c_write_rsp_ev = 2 [L1388] c_m_lock = 0 [L1389] c_m_ev = 2 [L1390] CALL start_simulation() [L1187] int kernel_st ; [L1190] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1191] COND TRUE (int )m_run_i == 1 [L1192] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1196] COND TRUE (int )s_run_i == 1 [L1197] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1201] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1209] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1217] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1225] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1233] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1241] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1255] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1263] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1274] COND TRUE 1 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1277] kernel_st = 1 [L1278] CALL eval() [L1133] int tmp ; [L1134] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1138] COND TRUE 1 [L1140] COND TRUE (int )m_run_st == 0 [L1149] COND TRUE (int )m_run_st == 0 [L1151] tmp = __VERIFIER_nondet_int() [L1153] COND FALSE !(\read(tmp)) [L1164] COND TRUE (int )s_run_st == 0 [L1166] tmp___0 = __VERIFIER_nondet_int() [L1168] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1138]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L29] int s_memory1 ; [L30] int s_memory2 ; [L31] int s_memory3 ; [L32] int s_memory4 ; [L33] int s_run_st ; [L34] int s_run_i ; [L35] int s_run_pc ; [L36] int c_m_lock ; [L37] int c_m_ev ; [L38] int c_req_type ; [L39] int c_req_a ; [L40] int c_req_d ; [L41] int c_rsp_type ; [L42] int c_rsp_status ; [L43] int c_rsp_d ; [L44] int c_empty_req ; [L45] int c_empty_rsp ; [L46] int c_read_req_ev ; [L47] int c_write_req_ev ; [L48] int c_read_rsp_ev ; [L49] int c_write_rsp_ev ; [L50] static int d_t ; [L51] static int a_t ; [L52] static int req_t_type ; [L53] static int req_t_a ; [L54] static int req_t_d ; [L55] static int rsp_t_type ; [L56] static int rsp_t_status ; [L57] static int rsp_t_d ; [L58] static int req_tt_type ; [L59] static int req_tt_a ; [L60] static int req_tt_d ; [L61] static int rsp_tt_type ; [L62] static int rsp_tt_status ; [L63] static int rsp_tt_d ; [L864] static int req_t_type___0 ; [L865] static int req_t_a___0 ; [L866] static int req_t_d___0 ; [L867] static int rsp_t_type___0 ; [L868] static int rsp_t_status___0 ; [L869] static int rsp_t_d___0 ; VAL [a_t=0, c_empty_req=0, c_empty_rsp=0, c_m_ev=0, c_m_lock=0, c_read_req_ev=0, c_read_rsp_ev=0, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=0, c_write_rsp_ev=0, d_t=0, m_run_i=0, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=0, s_run_pc=0, s_run_st=0] [L1371] int __retres1 ; [L1375] c_m_lock = 0 [L1376] c_m_ev = 2 [L1378] m_run_i = 1 [L1379] m_run_pc = 0 [L1380] s_run_i = 1 [L1381] s_run_pc = 0 [L1382] c_empty_req = 1 [L1383] c_empty_rsp = 1 [L1384] c_read_req_ev = 2 [L1385] c_write_req_ev = 2 [L1386] c_read_rsp_ev = 2 [L1387] c_write_rsp_ev = 2 [L1388] c_m_lock = 0 [L1389] c_m_ev = 2 [L1390] CALL start_simulation() [L1187] int kernel_st ; [L1190] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1191] COND TRUE (int )m_run_i == 1 [L1192] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1196] COND TRUE (int )s_run_i == 1 [L1197] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1201] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1209] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1217] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1225] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1233] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1241] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1255] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1263] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1274] COND TRUE 1 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1277] kernel_st = 1 [L1278] CALL eval() [L1133] int tmp ; [L1134] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_memory4=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1138] COND TRUE 1 [L1140] COND TRUE (int )m_run_st == 0 [L1149] COND TRUE (int )m_run_st == 0 [L1151] tmp = __VERIFIER_nondet_int() [L1153] COND FALSE !(\read(tmp)) [L1164] COND TRUE (int )s_run_st == 0 [L1166] tmp___0 = __VERIFIER_nondet_int() [L1168] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:44:36,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 21:44:36,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 21:44:36,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 21:44:36,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 21:44:37,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 21:44:37,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 21:44:37,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)