./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.2.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.2.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 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:44:22,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:44:22,159 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:22,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:44:22,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:44:22,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:44:22,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:44:22,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:44:22,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:44:22,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:44:22,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:44:22,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:44:22,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:44:22,210 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:44:22,212 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:44:22,212 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:44:22,213 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:44:22,213 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:44:22,213 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:44:22,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:44:22,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:44:22,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:44:22,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:44:22,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:44:22,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:44:22,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:44:22,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:44:22,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:44:22,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:44:22,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:44:22,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:44:22,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:44:22,217 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:44:22,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:44:22,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:44:22,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:44:22,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:44:22,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:44:22,219 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:44:22,219 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 -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2024-11-12 21:44:22,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:44:22,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:44:22,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:44:22,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:44:22,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:44:22,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2024-11-12 21:44:23,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:44:24,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:44:24,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2024-11-12 21:44:24,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a151d17a/f487e6b0f55d43f4bd8a31ce99f75927/FLAGaeab1e563 [2024-11-12 21:44:24,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a151d17a/f487e6b0f55d43f4bd8a31ce99f75927 [2024-11-12 21:44:24,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:44:24,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:44:24,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:24,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:44:24,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:44:24,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:24" (1/1) ... [2024-11-12 21:44:24,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dd59b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:24, skipping insertion in model container [2024-11-12 21:44:24,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:24" (1/1) ... [2024-11-12 21:44:24,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:44:24,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:24,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:44:24,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:24,423 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:44:24,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:24 WrapperNode [2024-11-12 21:44:24,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:24,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:24,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:44:24,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:44:24,431 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:24" (1/1) ... [2024-11-12 21:44:24,439 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:24" (1/1) ... [2024-11-12 21:44:24,470 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 874 [2024-11-12 21:44:24,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:24,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:44:24,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:44:24,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:44:24,482 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:24" (1/1) ... [2024-11-12 21:44:24,482 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:24" (1/1) ... [2024-11-12 21:44:24,485 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:24" (1/1) ... [2024-11-12 21:44:24,499 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:24,499 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:24" (1/1) ... [2024-11-12 21:44:24,500 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:24" (1/1) ... [2024-11-12 21:44:24,506 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:24" (1/1) ... [2024-11-12 21:44:24,520 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:24" (1/1) ... [2024-11-12 21:44:24,524 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:24" (1/1) ... [2024-11-12 21:44:24,527 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:24" (1/1) ... [2024-11-12 21:44:24,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:44:24,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:44:24,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:44:24,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:44:24,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:24" (1/1) ... [2024-11-12 21:44:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:44:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:24,570 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:24,576 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:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:44:24,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:44:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:44:24,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:44:24,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:44:24,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:44:25,353 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-12 21:44:25,354 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:44:25,380 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:44:25,380 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-12 21:44:25,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:25 BoogieIcfgContainer [2024-11-12 21:44:25,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:44:25,381 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:44:25,381 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:44:25,385 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:44:25,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:25,387 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:44:24" (1/3) ... [2024-11-12 21:44:25,388 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@241ba48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:25, skipping insertion in model container [2024-11-12 21:44:25,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:25,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:24" (2/3) ... [2024-11-12 21:44:25,388 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@241ba48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:25, skipping insertion in model container [2024-11-12 21:44:25,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:25,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:25" (3/3) ... [2024-11-12 21:44:25,390 INFO L332 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2024-11-12 21:44:25,438 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:44:25,438 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:44:25,438 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:44:25,439 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:44:25,439 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:44:25,439 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:44:25,439 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:44:25,439 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:44:25,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 279 states, 278 states have (on average 1.8093525179856116) internal successors, (503), 278 states have internal predecessors, (503), 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:25,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2024-11-12 21:44:25,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:25,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:25,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:25,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:25,476 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:44:25,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 279 states, 278 states have (on average 1.8093525179856116) internal successors, (503), 278 states have internal predecessors, (503), 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:25,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2024-11-12 21:44:25,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:25,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:25,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:25,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:25,490 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_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:25,491 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 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:25,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2024-11-12 21:44:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691641421] [2024-11-12 21:44:25,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691641421] [2024-11-12 21:44:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691641421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166808962] [2024-11-12 21:44:25,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:25,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:25,679 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:25,680 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:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:25,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:44:25,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:25,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166808962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:25,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-12 21:44:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679139965] [2024-11-12 21:44:25,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:25,806 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:25,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1204533754, now seen corresponding path program 1 times [2024-11-12 21:44:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57189744] [2024-11-12 21:44:25,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57189744] [2024-11-12 21:44:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57189744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:25,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110931466] [2024-11-12 21:44:25,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:25,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:25,841 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:25,842 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:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:25,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 21:44:25,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:25,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110931466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:25,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583182270] [2024-11-12 21:44:25,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:25,889 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:44:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:44:25,942 INFO L87 Difference]: Start difference. First operand has 279 states, 278 states have (on average 1.8093525179856116) internal successors, (503), 278 states have internal predecessors, (503), 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:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:26,331 INFO L93 Difference]: Finished difference Result 452 states and 693 transitions. [2024-11-12 21:44:26,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 452 states and 693 transitions. [2024-11-12 21:44:26,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 420 [2024-11-12 21:44:26,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 452 states to 434 states and 675 transitions. [2024-11-12 21:44:26,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2024-11-12 21:44:26,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2024-11-12 21:44:26,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 675 transitions. [2024-11-12 21:44:26,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:26,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 434 states and 675 transitions. [2024-11-12 21:44:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 675 transitions. [2024-11-12 21:44:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 428. [2024-11-12 21:44:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 427 states have internal predecessors, (669), 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:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 669 transitions. [2024-11-12 21:44:26,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 428 states and 669 transitions. [2024-11-12 21:44:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 21:44:26,406 INFO L426 stractBuchiCegarLoop]: Abstraction has 428 states and 669 transitions. [2024-11-12 21:44:26,406 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:44:26,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 669 transitions. [2024-11-12 21:44:26,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 414 [2024-11-12 21:44:26,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:26,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:26,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:26,409 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:26,409 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_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:26,410 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:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2037071525, now seen corresponding path program 1 times [2024-11-12 21:44:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233240025] [2024-11-12 21:44:26,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233240025] [2024-11-12 21:44:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233240025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:26,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854783792] [2024-11-12 21:44:26,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:26,463 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:26,464 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:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:26,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:26,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854783792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:26,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 21:44:26,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171105969] [2024-11-12 21:44:26,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:26,528 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:26,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash -995637738, now seen corresponding path program 1 times [2024-11-12 21:44:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:26,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66010975] [2024-11-12 21:44:26,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66010975] [2024-11-12 21:44:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66010975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712447409] [2024-11-12 21:44:26,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:26,564 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:26,565 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:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:26,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:26,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712447409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:26,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129215741] [2024-11-12 21:44:26,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:26,671 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:26,671 INFO L87 Difference]: Start difference. First operand 428 states and 669 transitions. cyclomatic complexity: 242 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:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:26,681 INFO L93 Difference]: Finished difference Result 428 states and 668 transitions. [2024-11-12 21:44:26,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 668 transitions. [2024-11-12 21:44:26,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 414 [2024-11-12 21:44:26,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 668 transitions. [2024-11-12 21:44:26,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2024-11-12 21:44:26,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2024-11-12 21:44:26,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 668 transitions. [2024-11-12 21:44:26,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:26,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 428 states and 668 transitions. [2024-11-12 21:44:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 668 transitions. [2024-11-12 21:44:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-11-12 21:44:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 428 states have (on average 1.560747663551402) internal successors, (668), 427 states have internal predecessors, (668), 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:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 668 transitions. [2024-11-12 21:44:26,712 INFO L240 hiAutomatonCegarLoop]: Abstraction has 428 states and 668 transitions. [2024-11-12 21:44:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:26,713 INFO L426 stractBuchiCegarLoop]: Abstraction has 428 states and 668 transitions. [2024-11-12 21:44:26,713 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:44:26,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 668 transitions. [2024-11-12 21:44:26,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 414 [2024-11-12 21:44:26,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:26,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:26,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:26,716 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:26,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_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:26,716 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:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2024-11-12 21:44:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:26,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191239759] [2024-11-12 21:44:26,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:26,732 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:26,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -995637738, now seen corresponding path program 2 times [2024-11-12 21:44:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103451351] [2024-11-12 21:44:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103451351] [2024-11-12 21:44:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103451351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914676115] [2024-11-12 21:44:26,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:44:26,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:26,790 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:26,791 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:26,830 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:26,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:26,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2024-11-12 21:44:26,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94092710] [2024-11-12 21:44:26,831 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:26,831 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:26,832 INFO L87 Difference]: Start difference. First operand 428 states and 668 transitions. cyclomatic complexity: 241 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:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:26,925 INFO L93 Difference]: Finished difference Result 691 states and 1100 transitions. [2024-11-12 21:44:26,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 691 states and 1100 transitions. [2024-11-12 21:44:26,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 667 [2024-11-12 21:44:26,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 691 states to 691 states and 1100 transitions. [2024-11-12 21:44:26,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 691 [2024-11-12 21:44:26,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 691 [2024-11-12 21:44:26,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 691 states and 1100 transitions. [2024-11-12 21:44:26,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:26,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 691 states and 1100 transitions. [2024-11-12 21:44:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states and 1100 transitions. [2024-11-12 21:44:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2024-11-12 21:44:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 685 states have (on average 1.597080291970803) internal successors, (1094), 684 states have internal predecessors, (1094), 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:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2024-11-12 21:44:26,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 685 states and 1094 transitions. [2024-11-12 21:44:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:26,950 INFO L426 stractBuchiCegarLoop]: Abstraction has 685 states and 1094 transitions. [2024-11-12 21:44:26,950 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:44:26,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 685 states and 1094 transitions. [2024-11-12 21:44:26,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 661 [2024-11-12 21:44:26,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:26,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:26,953 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:26,953 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 21:44:26,954 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_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:26,954 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:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2024-11-12 21:44:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123110080] [2024-11-12 21:44:26,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:26,990 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 151895896, now seen corresponding path program 1 times [2024-11-12 21:44:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431859537] [2024-11-12 21:44:27,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,019 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:27,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -840624194, now seen corresponding path program 1 times [2024-11-12 21:44:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584982257] [2024-11-12 21:44:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584982257] [2024-11-12 21:44:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584982257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302759000] [2024-11-12 21:44:27,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:27,079 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:27,081 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:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:27,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:27,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:27,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:27,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302759000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:27,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:27,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:27,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169725800] [2024-11-12 21:44:27,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:27,219 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. cyclomatic complexity: 412 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:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:27,281 INFO L93 Difference]: Finished difference Result 1288 states and 2056 transitions. [2024-11-12 21:44:27,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1288 states and 2056 transitions. [2024-11-12 21:44:27,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1255 [2024-11-12 21:44:27,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1288 states to 1288 states and 2056 transitions. [2024-11-12 21:44:27,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1288 [2024-11-12 21:44:27,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1288 [2024-11-12 21:44:27,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1288 states and 2056 transitions. [2024-11-12 21:44:27,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:27,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1288 states and 2056 transitions. [2024-11-12 21:44:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states and 2056 transitions. [2024-11-12 21:44:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1100. [2024-11-12 21:44:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1100 states have (on average 1.6036363636363635) internal successors, (1764), 1099 states have internal predecessors, (1764), 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:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1764 transitions. [2024-11-12 21:44:27,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1100 states and 1764 transitions. [2024-11-12 21:44:27,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:27,316 INFO L426 stractBuchiCegarLoop]: Abstraction has 1100 states and 1764 transitions. [2024-11-12 21:44:27,316 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:44:27,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1100 states and 1764 transitions. [2024-11-12 21:44:27,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1067 [2024-11-12 21:44:27,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:27,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:27,321 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:27,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:44:27,321 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_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:27,322 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:27,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2024-11-12 21:44:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247080375] [2024-11-12 21:44:27,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,330 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 413796692, now seen corresponding path program 1 times [2024-11-12 21:44:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886974478] [2024-11-12 21:44:27,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,342 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -289555026, now seen corresponding path program 1 times [2024-11-12 21:44:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643487066] [2024-11-12 21:44:27,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,356 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:28,295 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:28,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:44:28 BoogieIcfgContainer [2024-11-12 21:44:28,396 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:44:28,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:44:28,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:44:28,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:44:28,397 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:25" (3/4) ... [2024-11-12 21:44:28,403 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:44:28,457 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:44:28,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:44:28,458 INFO L158 Benchmark]: Toolchain (without parser) took 4406.75ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 161.3MB in the beginning and 193.9MB in the end (delta: -32.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,458 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:44:28,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.59ms. Allocated memory is still 190.8MB. Free memory was 161.1MB in the beginning and 139.8MB in the end (delta: 21.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.01ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 136.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,458 INFO L158 Benchmark]: Boogie Preprocessor took 63.12ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 131.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,458 INFO L158 Benchmark]: RCFGBuilder took 845.16ms. Allocated memory is still 190.8MB. Free memory was 131.4MB in the beginning and 140.4MB in the end (delta: -9.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,459 INFO L158 Benchmark]: BuchiAutomizer took 3014.63ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 139.3MB in the beginning and 200.2MB in the end (delta: -60.9MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,459 INFO L158 Benchmark]: Witness Printer took 60.88ms. Allocated memory is still 241.2MB. Free memory was 199.3MB in the beginning and 193.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 21:44:28,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.59ms. Allocated memory is still 190.8MB. Free memory was 161.1MB in the beginning and 139.8MB in the end (delta: 21.3MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.01ms. Allocated memory is still 190.8MB. Free memory was 139.8MB in the beginning and 136.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.12ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 131.4MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 845.16ms. Allocated memory is still 190.8MB. Free memory was 131.4MB in the beginning and 140.4MB in the end (delta: -9.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 3014.63ms. Allocated memory was 190.8MB in the beginning and 241.2MB in the end (delta: 50.3MB). Free memory was 139.3MB in the beginning and 200.2MB in the end (delta: -60.9MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * Witness Printer took 60.88ms. Allocated memory is still 241.2MB. Free memory was 199.3MB in the beginning and 193.9MB in the end (delta: 5.3MB). 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 1100 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.3s. 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, 200 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, 1991 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1991 mSDsluCounter, 2972 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1005 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1967 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: 1124]: 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 ; [L31] int s_run_st ; [L32] int s_run_i ; [L33] int s_run_pc ; [L34] int c_m_lock ; [L35] int c_m_ev ; [L36] int c_req_type ; [L37] int c_req_a ; [L38] int c_req_d ; [L39] int c_rsp_type ; [L40] int c_rsp_status ; [L41] int c_rsp_d ; [L42] int c_empty_req ; [L43] int c_empty_rsp ; [L44] int c_read_req_ev ; [L45] int c_write_req_ev ; [L46] int c_read_rsp_ev ; [L47] int c_write_rsp_ev ; [L48] static int d_t ; [L49] static int a_t ; [L50] static int req_t_type ; [L51] static int req_t_a ; [L52] static int req_t_d ; [L53] static int rsp_t_type ; [L54] static int rsp_t_status ; [L55] static int rsp_t_d ; [L56] static int req_tt_type ; [L57] static int req_tt_a ; [L58] static int req_tt_d ; [L59] static int rsp_tt_type ; [L60] static int rsp_tt_status ; [L61] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] 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_run_i=0, s_run_pc=0, s_run_st=0] [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1376] CALL start_simulation() [L1173] int kernel_st ; [L1176] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1177] COND TRUE (int )m_run_i == 1 [L1178] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1182] COND TRUE (int )s_run_i == 1 [L1183] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1187] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1195] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1203] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1211] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1219] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1227] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1241] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1249] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1260] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1263] kernel_st = 1 [L1264] CALL eval() [L1119] int tmp ; [L1120] 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_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1124]: 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 ; [L31] int s_run_st ; [L32] int s_run_i ; [L33] int s_run_pc ; [L34] int c_m_lock ; [L35] int c_m_ev ; [L36] int c_req_type ; [L37] int c_req_a ; [L38] int c_req_d ; [L39] int c_rsp_type ; [L40] int c_rsp_status ; [L41] int c_rsp_d ; [L42] int c_empty_req ; [L43] int c_empty_rsp ; [L44] int c_read_req_ev ; [L45] int c_write_req_ev ; [L46] int c_read_rsp_ev ; [L47] int c_write_rsp_ev ; [L48] static int d_t ; [L49] static int a_t ; [L50] static int req_t_type ; [L51] static int req_t_a ; [L52] static int req_t_d ; [L53] static int rsp_t_type ; [L54] static int rsp_t_status ; [L55] static int rsp_t_d ; [L56] static int req_tt_type ; [L57] static int req_tt_a ; [L58] static int req_tt_d ; [L59] static int rsp_tt_type ; [L60] static int rsp_tt_status ; [L61] static int rsp_tt_d ; [L850] static int req_t_type___0 ; [L851] static int req_t_a___0 ; [L852] static int req_t_d___0 ; [L853] static int rsp_t_type___0 ; [L854] static int rsp_t_status___0 ; [L855] 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_run_i=0, s_run_pc=0, s_run_st=0] [L1357] int __retres1 ; [L1361] c_m_lock = 0 [L1362] c_m_ev = 2 [L1364] m_run_i = 1 [L1365] m_run_pc = 0 [L1366] s_run_i = 1 [L1367] s_run_pc = 0 [L1368] c_empty_req = 1 [L1369] c_empty_rsp = 1 [L1370] c_read_req_ev = 2 [L1371] c_write_req_ev = 2 [L1372] c_read_rsp_ev = 2 [L1373] c_write_rsp_ev = 2 [L1374] c_m_lock = 0 [L1375] c_m_ev = 2 [L1376] CALL start_simulation() [L1173] int kernel_st ; [L1176] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1177] COND TRUE (int )m_run_i == 1 [L1178] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1182] COND TRUE (int )s_run_i == 1 [L1183] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1187] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1195] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1203] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1211] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1219] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1227] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1241] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1249] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1260] 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_run_i=1, s_run_pc=0, s_run_st=0] [L1263] kernel_st = 1 [L1264] CALL eval() [L1119] int tmp ; [L1120] 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_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1124] COND TRUE 1 [L1126] COND TRUE (int )m_run_st == 0 [L1135] COND TRUE (int )m_run_st == 0 [L1137] tmp = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp)) [L1150] COND TRUE (int )s_run_st == 0 [L1152] tmp___0 = __VERIFIER_nondet_int() [L1154] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:44:28,486 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:28,689 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:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 21:44:29,089 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:29,290 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:29,492 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:29,695 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)