./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product32.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 af36d03ba4a1f12ddb625aab4b3f9906d028707aefb4e7150e31be2b1be8c075 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:48:13,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:48:13,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:48:13,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:48:13,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:48:13,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:48:13,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:48:13,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:48:13,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:48:13,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:48:13,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:48:13,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:48:13,280 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:48:13,280 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:48:13,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:48:13,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:48:13,282 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:48:13,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:48:13,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:48:13,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:48:13,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:48:13,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:48:13,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:48:13,284 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:48:13,284 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> af36d03ba4a1f12ddb625aab4b3f9906d028707aefb4e7150e31be2b1be8c075 [2025-01-10 07:48:13,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:48:13,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:48:13,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:48:13,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:48:13,526 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:48:13,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product32.cil.c [2025-01-10 07:48:14,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f77b0114/c199ae4606004566813c32d50564fddd/FLAG60e323d7a [2025-01-10 07:48:14,961 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:48:14,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product32.cil.c [2025-01-10 07:48:14,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f77b0114/c199ae4606004566813c32d50564fddd/FLAG60e323d7a [2025-01-10 07:48:14,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f77b0114/c199ae4606004566813c32d50564fddd [2025-01-10 07:48:14,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:48:14,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:48:14,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:48:14,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:48:15,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:48:15,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:48:14" (1/1) ... [2025-01-10 07:48:15,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8eb4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15, skipping insertion in model container [2025-01-10 07:48:15,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:48:14" (1/1) ... [2025-01-10 07:48:15,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:48:15,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:48:15,238 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:48:15,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-01-10 07:48:15,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [87] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [190] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [199] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [431] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [500] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [550] [2025-01-10 07:48:15,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [916] [2025-01-10 07:48:15,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:48:15,305 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:48:15,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15 WrapperNode [2025-01-10 07:48:15,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:48:15,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:48:15,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:48:15,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:48:15,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,338 INFO L138 Inliner]: procedures = 58, calls = 106, calls flagged for inlining = 59, calls inlined = 90, statements flattened = 551 [2025-01-10 07:48:15,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:48:15,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:48:15,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:48:15,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:48:15,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,365 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]. [2025-01-10 07:48:15,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:48:15,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:48:15,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:48:15,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:48:15,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (1/1) ... [2025-01-10 07:48:15,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:48:15,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:48:15,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:48:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:48:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:48:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:48:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:48:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:48:15,504 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:48:15,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:48:15,834 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-01-10 07:48:15,834 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:48:15,846 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:48:15,846 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:48:15,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:15 BoogieIcfgContainer [2025-01-10 07:48:15,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:48:15,847 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:48:15,848 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:48:15,851 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:48:15,851 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:15,851 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:48:14" (1/3) ... [2025-01-10 07:48:15,853 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10978e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:48:15, skipping insertion in model container [2025-01-10 07:48:15,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:15,853 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:15" (2/3) ... [2025-01-10 07:48:15,853 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10978e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:48:15, skipping insertion in model container [2025-01-10 07:48:15,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:15,853 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:15" (3/3) ... [2025-01-10 07:48:15,854 INFO L363 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product32.cil.c [2025-01-10 07:48:15,890 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:48:15,890 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:48:15,891 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:48:15,891 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:48:15,891 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:48:15,891 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:48:15,891 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:48:15,891 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:48:15,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 166 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 165 states have internal predecessors, (219), 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) [2025-01-10 07:48:15,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 107 [2025-01-10 07:48:15,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:15,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:15,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:15,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:15,923 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:48:15,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 166 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 165 states have internal predecessors, (219), 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) [2025-01-10 07:48:15,927 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 107 [2025-01-10 07:48:15,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:15,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:15,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:15,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:15,931 INFO L752 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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~retValue_acc~2#1, main_~tmp~0#1;havoc main_~retValue_acc~2#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret5#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;" "assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:15,932 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet19#1;test_~tmp~5#1 := test_#t~nondet19#1;havoc test_#t~nondet19#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet20#1;test_~tmp___0~1#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet21#1;test_~tmp___2~0#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet22#1;test_~tmp___1~0#1 := test_#t~nondet22#1;havoc test_#t~nondet22#1;" "assume !(0 != test_~tmp___1~0#1);" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;havoc isPumpRunning_~retValue_acc~4#1;isPumpRunning_~retValue_acc~4#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1;" "__utac_acc__Specification5_spec__2_#t~ret23#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23#1;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume !(0 != ~systemActive~0);" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;havoc __utac_acc__Specification5_spec__3_~tmp~6#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__3_#t~ret24#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~6#1 := __utac_acc__Specification5_spec__3_#t~ret24#1;havoc __utac_acc__Specification5_spec__3_#t~ret24#1;" "assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:15,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 1 times [2025-01-10 07:48:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152302722] [2025-01-10 07:48:15,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:15,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:15,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:15,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:15,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1325817403, now seen corresponding path program 1 times [2025-01-10 07:48:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012747583] [2025-01-10 07:48:16,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:48:16,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:48:16,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:48:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:48:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1629797486, now seen corresponding path program 1 times [2025-01-10 07:48:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210782050] [2025-01-10 07:48:16,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:48:16,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:48:16,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:48:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:48:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:48:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210782050] [2025-01-10 07:48:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210782050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:48:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:48:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:48:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656924868] [2025-01-10 07:48:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:48:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:48:16,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:48:16,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:48:16,329 INFO L87 Difference]: Start difference. First operand has 166 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 165 states have internal predecessors, (219), 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 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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) [2025-01-10 07:48:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:48:16,438 INFO L93 Difference]: Finished difference Result 382 states and 493 transitions. [2025-01-10 07:48:16,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 493 transitions. [2025-01-10 07:48:16,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 247 [2025-01-10 07:48:16,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 352 states and 463 transitions. [2025-01-10 07:48:16,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2025-01-10 07:48:16,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2025-01-10 07:48:16,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 463 transitions. [2025-01-10 07:48:16,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:48:16,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 352 states and 463 transitions. [2025-01-10 07:48:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 463 transitions. [2025-01-10 07:48:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 209. [2025-01-10 07:48:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 208 states have internal predecessors, (275), 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) [2025-01-10 07:48:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 275 transitions. [2025-01-10 07:48:16,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 275 transitions. [2025-01-10 07:48:16,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:48:16,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 209 states and 275 transitions. [2025-01-10 07:48:16,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:48:16,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 275 transitions. [2025-01-10 07:48:16,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 145 [2025-01-10 07:48:16,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:16,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:16,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:16,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:16,487 INFO L752 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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~retValue_acc~2#1, main_~tmp~0#1;havoc main_~retValue_acc~2#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret5#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;" "assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:16,487 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet19#1;test_~tmp~5#1 := test_#t~nondet19#1;havoc test_#t~nondet19#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet20#1;test_~tmp___0~1#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet21#1;test_~tmp___2~0#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1;" "assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1;" "assume { :end_inline_startSystem } true;" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;havoc isPumpRunning_~retValue_acc~4#1;isPumpRunning_~retValue_acc~4#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1;" "__utac_acc__Specification5_spec__2_#t~ret23#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23#1;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret7#1, processEnvironment_~tmp~2#1;havoc processEnvironment_~tmp~2#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__methaneQuery } true;havoc processEnvironment__wrappee__methaneQuery_#t~ret6#1, processEnvironment__wrappee__methaneQuery_~tmp~1#1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment__wrappee__methaneQuery_#t~ret6#1, processEnvironment__wrappee__methaneQuery_~tmp~1#1;assume { :end_inline_processEnvironment__wrappee__methaneQuery } true;" "havoc processEnvironment_#t~ret7#1, processEnvironment_~tmp~2#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;havoc __utac_acc__Specification5_spec__3_~tmp~6#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__3_#t~ret24#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~6#1 := __utac_acc__Specification5_spec__3_#t~ret24#1;havoc __utac_acc__Specification5_spec__3_#t~ret24#1;" "assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 2 times [2025-01-10 07:48:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188169300] [2025-01-10 07:48:16,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:48:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:16,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:16,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:48:16,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:16,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:16,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -622363576, now seen corresponding path program 1 times [2025-01-10 07:48:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664148518] [2025-01-10 07:48:16,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:48:16,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:48:16,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:48:16,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:48:16,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 201302847, now seen corresponding path program 1 times [2025-01-10 07:48:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126002135] [2025-01-10 07:48:16,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:48:16,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:48:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:48:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:48:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:48:16,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126002135] [2025-01-10 07:48:16,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126002135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:48:16,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:48:16,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:48:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894548455] [2025-01-10 07:48:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:48:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:48:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:48:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:48:16,671 INFO L87 Difference]: Start difference. First operand 209 states and 275 transitions. cyclomatic complexity: 69 Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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) [2025-01-10 07:48:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:48:16,786 INFO L93 Difference]: Finished difference Result 408 states and 532 transitions. [2025-01-10 07:48:16,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 532 transitions. [2025-01-10 07:48:16,789 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 288 [2025-01-10 07:48:16,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 532 transitions. [2025-01-10 07:48:16,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 408 [2025-01-10 07:48:16,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2025-01-10 07:48:16,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 532 transitions. [2025-01-10 07:48:16,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:48:16,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 408 states and 532 transitions. [2025-01-10 07:48:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 532 transitions. [2025-01-10 07:48:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-01-10 07:48:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 408 states have (on average 1.303921568627451) internal successors, (532), 407 states have internal predecessors, (532), 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) [2025-01-10 07:48:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 532 transitions. [2025-01-10 07:48:16,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 408 states and 532 transitions. [2025-01-10 07:48:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:48:16,815 INFO L432 stractBuchiCegarLoop]: Abstraction has 408 states and 532 transitions. [2025-01-10 07:48:16,815 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:48:16,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 408 states and 532 transitions. [2025-01-10 07:48:16,818 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 288 [2025-01-10 07:48:16,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:16,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:16,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:16,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:16,818 INFO L752 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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~retValue_acc~2#1, main_~tmp~0#1;havoc main_~retValue_acc~2#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret5#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1;" "assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:16,818 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet19#1;test_~tmp~5#1 := test_#t~nondet19#1;havoc test_#t~nondet19#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet20#1;test_~tmp___0~1#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet21#1;test_~tmp___2~0#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1;" "assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1;" "assume { :end_inline_startSystem } true;" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;havoc isPumpRunning_~retValue_acc~4#1;isPumpRunning_~retValue_acc~4#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1;" "__utac_acc__Specification5_spec__2_#t~ret23#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret23#1;havoc __utac_acc__Specification5_spec__2_#t~ret23#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret23#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret7#1, processEnvironment_~tmp~2#1;havoc processEnvironment_~tmp~2#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__methaneQuery } true;havoc processEnvironment__wrappee__methaneQuery_#t~ret6#1, processEnvironment__wrappee__methaneQuery_~tmp~1#1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment__wrappee__methaneQuery_#t~ret6#1, processEnvironment__wrappee__methaneQuery_~tmp~1#1;assume { :end_inline_processEnvironment__wrappee__methaneQuery } true;" "havoc processEnvironment_#t~ret7#1, processEnvironment_~tmp~2#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;havoc __utac_acc__Specification5_spec__3_~tmp~6#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__3_#t~ret24#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~6#1 := __utac_acc__Specification5_spec__3_#t~ret24#1;havoc __utac_acc__Specification5_spec__3_#t~ret24#1;" "assume 2 != __utac_acc__Specification5_spec__3_~tmp~6#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;havoc isPumpRunning_~retValue_acc~4#1;isPumpRunning_~retValue_acc~4#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1;" "__utac_acc__Specification5_spec__3_#t~ret25#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~4#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification5_spec__3_~tmp___0~2#1 := __utac_acc__Specification5_spec__3_#t~ret25#1;havoc __utac_acc__Specification5_spec__3_#t~ret25#1;" "assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret24#1, __utac_acc__Specification5_spec__3_#t~ret25#1, __utac_acc__Specification5_spec__3_~tmp~6#1, __utac_acc__Specification5_spec__3_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 3 times [2025-01-10 07:48:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168329070] [2025-01-10 07:48:16,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:48:16,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:16,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:16,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:48:16,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:16,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1111945757, now seen corresponding path program 1 times [2025-01-10 07:48:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265262723] [2025-01-10 07:48:16,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:48:16,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:48:16,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:48:16,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:48:16,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 157504282, now seen corresponding path program 1 times [2025-01-10 07:48:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289633664] [2025-01-10 07:48:16,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:16,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 07:48:16,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:48:16,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 07:48:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:48:16,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:16,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:16,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:17,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:17,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:17,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:17,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:17,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:17,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:48:17 BoogieIcfgContainer [2025-01-10 07:48:17,543 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:48:17,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:48:17,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:48:17,544 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:48:17,544 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:15" (3/4) ... [2025-01-10 07:48:17,545 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:48:17,571 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:48:17,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:48:17,572 INFO L158 Benchmark]: Toolchain (without parser) took 2582.49ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 45.0MB in the end (delta: 66.6MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-01-10 07:48:17,572 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:48:17,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.59ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 93.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:48:17,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.89ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:48:17,573 INFO L158 Benchmark]: Boogie Preprocessor took 45.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:48:17,573 INFO L158 Benchmark]: RCFGBuilder took 461.57ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 62.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 07:48:17,573 INFO L158 Benchmark]: BuchiAutomizer took 1695.55ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 49.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-01-10 07:48:17,574 INFO L158 Benchmark]: Witness Printer took 28.13ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 45.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:48:17,575 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.88ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.59ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 93.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.89ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 461.57ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 62.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 1695.55ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 49.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 28.13ms. Allocated memory is still 142.6MB. Free memory was 49.1MB in the beginning and 45.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [87] - GenericResultAtLocation [Line: 190]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [190] - GenericResultAtLocation [Line: 199]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [199] - GenericResultAtLocation [Line: 431]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [431] - GenericResultAtLocation [Line: 500]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [500] - GenericResultAtLocation [Line: 550]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [550] - GenericResultAtLocation [Line: 916]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [916] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 408 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 143 StatesRemovedByMinimization, 1 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, 722 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 1595 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1206 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 389 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 444]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L88] int cleanupTimeShifts = 4; [L209] int pumpRunning = 0; [L210] int systemActive = 1; [L502] int switchedOnBeforeTS ; [L720] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L917] int waterLevel = 1; [L918] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L168] int retValue_acc ; [L169] int tmp ; [L173] FCALL select_helpers() [L174] FCALL select_features() [L175] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L175] RET, EXPR valid_product() [L175] tmp = valid_product() [L177] COND TRUE \read(tmp) [L179] FCALL setup() [L180] CALL runTest() [L161] CALL __utac_acc__Specification5_spec__1() [L507] switchedOnBeforeTS = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L161] RET __utac_acc__Specification5_spec__1() [L162] CALL test() [L433] int splverifierCounter ; [L434] int tmp ; [L435] int tmp___0 ; [L436] int tmp___1 ; [L437] int tmp___2 ; [L440] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] Loop: [L444] COND TRUE splverifierCounter < 4 [L450] tmp = __VERIFIER_nondet_int() [L452] COND FALSE !(\read(tmp)) [L460] tmp___0 = __VERIFIER_nondet_int() [L462] COND FALSE !(\read(tmp___0)) [L470] tmp___2 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp___2) [L474] CALL startSystem() [L427] systemActive = 1 [L474] RET startSystem() [L489] CALL timeShift() [L219] CALL __utac_acc__Specification5_spec__2() [L516] CALL, EXPR isPumpRunning() [L345] int retValue_acc ; [L348] retValue_acc = pumpRunning [L349] return (retValue_acc); [L516] RET, EXPR isPumpRunning() [L516] switchedOnBeforeTS = isPumpRunning() [L219] RET __utac_acc__Specification5_spec__2() [L221] COND FALSE !(\read(pumpRunning)) [L228] COND TRUE \read(systemActive) [L230] CALL processEnvironment() [L276] int tmp ; [L279] COND FALSE !(\read(pumpRunning)) [L294] CALL processEnvironment__wrappee__methaneQuery() [L250] int tmp ; [L253] COND FALSE !(\read(pumpRunning)) [L268] FCALL processEnvironment__wrappee__base() [L294] RET processEnvironment__wrappee__methaneQuery() [L230] RET processEnvironment() [L236] CALL __utac_acc__Specification5_spec__3() [L522] int tmp ; [L523] int tmp___0 ; [L527] CALL, EXPR getWaterLevel() [L988] int retValue_acc ; [L991] retValue_acc = waterLevel [L992] return (retValue_acc); [L527] RET, EXPR getWaterLevel() [L527] tmp = getWaterLevel() [L529] COND TRUE tmp != 2 [L531] CALL, EXPR isPumpRunning() [L345] int retValue_acc ; [L348] retValue_acc = pumpRunning [L349] return (retValue_acc); [L531] RET, EXPR isPumpRunning() [L531] tmp___0 = isPumpRunning() [L533] COND FALSE !(\read(tmp___0)) [L236] RET __utac_acc__Specification5_spec__3() [L489] RET timeShift() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 444]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L88] int cleanupTimeShifts = 4; [L209] int pumpRunning = 0; [L210] int systemActive = 1; [L502] int switchedOnBeforeTS ; [L720] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L917] int waterLevel = 1; [L918] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L168] int retValue_acc ; [L169] int tmp ; [L173] FCALL select_helpers() [L174] FCALL select_features() [L175] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L175] RET, EXPR valid_product() [L175] tmp = valid_product() [L177] COND TRUE \read(tmp) [L179] FCALL setup() [L180] CALL runTest() [L161] CALL __utac_acc__Specification5_spec__1() [L507] switchedOnBeforeTS = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L161] RET __utac_acc__Specification5_spec__1() [L162] CALL test() [L433] int splverifierCounter ; [L434] int tmp ; [L435] int tmp___0 ; [L436] int tmp___1 ; [L437] int tmp___2 ; [L440] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] Loop: [L444] COND TRUE splverifierCounter < 4 [L450] tmp = __VERIFIER_nondet_int() [L452] COND FALSE !(\read(tmp)) [L460] tmp___0 = __VERIFIER_nondet_int() [L462] COND FALSE !(\read(tmp___0)) [L470] tmp___2 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp___2) [L474] CALL startSystem() [L427] systemActive = 1 [L474] RET startSystem() [L489] CALL timeShift() [L219] CALL __utac_acc__Specification5_spec__2() [L516] CALL, EXPR isPumpRunning() [L345] int retValue_acc ; [L348] retValue_acc = pumpRunning [L349] return (retValue_acc); [L516] RET, EXPR isPumpRunning() [L516] switchedOnBeforeTS = isPumpRunning() [L219] RET __utac_acc__Specification5_spec__2() [L221] COND FALSE !(\read(pumpRunning)) [L228] COND TRUE \read(systemActive) [L230] CALL processEnvironment() [L276] int tmp ; [L279] COND FALSE !(\read(pumpRunning)) [L294] CALL processEnvironment__wrappee__methaneQuery() [L250] int tmp ; [L253] COND FALSE !(\read(pumpRunning)) [L268] FCALL processEnvironment__wrappee__base() [L294] RET processEnvironment__wrappee__methaneQuery() [L230] RET processEnvironment() [L236] CALL __utac_acc__Specification5_spec__3() [L522] int tmp ; [L523] int tmp___0 ; [L527] CALL, EXPR getWaterLevel() [L988] int retValue_acc ; [L991] retValue_acc = waterLevel [L992] return (retValue_acc); [L527] RET, EXPR getWaterLevel() [L527] tmp = getWaterLevel() [L529] COND TRUE tmp != 2 [L531] CALL, EXPR isPumpRunning() [L345] int retValue_acc ; [L348] retValue_acc = pumpRunning [L349] return (retValue_acc); [L531] RET, EXPR isPumpRunning() [L531] tmp___0 = isPumpRunning() [L533] COND FALSE !(\read(tmp___0)) [L236] RET __utac_acc__Specification5_spec__3() [L489] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:48:17,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)