./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/product-lines/minepump_spec4_product42.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 190527f0b5c755657048457e241e1db06174c0bd15c9c37dddb3c55b0e7d73ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:16:46,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:16:46,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:16:46,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:16:46,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:16:46,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:16:46,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:16:46,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:16:46,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:16:46,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:16:46,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:16:46,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:16:46,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:16:46,154 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:16:46,154 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:16:46,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:16:46,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:16:46,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:16:46,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:16:46,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:16:46,157 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:16:46,157 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/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 -> 190527f0b5c755657048457e241e1db06174c0bd15c9c37dddb3c55b0e7d73ce [2025-03-04 16:16:46,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:16:46,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:16:46,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:16:46,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:16:46,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:16:46,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c [2025-03-04 16:16:47,572 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b25fc321/e85e945092f94d34a4bea63fe08c95d7/FLAGc69fc6292 [2025-03-04 16:16:47,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:16:47,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product42.cil.c [2025-03-04 16:16:47,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b25fc321/e85e945092f94d34a4bea63fe08c95d7/FLAGc69fc6292 [2025-03-04 16:16:47,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b25fc321/e85e945092f94d34a4bea63fe08c95d7 [2025-03-04 16:16:47,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:16:47,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:16:47,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:16:47,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:16:47,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:16:47,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:16:47" (1/1) ... [2025-03-04 16:16:47,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1781c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:47, skipping insertion in model container [2025-03-04 16:16:47,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:16:47" (1/1) ... [2025-03-04 16:16:47,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:16:48,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:16:48,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:16:48,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [554] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [582] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [681] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [749] [2025-03-04 16:16:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [929] [2025-03-04 16:16:48,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:16:48,148 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:16:48,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48 WrapperNode [2025-03-04 16:16:48,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:16:48,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:16:48,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:16:48,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:16:48,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,198 INFO L138 Inliner]: procedures = 54, calls = 97, calls flagged for inlining = 50, calls inlined = 60, statements flattened = 399 [2025-03-04 16:16:48,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:16:48,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:16:48,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:16:48,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:16:48,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,217 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-03-04 16:16:48,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:16:48,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:16:48,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:16:48,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:16:48,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:16:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:16:48,273 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) [2025-03-04 16:16:48,276 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 [2025-03-04 16:16:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:16:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:16:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:16:48,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:16:48,347 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:16:48,348 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-5: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~0#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L863-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L863-3: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L863-5: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L551-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L918-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L918-3: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L918-5: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L854-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~9#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L854-3: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~9#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L854-5: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~9#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-3: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-5: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L678-1: main_#res#1 := main_~retValue_acc~8#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-3: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; [2025-03-04 16:16:48,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133-5: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; [2025-03-04 16:16:48,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~0#1; [2025-03-04 16:16:48,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-3: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~0#1; [2025-03-04 16:16:48,631 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 16:16:48,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:16:48,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:16:48,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:16:48,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:48 BoogieIcfgContainer [2025-03-04 16:16:48,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:16:48,641 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:16:48,641 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:16:48,644 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:16:48,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:48,645 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:16:47" (1/3) ... [2025-03-04 16:16:48,646 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176d399e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:16:48, skipping insertion in model container [2025-03-04 16:16:48,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:48,646 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48" (2/3) ... [2025-03-04 16:16:48,646 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176d399e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:16:48, skipping insertion in model container [2025-03-04 16:16:48,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:48,646 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:48" (3/3) ... [2025-03-04 16:16:48,647 INFO L363 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product42.cil.c [2025-03-04 16:16:48,682 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:16:48,682 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:16:48,682 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:16:48,682 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:16:48,682 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:16:48,682 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:16:48,682 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:16:48,682 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:16:48,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 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-03-04 16:16:48,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2025-03-04 16:16:48,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:48,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:48,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:48,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:48,703 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:16:48,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 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-03-04 16:16:48,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2025-03-04 16:16:48,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:48,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:48,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:48,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:48,712 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret35#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1;" "main_#t~ret35#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret35#1;havoc main_#t~ret35#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet36#1, test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#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-03-04 16:16:48,712 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet36#1;test_~tmp~5#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet37#1;test_~tmp___0~1#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet38#1;test_~tmp___2~0#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet39#1;test_~tmp___1~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___1~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume !(0 != ~systemActive~0);" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~3#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1;" "__utac_acc__Specification4_spec__1_#t~ret33#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~3#1 := __utac_acc__Specification4_spec__1_#t~ret33#1;havoc __utac_acc__Specification4_spec__1_#t~ret33#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:48,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1469913981, now seen corresponding path program 1 times [2025-03-04 16:16:48,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942919008] [2025-03-04 16:16:48,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:48,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:48,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:48,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:48,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:48,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:48,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:48,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:48,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash 217422022, now seen corresponding path program 1 times [2025-03-04 16:16:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206581886] [2025-03-04 16:16:48,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:16:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:16:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:48,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:48,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 16:16:48,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 16:16:48,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:48,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:48,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2025571262, now seen corresponding path program 1 times [2025-03-04 16:16:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94914996] [2025-03-04 16:16:48,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:48,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 16:16:48,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 16:16:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:48,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94914996] [2025-03-04 16:16:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94914996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 16:16:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53304178] [2025-03-04 16:16:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:49,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:49,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:16:49,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:16:49,091 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.347457627118644) internal successors, (159), 118 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-03-04 16:16:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:49,114 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2025-03-04 16:16:49,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 145 transitions. [2025-03-04 16:16:49,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2025-03-04 16:16:49,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 103 states and 134 transitions. [2025-03-04 16:16:49,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-03-04 16:16:49,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-03-04 16:16:49,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 134 transitions. [2025-03-04 16:16:49,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:49,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-03-04 16:16:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 134 transitions. [2025-03-04 16:16:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 16:16:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 102 states have internal predecessors, (134), 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-03-04 16:16:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-03-04 16:16:49,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-03-04 16:16:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:16:49,147 INFO L432 stractBuchiCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-03-04 16:16:49,147 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:16:49,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 134 transitions. [2025-03-04 16:16:49,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2025-03-04 16:16:49,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,148 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] [2025-03-04 16:16:49,148 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret35#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1;" "main_#t~ret35#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret35#1;havoc main_#t~ret35#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet36#1, test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#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-03-04 16:16:49,149 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet36#1;test_~tmp~5#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet37#1;test_~tmp___0~1#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet38#1;test_~tmp___2~0#1 := test_#t~nondet38#1;havoc test_#t~nondet38#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 !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~3#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1;" "__utac_acc__Specification4_spec__1_#t~ret33#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~3#1 := __utac_acc__Specification4_spec__1_#t~ret33#1;havoc __utac_acc__Specification4_spec__1_#t~ret33#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1469913981, now seen corresponding path program 2 times [2025-03-04 16:16:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512324955] [2025-03-04 16:16:49,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:16:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:16:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1545957566, now seen corresponding path program 1 times [2025-03-04 16:16:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069311310] [2025-03-04 16:16:49,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 16:16:49,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 16:16:49,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069311310] [2025-03-04 16:16:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069311310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:49,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:49,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:16:49,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697209327] [2025-03-04 16:16:49,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:49,198 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:49,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:16:49,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:16:49,200 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 6.333333333333333) 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) [2025-03-04 16:16:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:49,260 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2025-03-04 16:16:49,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 198 transitions. [2025-03-04 16:16:49,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2025-03-04 16:16:49,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 198 transitions. [2025-03-04 16:16:49,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2025-03-04 16:16:49,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2025-03-04 16:16:49,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 198 transitions. [2025-03-04 16:16:49,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:49,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2025-03-04 16:16:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 198 transitions. [2025-03-04 16:16:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 16:16:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 156 states have internal predecessors, (198), 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-03-04 16:16:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2025-03-04 16:16:49,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2025-03-04 16:16:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:16:49,279 INFO L432 stractBuchiCegarLoop]: Abstraction has 157 states and 198 transitions. [2025-03-04 16:16:49,280 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:16:49,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 198 transitions. [2025-03-04 16:16:49,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2025-03-04 16:16:49,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,283 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-03-04 16:16:49,283 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret35#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1;" "main_#t~ret35#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret35#1;havoc main_#t~ret35#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet36#1, test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#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-03-04 16:16:49,283 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet36#1;test_~tmp~5#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet37#1;test_~tmp___0~1#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet38#1;test_~tmp___2~0#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet39#1;test_~tmp___1~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___1~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~8#1;havoc isHighWaterLevel_~tmp___0~2#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;" "assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~2#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1;" "isHighWaterLevel_#t~ret51#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~8#1 := isHighWaterLevel_#t~ret51#1;havoc isHighWaterLevel_#t~ret51#1;" "assume 0 != isHighWaterLevel_~tmp~8#1;isHighWaterLevel_~tmp___0~2#1 := 0;" "isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~2#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1;" "processEnvironment_#t~ret40#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~6#1 := processEnvironment_#t~ret40#1;havoc processEnvironment_#t~ret40#1;" "assume !(0 != processEnvironment_~tmp~6#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~3#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1;" "__utac_acc__Specification4_spec__1_#t~ret33#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~3#1 := __utac_acc__Specification4_spec__1_#t~ret33#1;havoc __utac_acc__Specification4_spec__1_#t~ret33#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:49,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1469913981, now seen corresponding path program 3 times [2025-03-04 16:16:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121802220] [2025-03-04 16:16:49,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:16:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:16:49,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1100993367, now seen corresponding path program 1 times [2025-03-04 16:16:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979329282] [2025-03-04 16:16:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:16:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:16:49,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979329282] [2025-03-04 16:16:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979329282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:16:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509987182] [2025-03-04 16:16:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:49,349 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:49,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:16:49,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:16:49,350 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. cyclomatic complexity: 43 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-03-04 16:16:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:49,383 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2025-03-04 16:16:49,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 204 transitions. [2025-03-04 16:16:49,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 114 [2025-03-04 16:16:49,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 163 states and 204 transitions. [2025-03-04 16:16:49,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2025-03-04 16:16:49,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2025-03-04 16:16:49,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 204 transitions. [2025-03-04 16:16:49,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:49,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 204 transitions. [2025-03-04 16:16:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 204 transitions. [2025-03-04 16:16:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-04 16:16:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 162 states have internal predecessors, (204), 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-03-04 16:16:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2025-03-04 16:16:49,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 204 transitions. [2025-03-04 16:16:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:16:49,390 INFO L432 stractBuchiCegarLoop]: Abstraction has 163 states and 204 transitions. [2025-03-04 16:16:49,390 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:16:49,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 204 transitions. [2025-03-04 16:16:49,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 114 [2025-03-04 16:16:49,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,392 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,392 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-03-04 16:16:49,392 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret35#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1;" "main_#t~ret35#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret35#1;havoc main_#t~ret35#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet36#1, test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#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-03-04 16:16:49,392 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet36#1;test_~tmp~5#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet37#1;test_~tmp___0~1#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet38#1;test_~tmp___2~0#1 := test_#t~nondet38#1;havoc test_#t~nondet38#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 !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~8#1;havoc isHighWaterLevel_~tmp___0~2#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;" "assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~2#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1;" "isHighWaterLevel_#t~ret51#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~8#1 := isHighWaterLevel_#t~ret51#1;havoc isHighWaterLevel_#t~ret51#1;" "assume !(0 != isHighWaterLevel_~tmp~8#1);isHighWaterLevel_~tmp___0~2#1 := 1;" "isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~2#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1;" "processEnvironment_#t~ret40#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~6#1 := processEnvironment_#t~ret40#1;havoc processEnvironment_#t~ret40#1;" "assume !(0 != processEnvironment_~tmp~6#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~3#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1;" "__utac_acc__Specification4_spec__1_#t~ret33#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~3#1 := __utac_acc__Specification4_spec__1_#t~ret33#1;havoc __utac_acc__Specification4_spec__1_#t~ret33#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:49,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1469913981, now seen corresponding path program 4 times [2025-03-04 16:16:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234628593] [2025-03-04 16:16:49,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:16:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-04 16:16:49,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:16:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash 533707384, now seen corresponding path program 1 times [2025-03-04 16:16:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34563605] [2025-03-04 16:16:49,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:16:49,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:16:49,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:49,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:49,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34563605] [2025-03-04 16:16:49,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34563605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:49,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:49,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:16:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598772849] [2025-03-04 16:16:49,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:49,484 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:49,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:16:49,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:16:49,484 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. cyclomatic complexity: 43 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-03-04 16:16:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:49,543 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2025-03-04 16:16:49,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 213 transitions. [2025-03-04 16:16:49,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 120 [2025-03-04 16:16:49,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 172 states and 213 transitions. [2025-03-04 16:16:49,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2025-03-04 16:16:49,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2025-03-04 16:16:49,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 213 transitions. [2025-03-04 16:16:49,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:49,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 172 states and 213 transitions. [2025-03-04 16:16:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 213 transitions. [2025-03-04 16:16:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 16:16:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.2383720930232558) internal successors, (213), 171 states have internal predecessors, (213), 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-03-04 16:16:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 213 transitions. [2025-03-04 16:16:49,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 172 states and 213 transitions. [2025-03-04 16:16:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:16:49,557 INFO L432 stractBuchiCegarLoop]: Abstraction has 172 states and 213 transitions. [2025-03-04 16:16:49,557 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:16:49,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 213 transitions. [2025-03-04 16:16:49,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 120 [2025-03-04 16:16:49,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,559 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-03-04 16:16:49,559 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret35#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1;" "main_#t~ret35#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret35#1;havoc main_#t~ret35#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet36#1, test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#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-03-04 16:16:49,559 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet36#1;test_~tmp~5#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet37#1;test_~tmp___0~1#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet38#1;test_~tmp___2~0#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet39#1;test_~tmp___1~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___1~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;havoc isHighWaterLevel_~retValue_acc~11#1;havoc isHighWaterLevel_~tmp~8#1;havoc isHighWaterLevel_~tmp___0~2#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;" "assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1;" "isHighWaterLevel_#t~ret51#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~2#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~8#1 := isHighWaterLevel_#t~ret51#1;havoc isHighWaterLevel_#t~ret51#1;" "assume 0 != isHighWaterLevel_~tmp~8#1;isHighWaterLevel_~tmp___0~2#1 := 0;" "isHighWaterLevel_~retValue_acc~11#1 := isHighWaterLevel_~tmp___0~2#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1;" "processEnvironment_#t~ret40#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret51#1, isHighWaterLevel_~retValue_acc~11#1, isHighWaterLevel_~tmp~8#1, isHighWaterLevel_~tmp___0~2#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~6#1 := processEnvironment_#t~ret40#1;havoc processEnvironment_#t~ret40#1;" "assume !(0 != processEnvironment_~tmp~6#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret40#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~3#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1;" "__utac_acc__Specification4_spec__1_#t~ret33#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~3#1 := __utac_acc__Specification4_spec__1_#t~ret33#1;havoc __utac_acc__Specification4_spec__1_#t~ret33#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~3#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret33#1, __utac_acc__Specification4_spec__1_#t~ret34#1, __utac_acc__Specification4_spec__1_~tmp~3#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:49,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1469913981, now seen corresponding path program 5 times [2025-03-04 16:16:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841680143] [2025-03-04 16:16:49,562 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:16:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,573 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,573 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:16:49,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:49,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1687799381, now seen corresponding path program 1 times [2025-03-04 16:16:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998201649] [2025-03-04 16:16:49,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:16:49,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:16:49,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 16:16:49,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 16:16:49,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1197126055, now seen corresponding path program 1 times [2025-03-04 16:16:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446437812] [2025-03-04 16:16:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:16:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:16:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:49,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 16:16:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 16:16:49,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:16:50 BoogieIcfgContainer [2025-03-04 16:16:50,353 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:16:50,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:16:50,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:16:50,353 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:16:50,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:48" (3/4) ... [2025-03-04 16:16:50,355 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 16:16:50,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 16:16:50,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:16:50,391 INFO L158 Benchmark]: Toolchain (without parser) took 2549.01ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 74.7MB in the end (delta: 34.7MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-03-04 16:16:50,391 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:16:50,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.46ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 91.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:16:50,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.66ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:16:50,392 INFO L158 Benchmark]: Boogie Preprocessor took 24.98ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:16:50,392 INFO L158 Benchmark]: IcfgBuilder took 415.05ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 63.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 16:16:50,392 INFO L158 Benchmark]: BuchiAutomizer took 1711.57ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 78.7MB in the end (delta: -15.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:16:50,395 INFO L158 Benchmark]: Witness Printer took 36.38ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 74.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:16:50,396 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.46ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 91.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.66ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.98ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 415.05ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 63.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 1711.57ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 78.7MB in the end (delta: -15.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 36.38ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 74.7MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [150] - GenericResultAtLocation [Line: 516]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [516] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [554] - GenericResultAtLocation [Line: 582]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [582] - GenericResultAtLocation [Line: 681]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [681] - GenericResultAtLocation [Line: 749]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [749] - GenericResultAtLocation [Line: 929]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [929] * 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 5 locations. The remainder module has 172 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 234 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 1200 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 534 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 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: 693]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L320] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L583] int cleanupTimeShifts = 4; [L752] int pumpRunning = 0; [L753] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L659] int retValue_acc ; [L660] int tmp ; [L664] FCALL select_helpers() [L665] FCALL select_features() [L666] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L666] RET, EXPR valid_product() [L666] tmp = valid_product() [L668] COND TRUE \read(tmp) [L670] FCALL setup() [L671] CALL runTest() [L653] CALL test() [L684] int splverifierCounter ; [L685] int tmp ; [L686] int tmp___0 ; [L687] int tmp___1 ; [L688] int tmp___2 ; [L691] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L693] COND TRUE 1 [L695] COND TRUE splverifierCounter < 4 [L701] tmp = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp)) [L711] tmp___0 = __VERIFIER_nondet_int() [L713] COND FALSE !(\read(tmp___0)) [L721] tmp___2 = __VERIFIER_nondet_int() [L723] COND FALSE !(\read(tmp___2)) [L729] tmp___1 = __VERIFIER_nondet_int() [L731] COND TRUE \read(tmp___1) [L738] CALL timeShift() [L759] COND FALSE !(\read(pumpRunning)) [L766] COND TRUE \read(systemActive) [L768] CALL processEnvironment() [L788] int tmp ; [L791] COND TRUE ! pumpRunning [L793] CALL, EXPR isHighWaterLevel() [L903] int retValue_acc ; [L904] int tmp ; [L905] int tmp___0 ; [L909] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; [L140] COND TRUE waterLevel < 2 [L141] retValue_acc = 1 [L142] return (retValue_acc); [L909] RET, EXPR isHighWaterSensorDry() [L909] tmp = isHighWaterSensorDry() [L911] COND TRUE \read(tmp) [L912] tmp___0 = 0 [L916] retValue_acc = tmp___0 [L917] return (retValue_acc); [L793] RET, EXPR isHighWaterLevel() [L793] tmp = isHighWaterLevel() [L795] COND FALSE !(\read(tmp)) [L801] FCALL processEnvironment__wrappee__base() [L768] RET processEnvironment() [L774] CALL __utac_acc__Specification4_spec__1() [L558] int tmp ; [L559] int tmp___0 ; [L563] CALL, EXPR getWaterLevel() [L128] int retValue_acc ; [L131] retValue_acc = waterLevel [L132] return (retValue_acc); [L563] RET, EXPR getWaterLevel() [L563] tmp = getWaterLevel() [L565] COND FALSE !(tmp == 0) [L774] RET __utac_acc__Specification4_spec__1() [L738] RET timeShift() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 693]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L320] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L583] int cleanupTimeShifts = 4; [L752] int pumpRunning = 0; [L753] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L659] int retValue_acc ; [L660] int tmp ; [L664] FCALL select_helpers() [L665] FCALL select_features() [L666] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L666] RET, EXPR valid_product() [L666] tmp = valid_product() [L668] COND TRUE \read(tmp) [L670] FCALL setup() [L671] CALL runTest() [L653] CALL test() [L684] int splverifierCounter ; [L685] int tmp ; [L686] int tmp___0 ; [L687] int tmp___1 ; [L688] int tmp___2 ; [L691] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L693] COND TRUE 1 [L695] COND TRUE splverifierCounter < 4 [L701] tmp = __VERIFIER_nondet_int() [L703] COND FALSE !(\read(tmp)) [L711] tmp___0 = __VERIFIER_nondet_int() [L713] COND FALSE !(\read(tmp___0)) [L721] tmp___2 = __VERIFIER_nondet_int() [L723] COND FALSE !(\read(tmp___2)) [L729] tmp___1 = __VERIFIER_nondet_int() [L731] COND TRUE \read(tmp___1) [L738] CALL timeShift() [L759] COND FALSE !(\read(pumpRunning)) [L766] COND TRUE \read(systemActive) [L768] CALL processEnvironment() [L788] int tmp ; [L791] COND TRUE ! pumpRunning [L793] CALL, EXPR isHighWaterLevel() [L903] int retValue_acc ; [L904] int tmp ; [L905] int tmp___0 ; [L909] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; [L140] COND TRUE waterLevel < 2 [L141] retValue_acc = 1 [L142] return (retValue_acc); [L909] RET, EXPR isHighWaterSensorDry() [L909] tmp = isHighWaterSensorDry() [L911] COND TRUE \read(tmp) [L912] tmp___0 = 0 [L916] retValue_acc = tmp___0 [L917] return (retValue_acc); [L793] RET, EXPR isHighWaterLevel() [L793] tmp = isHighWaterLevel() [L795] COND FALSE !(\read(tmp)) [L801] FCALL processEnvironment__wrappee__base() [L768] RET processEnvironment() [L774] CALL __utac_acc__Specification4_spec__1() [L558] int tmp ; [L559] int tmp___0 ; [L563] CALL, EXPR getWaterLevel() [L128] int retValue_acc ; [L131] retValue_acc = waterLevel [L132] return (retValue_acc); [L563] RET, EXPR getWaterLevel() [L563] tmp = getWaterLevel() [L565] COND FALSE !(tmp == 0) [L774] RET __utac_acc__Specification4_spec__1() [L738] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 16:16:50,409 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)