./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.4.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.4.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 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:44:27,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:44:27,377 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:27,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:44:27,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:44:27,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:44:27,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:44:27,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:44:27,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:44:27,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:44:27,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:44:27,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:44:27,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:44:27,420 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:44:27,422 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:44:27,422 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:44:27,422 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:44:27,423 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:44:27,423 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:44:27,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:44:27,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:44:27,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:44:27,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:44:27,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:44:27,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:44:27,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:44:27,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:44:27,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:44:27,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:44:27,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:44:27,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:44:27,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:44:27,431 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:44:27,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:44:27,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:44:27,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:44:27,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:44:27,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:44:27,432 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:44:27,433 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 -> 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5 [2024-11-12 21:44:27,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:44:27,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:44:27,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:44:27,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:44:27,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:44:27,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2024-11-12 21:44:29,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:44:29,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:44:29,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2024-11-12 21:44:29,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774cafc1d/0aa80589c243469fadcf1991829101fb/FLAG6d786585e [2024-11-12 21:44:29,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774cafc1d/0aa80589c243469fadcf1991829101fb [2024-11-12 21:44:29,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:44:29,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:44:29,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:29,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:44:29,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:44:29,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:29" (1/1) ... [2024-11-12 21:44:29,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac19381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:29, skipping insertion in model container [2024-11-12 21:44:29,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:29" (1/1) ... [2024-11-12 21:44:29,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:44:29,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:29,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:44:30,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:30,071 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:44:30,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:30 WrapperNode [2024-11-12 21:44:30,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:30,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:30,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:44:30,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:44:30,079 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:30" (1/1) ... [2024-11-12 21:44:30,089 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:30" (1/1) ... [2024-11-12 21:44:30,132 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 884 [2024-11-12 21:44:30,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:30,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:44:30,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:44:30,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:44:30,146 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:30" (1/1) ... [2024-11-12 21:44:30,146 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:30" (1/1) ... [2024-11-12 21:44:30,150 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:30" (1/1) ... [2024-11-12 21:44:30,175 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:30,176 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:30" (1/1) ... [2024-11-12 21:44:30,176 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:30" (1/1) ... [2024-11-12 21:44:30,190 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:30" (1/1) ... [2024-11-12 21:44:30,205 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:30" (1/1) ... [2024-11-12 21:44:30,208 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:30" (1/1) ... [2024-11-12 21:44:30,218 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:30" (1/1) ... [2024-11-12 21:44:30,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:44:30,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:44:30,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:44:30,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:44:30,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:30" (1/1) ... [2024-11-12 21:44:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:44:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:30,255 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:30,258 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:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:44:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:44:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:44:30,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:44:30,390 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:44:30,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:44:31,263 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-12 21:44:31,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:44:31,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:44:31,293 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-12 21:44:31,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:31 BoogieIcfgContainer [2024-11-12 21:44:31,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:44:31,295 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:44:31,296 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:44:31,300 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:44:31,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:31,301 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:44:29" (1/3) ... [2024-11-12 21:44:31,302 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a505d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:31, skipping insertion in model container [2024-11-12 21:44:31,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:31,302 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:30" (2/3) ... [2024-11-12 21:44:31,302 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a505d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:31, skipping insertion in model container [2024-11-12 21:44:31,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:31,302 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:31" (3/3) ... [2024-11-12 21:44:31,304 INFO L332 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c [2024-11-12 21:44:31,378 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:44:31,378 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:44:31,379 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:44:31,379 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:44:31,379 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:44:31,379 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:44:31,380 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:44:31,380 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:44:31,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 283 states, 282 states have (on average 1.8120567375886525) internal successors, (511), 282 states have internal predecessors, (511), 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:31,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 259 [2024-11-12 21:44:31,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:31,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:31,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:31,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:31,443 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:44:31,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 283 states, 282 states have (on average 1.8120567375886525) internal successors, (511), 282 states have internal predecessors, (511), 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:31,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 259 [2024-11-12 21:44:31,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:31,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:31,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:31,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:31,476 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_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:31,477 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !true;" "havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3;" "assume 1 == ~m_run_pc~0;" "assume 1 == ~c_m_ev~0;~m_run_st~0 := 0;" "assume !(2 == ~s_run_pc~0);" "assume !(1 == ~s_run_pc~0);" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:31,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2024-11-12 21:44:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458097961] [2024-11-12 21:44:31,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458097961] [2024-11-12 21:44:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458097961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673376593] [2024-11-12 21:44:31,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:31,766 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:31,768 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:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:31,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:44:31,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:31,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673376593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:31,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-12 21:44:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175550581] [2024-11-12 21:44:31,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:31,895 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash -42651983, now seen corresponding path program 1 times [2024-11-12 21:44:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107583024] [2024-11-12 21:44:31,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107583024] [2024-11-12 21:44:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107583024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762593398] [2024-11-12 21:44:31,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:31,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:31,927 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:31,929 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:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:31,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 21:44:31,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:31,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:31,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762593398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:31,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:31,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94519242] [2024-11-12 21:44:31,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:31,986 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 21:44:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 21:44:32,033 INFO L87 Difference]: Start difference. First operand has 283 states, 282 states have (on average 1.8120567375886525) internal successors, (511), 282 states have internal predecessors, (511), 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:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:32,452 INFO L93 Difference]: Finished difference Result 460 states and 709 transitions. [2024-11-12 21:44:32,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 709 transitions. [2024-11-12 21:44:32,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 428 [2024-11-12 21:44:32,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 442 states and 691 transitions. [2024-11-12 21:44:32,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2024-11-12 21:44:32,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2024-11-12 21:44:32,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 691 transitions. [2024-11-12 21:44:32,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:32,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 691 transitions. [2024-11-12 21:44:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 691 transitions. [2024-11-12 21:44:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2024-11-12 21:44:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 436 states have (on average 1.5711009174311927) internal successors, (685), 435 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 685 transitions. [2024-11-12 21:44:32,539 INFO L240 hiAutomatonCegarLoop]: Abstraction has 436 states and 685 transitions. [2024-11-12 21:44:32,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 21:44:32,545 INFO L426 stractBuchiCegarLoop]: Abstraction has 436 states and 685 transitions. [2024-11-12 21:44:32,545 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:44:32,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 685 transitions. [2024-11-12 21:44:32,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 422 [2024-11-12 21:44:32,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:32,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:32,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,550 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:32,550 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_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:32,551 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:32,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2037071525, now seen corresponding path program 1 times [2024-11-12 21:44:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:32,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444284702] [2024-11-12 21:44:32,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444284702] [2024-11-12 21:44:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444284702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297877676] [2024-11-12 21:44:32,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:32,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:32,619 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:32,620 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:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:32,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:32,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297877676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:32,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:32,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-12 21:44:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092634948] [2024-11-12 21:44:32,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:32,722 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:44:32,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -761949546, now seen corresponding path program 1 times [2024-11-12 21:44:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763588330] [2024-11-12 21:44:32,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763588330] [2024-11-12 21:44:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763588330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093584850] [2024-11-12 21:44:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:32,788 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:32,791 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:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:32,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:32,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:32,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:32,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093584850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:32,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738479880] [2024-11-12 21:44:32,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:32,907 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:32,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:32,908 INFO L87 Difference]: Start difference. First operand 436 states and 685 transitions. cyclomatic complexity: 250 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:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:32,919 INFO L93 Difference]: Finished difference Result 436 states and 684 transitions. [2024-11-12 21:44:32,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 436 states and 684 transitions. [2024-11-12 21:44:32,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 422 [2024-11-12 21:44:32,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 436 states to 436 states and 684 transitions. [2024-11-12 21:44:32,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2024-11-12 21:44:32,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2024-11-12 21:44:32,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 684 transitions. [2024-11-12 21:44:32,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:32,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 436 states and 684 transitions. [2024-11-12 21:44:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 684 transitions. [2024-11-12 21:44:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2024-11-12 21:44:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 436 states have (on average 1.5688073394495412) internal successors, (684), 435 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 684 transitions. [2024-11-12 21:44:32,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 436 states and 684 transitions. [2024-11-12 21:44:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:32,958 INFO L426 stractBuchiCegarLoop]: Abstraction has 436 states and 684 transitions. [2024-11-12 21:44:32,958 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:44:32,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 684 transitions. [2024-11-12 21:44:32,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 422 [2024-11-12 21:44:32,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:32,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:32,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:32,961 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:32,962 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_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:32,962 INFO L749 eck$LassoCheckResult]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !false;" "assume !(0 == ~m_run_st~0);" "assume !(0 == ~s_run_st~0);" "havoc eval_#t~nondet5#1, eval_#t~nondet6#1, eval_~tmp~0#1, eval_~tmp___0~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;start_simulation_~kernel_st~0#1 := 3;" "assume !(1 == ~m_run_pc~0);" "assume !(2 == ~m_run_pc~0);" "assume !(3 == ~m_run_pc~0);" "assume !(4 == ~m_run_pc~0);" "assume !(5 == ~m_run_pc~0);" "assume !(6 == ~m_run_pc~0);" "assume 2 == ~s_run_pc~0;" "assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0;" "assume 0 == ~m_run_st~0;" [2024-11-12 21:44:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2024-11-12 21:44:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056408824] [2024-11-12 21:44:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,012 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash -761957761, now seen corresponding path program 1 times [2024-11-12 21:44:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268910819] [2024-11-12 21:44:33,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268910819] [2024-11-12 21:44:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268910819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462038602] [2024-11-12 21:44:33,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:33,076 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:33,077 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:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:33,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:33,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462038602] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:33,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63034769] [2024-11-12 21:44:33,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:33,164 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:33,164 INFO L87 Difference]: Start difference. First operand 436 states and 684 transitions. cyclomatic complexity: 249 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:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:33,279 INFO L93 Difference]: Finished difference Result 707 states and 1132 transitions. [2024-11-12 21:44:33,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 707 states and 1132 transitions. [2024-11-12 21:44:33,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 683 [2024-11-12 21:44:33,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 707 states to 707 states and 1132 transitions. [2024-11-12 21:44:33,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 707 [2024-11-12 21:44:33,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 707 [2024-11-12 21:44:33,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 1132 transitions. [2024-11-12 21:44:33,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:33,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 707 states and 1132 transitions. [2024-11-12 21:44:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 1132 transitions. [2024-11-12 21:44:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 701. [2024-11-12 21:44:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 701 states have (on average 1.6062767475035664) internal successors, (1126), 700 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1126 transitions. [2024-11-12 21:44:33,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 701 states and 1126 transitions. [2024-11-12 21:44:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:33,323 INFO L426 stractBuchiCegarLoop]: Abstraction has 701 states and 1126 transitions. [2024-11-12 21:44:33,324 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:44:33,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 1126 transitions. [2024-11-12 21:44:33,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 677 [2024-11-12 21:44:33,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:33,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:33,329 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:33,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 21:44:33,329 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_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:33,330 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:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2024-11-12 21:44:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434906583] [2024-11-12 21:44:33,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,352 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 151895916, now seen corresponding path program 1 times [2024-11-12 21:44:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467377672] [2024-11-12 21:44:33,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,372 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:33,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -840624174, now seen corresponding path program 1 times [2024-11-12 21:44:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038958535] [2024-11-12 21:44:33,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038958535] [2024-11-12 21:44:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038958535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658331666] [2024-11-12 21:44:33,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:33,435 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:33,437 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:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 21:44:33,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:33,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658331666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:33,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2024-11-12 21:44:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740255494] [2024-11-12 21:44:33,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 21:44:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 21:44:33,611 INFO L87 Difference]: Start difference. First operand 701 states and 1126 transitions. cyclomatic complexity: 428 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:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:33,704 INFO L93 Difference]: Finished difference Result 1320 states and 2120 transitions. [2024-11-12 21:44:33,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1320 states and 2120 transitions. [2024-11-12 21:44:33,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1287 [2024-11-12 21:44:33,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1320 states to 1320 states and 2120 transitions. [2024-11-12 21:44:33,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1320 [2024-11-12 21:44:33,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1320 [2024-11-12 21:44:33,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1320 states and 2120 transitions. [2024-11-12 21:44:33,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:33,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1320 states and 2120 transitions. [2024-11-12 21:44:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states and 2120 transitions. [2024-11-12 21:44:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1116. [2024-11-12 21:44:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1116 states have (on average 1.6093189964157706) internal successors, (1796), 1115 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 21:44:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1796 transitions. [2024-11-12 21:44:33,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1116 states and 1796 transitions. [2024-11-12 21:44:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 21:44:33,748 INFO L426 stractBuchiCegarLoop]: Abstraction has 1116 states and 1796 transitions. [2024-11-12 21:44:33,748 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:44:33,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1116 states and 1796 transitions. [2024-11-12 21:44:33,754 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1083 [2024-11-12 21:44:33,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:33,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:33,755 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:33,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-12 21:44:33,756 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_memory3~0 := 0;~s_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:33,756 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:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2024-11-12 21:44:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108416732] [2024-11-12 21:44:33,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,769 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:33,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash 413796712, now seen corresponding path program 1 times [2024-11-12 21:44:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480576897] [2024-11-12 21:44:33,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,809 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:33,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:33,817 INFO L85 PathProgramCache]: Analyzing trace with hash -289555006, now seen corresponding path program 1 times [2024-11-12 21:44:33,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:33,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301415736] [2024-11-12 21:44:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,829 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:33,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:35,118 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:35,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 09:44:35 BoogieIcfgContainer [2024-11-12 21:44:35,254 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-12 21:44:35,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 21:44:35,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 21:44:35,256 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 21:44:35,257 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:31" (3/4) ... [2024-11-12 21:44:35,259 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-12 21:44:35,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 21:44:35,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 21:44:35,358 INFO L158 Benchmark]: Toolchain (without parser) took 5786.91ms. Allocated memory was 134.2MB in the beginning and 205.5MB in the end (delta: 71.3MB). Free memory was 76.7MB in the beginning and 163.5MB in the end (delta: -86.8MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,358 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 21:44:35,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.52ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 76.5MB in the beginning and 137.7MB in the end (delta: -61.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 134.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,359 INFO L158 Benchmark]: Boogie Preprocessor took 89.32ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 129.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,359 INFO L158 Benchmark]: RCFGBuilder took 1070.21ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 75.9MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,359 INFO L158 Benchmark]: BuchiAutomizer took 3959.44ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 69.6MB in the end (delta: 5.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,360 INFO L158 Benchmark]: Witness Printer took 101.88ms. Allocated memory is still 205.5MB. Free memory was 69.6MB in the beginning and 163.5MB in the end (delta: -93.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-12 21:44:35,361 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.21ms. Allocated memory is still 134.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.52ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 76.5MB in the beginning and 137.7MB in the end (delta: -61.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 134.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.32ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 129.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1070.21ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 75.9MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3959.44ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 69.6MB in the end (delta: 5.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 101.88ms. Allocated memory is still 205.5MB. Free memory was 69.6MB in the beginning and 163.5MB in the end (delta: -93.9MB). Peak memory consumption was 6.8MB. 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 1116 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 216 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, 2039 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2039 mSDsluCounter, 3028 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1029 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1999 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: 1134]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L29] int s_memory1 ; [L30] int s_memory2 ; [L31] int s_memory3 ; [L33] int s_run_st ; [L34] int s_run_i ; [L35] int s_run_pc ; [L36] int c_m_lock ; [L37] int c_m_ev ; [L38] int c_req_type ; [L39] int c_req_a ; [L40] int c_req_d ; [L41] int c_rsp_type ; [L42] int c_rsp_status ; [L43] int c_rsp_d ; [L44] int c_empty_req ; [L45] int c_empty_rsp ; [L46] int c_read_req_ev ; [L47] int c_write_req_ev ; [L48] int c_read_rsp_ev ; [L49] int c_write_rsp_ev ; [L50] static int d_t ; [L51] static int a_t ; [L52] static int req_t_type ; [L53] static int req_t_a ; [L54] static int req_t_d ; [L55] static int rsp_t_type ; [L56] static int rsp_t_status ; [L57] static int rsp_t_d ; [L58] static int req_tt_type ; [L59] static int req_tt_a ; [L60] static int req_tt_d ; [L61] static int rsp_tt_type ; [L62] static int rsp_tt_status ; [L63] static int rsp_tt_d ; [L860] static int req_t_type___0 ; [L861] static int req_t_a___0 ; [L862] static int req_t_d___0 ; [L863] static int rsp_t_type___0 ; [L864] static int rsp_t_status___0 ; [L865] static int rsp_t_d___0 ; VAL [a_t=0, c_empty_req=0, c_empty_rsp=0, c_m_ev=0, c_m_lock=0, c_read_req_ev=0, c_read_rsp_ev=0, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=0, c_write_rsp_ev=0, d_t=0, m_run_i=0, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=0, s_run_pc=0, s_run_st=0] [L1367] int __retres1 ; [L1371] c_m_lock = 0 [L1372] c_m_ev = 2 [L1374] m_run_i = 1 [L1375] m_run_pc = 0 [L1376] s_run_i = 1 [L1377] s_run_pc = 0 [L1378] c_empty_req = 1 [L1379] c_empty_rsp = 1 [L1380] c_read_req_ev = 2 [L1381] c_write_req_ev = 2 [L1382] c_read_rsp_ev = 2 [L1383] c_write_rsp_ev = 2 [L1384] c_m_lock = 0 [L1385] c_m_ev = 2 [L1386] CALL start_simulation() [L1183] int kernel_st ; [L1186] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1187] COND TRUE (int )m_run_i == 1 [L1188] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1192] COND TRUE (int )s_run_i == 1 [L1193] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1197] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1205] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1213] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1221] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1229] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1237] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1251] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1259] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1270] COND TRUE 1 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1273] kernel_st = 1 [L1274] CALL eval() [L1129] int tmp ; [L1130] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1134] COND TRUE 1 [L1136] COND TRUE (int )m_run_st == 0 [L1145] COND TRUE (int )m_run_st == 0 [L1147] tmp = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp)) [L1160] COND TRUE (int )s_run_st == 0 [L1162] tmp___0 = __VERIFIER_nondet_int() [L1164] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1134]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int m_run_st ; [L26] int m_run_i ; [L27] int m_run_pc ; [L28] int s_memory0 ; [L29] int s_memory1 ; [L30] int s_memory2 ; [L31] int s_memory3 ; [L33] int s_run_st ; [L34] int s_run_i ; [L35] int s_run_pc ; [L36] int c_m_lock ; [L37] int c_m_ev ; [L38] int c_req_type ; [L39] int c_req_a ; [L40] int c_req_d ; [L41] int c_rsp_type ; [L42] int c_rsp_status ; [L43] int c_rsp_d ; [L44] int c_empty_req ; [L45] int c_empty_rsp ; [L46] int c_read_req_ev ; [L47] int c_write_req_ev ; [L48] int c_read_rsp_ev ; [L49] int c_write_rsp_ev ; [L50] static int d_t ; [L51] static int a_t ; [L52] static int req_t_type ; [L53] static int req_t_a ; [L54] static int req_t_d ; [L55] static int rsp_t_type ; [L56] static int rsp_t_status ; [L57] static int rsp_t_d ; [L58] static int req_tt_type ; [L59] static int req_tt_a ; [L60] static int req_tt_d ; [L61] static int rsp_tt_type ; [L62] static int rsp_tt_status ; [L63] static int rsp_tt_d ; [L860] static int req_t_type___0 ; [L861] static int req_t_a___0 ; [L862] static int req_t_d___0 ; [L863] static int rsp_t_type___0 ; [L864] static int rsp_t_status___0 ; [L865] static int rsp_t_d___0 ; VAL [a_t=0, c_empty_req=0, c_empty_rsp=0, c_m_ev=0, c_m_lock=0, c_read_req_ev=0, c_read_rsp_ev=0, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=0, c_write_rsp_ev=0, d_t=0, m_run_i=0, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=0, s_run_pc=0, s_run_st=0] [L1367] int __retres1 ; [L1371] c_m_lock = 0 [L1372] c_m_ev = 2 [L1374] m_run_i = 1 [L1375] m_run_pc = 0 [L1376] s_run_i = 1 [L1377] s_run_pc = 0 [L1378] c_empty_req = 1 [L1379] c_empty_rsp = 1 [L1380] c_read_req_ev = 2 [L1381] c_write_req_ev = 2 [L1382] c_read_rsp_ev = 2 [L1383] c_write_rsp_ev = 2 [L1384] c_m_lock = 0 [L1385] c_m_ev = 2 [L1386] CALL start_simulation() [L1183] int kernel_st ; [L1186] kernel_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1187] COND TRUE (int )m_run_i == 1 [L1188] m_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1192] COND TRUE (int )s_run_i == 1 [L1193] s_run_st = 0 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1197] COND FALSE !((int )m_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1205] COND FALSE !((int )m_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1213] COND FALSE !((int )m_run_pc == 3) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1221] COND FALSE !((int )m_run_pc == 4) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1229] COND FALSE !((int )m_run_pc == 5) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1237] COND FALSE !((int )m_run_pc == 6) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1251] COND FALSE !((int )s_run_pc == 2) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1259] COND FALSE !((int )s_run_pc == 1) VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1270] COND TRUE 1 VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] [L1273] kernel_st = 1 [L1274] CALL eval() [L1129] int tmp ; [L1130] int tmp___0 ; VAL [a_t=0, c_empty_req=1, c_empty_rsp=1, c_m_ev=2, c_m_lock=0, c_read_req_ev=2, c_read_rsp_ev=2, c_req_a=0, c_req_d=0, c_req_type=0, c_rsp_d=0, c_rsp_status=0, c_rsp_type=0, c_write_req_ev=2, c_write_rsp_ev=2, d_t=0, m_run_i=1, m_run_pc=0, m_run_st=0, req_t_a=0, req_t_a___0=0, req_t_d=0, req_t_d___0=0, req_t_type=0, req_t_type___0=0, req_tt_a=0, req_tt_d=0, req_tt_type=0, rsp_t_d=0, rsp_t_d___0=0, rsp_t_status=0, rsp_t_status___0=0, rsp_t_type=0, rsp_t_type___0=0, rsp_tt_d=0, rsp_tt_status=0, rsp_tt_type=0, s_memory0=0, s_memory1=0, s_memory2=0, s_memory3=0, s_run_i=1, s_run_pc=0, s_run_st=0] Loop: [L1134] COND TRUE 1 [L1136] COND TRUE (int )m_run_st == 0 [L1145] COND TRUE (int )m_run_st == 0 [L1147] tmp = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp)) [L1160] COND TRUE (int )s_run_st == 0 [L1162] tmp___0 = __VERIFIER_nondet_int() [L1164] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-12 21:44:35,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 21:44:35,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 21:44:35,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 21:44:35,988 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:36,188 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:36,388 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:36,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)