./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product43.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.graphml --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 512e5cf92a225db6dbd0c8975a0c1a4cbe1a4a48 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:24:57,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:24:57,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:24:57,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:24:57,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:24:57,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:24:57,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:24:57,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:24:57,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:24:57,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:24:57,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:24:57,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:24:57,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:24:57,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:24:57,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:24:57,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:24:57,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:24:57,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:24:57,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:24:57,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:24:57,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:24:57,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:24:57,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:24:57,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:24:57,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:24:57,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:24:57,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:24:57,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:24:57,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:24:57,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:24:57,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:24:57,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:24:57,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:24:57,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:24:57,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:24:57,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:24:57,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:24:57,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:24:57,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:24:57,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:24:57,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:24:57,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:24:57,713 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:24:57,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:24:57,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:24:57,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:24:57,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:24:57,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:24:57,717 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:24:57,717 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:24:57,717 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:24:57,717 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:24:57,718 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:24:57,718 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:24:57,719 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:24:57,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:24:57,719 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:24:57,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:24:57,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:24:57,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:24:57,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:24:57,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:24:57,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:24:57,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:24:57,721 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:24:57,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:24:57,721 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:24:57,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:24:57,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:24:57,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:24:57,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:24:57,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:24:57,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:24:57,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:24:57,724 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:24:57,724 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 512e5cf92a225db6dbd0c8975a0c1a4cbe1a4a48 [2021-08-27 16:24:58,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:24:58,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:24:58,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:24:58,094 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:24:58,095 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:24:58,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2021-08-27 16:24:58,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7f82c9b/e9f7c267eb0e4907833ba22d8f311e6b/FLAGabcddb40e [2021-08-27 16:24:58,572 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:24:58,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2021-08-27 16:24:58,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7f82c9b/e9f7c267eb0e4907833ba22d8f311e6b/FLAGabcddb40e [2021-08-27 16:24:58,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e7f82c9b/e9f7c267eb0e4907833ba22d8f311e6b [2021-08-27 16:24:58,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:24:58,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:24:58,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:24:58,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:24:58,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:24:58,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:24:58" (1/1) ... [2021-08-27 16:24:58,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e162a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:58, skipping insertion in model container [2021-08-27 16:24:58,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:24:58" (1/1) ... [2021-08-27 16:24:58,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:24:58,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:24:59,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18213,18226] [2021-08-27 16:24:59,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:24:59,259 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:24:59,342 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18213,18226] [2021-08-27 16:24:59,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:24:59,363 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:24:59,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59 WrapperNode [2021-08-27 16:24:59,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:24:59,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:24:59,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:24:59,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:24:59,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:24:59,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:24:59,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:24:59,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:24:59,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:24:59,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:24:59,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:24:59,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:24:59,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (1/1) ... [2021-08-27 16:24:59,518 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:24:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:24:59,534 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) [2021-08-27 16:24:59,569 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 [2021-08-27 16:24:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:24:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:24:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:24:59,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:25:00,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:25:00,350 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-08-27 16:25:00,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:00 BoogieIcfgContainer [2021-08-27 16:25:00,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:25:00,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:25:00,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:25:00,356 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:25:00,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:00,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:24:58" (1/3) ... [2021-08-27 16:25:00,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6faca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:25:00, skipping insertion in model container [2021-08-27 16:25:00,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:00,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:24:59" (2/3) ... [2021-08-27 16:25:00,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6faca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:25:00, skipping insertion in model container [2021-08-27 16:25:00,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:00,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:00" (3/3) ... [2021-08-27 16:25:00,359 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product43.cil.c [2021-08-27 16:25:00,394 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:25:00,394 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:25:00,394 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:25:00,394 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:25:00,395 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:25:00,395 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:25:00,395 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:25:00,395 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:25:00,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 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) [2021-08-27 16:25:00,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2021-08-27 16:25:00,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:00,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:00,435 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:00,435 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:00,436 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:25:00,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 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) [2021-08-27 16:25:00,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2021-08-27 16:25:00,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:00,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:00,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:00,443 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:00,446 INFO L791 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(13);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string70.base, #t~string70.offset, 1);call write~init~int(77, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(101, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(104, #t~string70.base, 4 + #t~string70.offset, 1);call write~init~int(58, #t~string70.base, 5 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 6 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string72.base, #t~string72.offset, 1);call write~init~int(82, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(73, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(84, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 4 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string74.base, #t~string74.offset, 1);call write~init~int(75, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 2 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string76.base, #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 1 + #t~string76.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0; 55#L-1true havoc main_#res;havoc main_#t~ret42, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 81#L946true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 87#L954true main_#t~ret42 := valid_product_#res;main_~tmp~3 := main_#t~ret42;havoc main_#t~ret42; 72#L500true assume 0 != main_~tmp~3; 33#L471true ~switchedOnBeforeTS~0 := 0; 48#L881true havoc test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 17#L902-1true [2021-08-27 16:25:00,447 INFO L793 eck$LassoCheckResult]: Loop: 17#L902-1true assume !false; 38#L526true assume test_~splverifierCounter~0 < 4; 35#L527true test_~tmp~4 := test_#t~nondet43;havoc test_#t~nondet43; 25#L535true assume !(0 != test_~tmp~4); 23#L535-1true test_~tmp___0~0 := test_#t~nondet44;havoc test_#t~nondet44; 28#L545true assume !(0 != test_~tmp___0~0); 90#L545-1true test_~tmp___2~0 := test_#t~nondet45;havoc test_#t~nondet45; 86#L555true assume 0 != test_~tmp___2~0; 34#L561-1true havoc __utac_acc__Specification5_spec__2_#t~ret77;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 79#L704true __utac_acc__Specification5_spec__2_#t~ret77 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret77;havoc __utac_acc__Specification5_spec__2_#t~ret77; 9#L891true assume !(0 != ~pumpRunning~0); 82#L601true assume !(0 != ~systemActive~0); 8#L608true havoc __utac_acc__Specification5_spec__3_#t~ret78, __utac_acc__Specification5_spec__3_#t~ret79, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 16#L855true __utac_acc__Specification5_spec__3_#t~ret78 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret78;havoc __utac_acc__Specification5_spec__3_#t~ret78; 42#L902true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 17#L902-1true [2021-08-27 16:25:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2021-08-27 16:25:00,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:00,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285514716] [2021-08-27 16:25:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:00,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:00,623 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:00,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -241460907, now seen corresponding path program 1 times [2021-08-27 16:25:00,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:00,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75015944] [2021-08-27 16:25:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:00,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:00,761 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:00,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1692564303, now seen corresponding path program 1 times [2021-08-27 16:25:00,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:00,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574395428] [2021-08-27 16:25:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:00,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:00,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:00,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574395428] [2021-08-27 16:25:00,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574395428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:00,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:00,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:25:00,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142746943] [2021-08-27 16:25:01,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 16:25:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 16:25:01,212 INFO L87 Difference]: Start difference. First operand has 95 states, 94 states have (on average 1.5) internal successors, (141), 94 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-27 16:25:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:01,462 INFO L93 Difference]: Finished difference Result 241 states and 334 transitions. [2021-08-27 16:25:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:25:01,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 334 transitions. [2021-08-27 16:25:01,470 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 155 [2021-08-27 16:25:01,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 220 states and 313 transitions. [2021-08-27 16:25:01,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2021-08-27 16:25:01,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2021-08-27 16:25:01,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 313 transitions. [2021-08-27 16:25:01,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:01,481 INFO L681 BuchiCegarLoop]: Abstraction has 220 states and 313 transitions. [2021-08-27 16:25:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 313 transitions. [2021-08-27 16:25:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 137. [2021-08-27 16:25:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.416058394160584) internal successors, (194), 136 states have internal predecessors, (194), 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) [2021-08-27 16:25:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2021-08-27 16:25:01,513 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2021-08-27 16:25:01,513 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2021-08-27 16:25:01,513 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:25:01,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 194 transitions. [2021-08-27 16:25:01,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 96 [2021-08-27 16:25:01,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:01,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:01,517 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:01,517 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:01,517 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(13);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string70.base, #t~string70.offset, 1);call write~init~int(77, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(101, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(104, #t~string70.base, 4 + #t~string70.offset, 1);call write~init~int(58, #t~string70.base, 5 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 6 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string72.base, #t~string72.offset, 1);call write~init~int(82, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(73, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(84, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 4 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string74.base, #t~string74.offset, 1);call write~init~int(75, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 2 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string76.base, #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 1 + #t~string76.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0; 421#L-1 havoc main_#res;havoc main_#t~ret42, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 422#L946 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 440#L954 main_#t~ret42 := valid_product_#res;main_~tmp~3 := main_#t~ret42;havoc main_#t~ret42; 436#L500 assume 0 != main_~tmp~3; 398#L471 ~switchedOnBeforeTS~0 := 0; 399#L881 havoc test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 377#L902-1 [2021-08-27 16:25:01,518 INFO L793 eck$LassoCheckResult]: Loop: 377#L902-1 assume !false; 378#L526 assume test_~splverifierCounter~0 < 4; 401#L527 test_~tmp~4 := test_#t~nondet43;havoc test_#t~nondet43; 388#L535 assume !(0 != test_~tmp~4); 386#L535-1 test_~tmp___0~0 := test_#t~nondet44;havoc test_#t~nondet44; 387#L545 assume !(0 != test_~tmp___0~0); 362#L545-1 test_~tmp___2~0 := test_#t~nondet45;havoc test_#t~nondet45; 442#L555 assume 0 != test_~tmp___2~0; 358#L561-1 havoc __utac_acc__Specification5_spec__2_#t~ret77;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 400#L704 __utac_acc__Specification5_spec__2_#t~ret77 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret77;havoc __utac_acc__Specification5_spec__2_#t~ret77; 365#L891 assume !(0 != ~pumpRunning~0); 367#L601 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret47, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 441#L633 assume !(0 == ~pumpRunning~0); 363#L608 havoc __utac_acc__Specification5_spec__3_#t~ret78, __utac_acc__Specification5_spec__3_#t~ret79, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 364#L855 __utac_acc__Specification5_spec__3_#t~ret78 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret78;havoc __utac_acc__Specification5_spec__3_#t~ret78; 376#L902 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 377#L902-1 [2021-08-27 16:25:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2021-08-27 16:25:01,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:01,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265682951] [2021-08-27 16:25:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:01,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:01,570 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:01,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1062877059, now seen corresponding path program 1 times [2021-08-27 16:25:01,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:01,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215594480] [2021-08-27 16:25:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:01,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:01,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:01,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215594480] [2021-08-27 16:25:01,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215594480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:01,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:01,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:25:01,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707689386] [2021-08-27 16:25:01,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:25:01,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:25:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:25:01,702 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-08-27 16:25:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:01,846 INFO L93 Difference]: Finished difference Result 184 states and 248 transitions. [2021-08-27 16:25:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:25:01,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 248 transitions. [2021-08-27 16:25:01,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2021-08-27 16:25:01,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 248 transitions. [2021-08-27 16:25:01,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2021-08-27 16:25:01,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2021-08-27 16:25:01,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 248 transitions. [2021-08-27 16:25:01,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:01,855 INFO L681 BuchiCegarLoop]: Abstraction has 184 states and 248 transitions. [2021-08-27 16:25:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 248 transitions. [2021-08-27 16:25:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-08-27 16:25:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.3478260869565217) internal successors, (248), 183 states have internal predecessors, (248), 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) [2021-08-27 16:25:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 248 transitions. [2021-08-27 16:25:01,870 INFO L704 BuchiCegarLoop]: Abstraction has 184 states and 248 transitions. [2021-08-27 16:25:01,871 INFO L587 BuchiCegarLoop]: Abstraction has 184 states and 248 transitions. [2021-08-27 16:25:01,871 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:25:01,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 248 transitions. [2021-08-27 16:25:01,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 132 [2021-08-27 16:25:01,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:01,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:01,874 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:01,874 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 16:25:01,874 INFO L791 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(13);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string70.base, #t~string70.offset, 1);call write~init~int(77, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(101, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(104, #t~string70.base, 4 + #t~string70.offset, 1);call write~init~int(58, #t~string70.base, 5 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 6 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string72.base, #t~string72.offset, 1);call write~init~int(82, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(73, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(84, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 4 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string74.base, #t~string74.offset, 1);call write~init~int(75, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 2 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string76.base, #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 1 + #t~string76.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0; 755#L-1 havoc main_#res;havoc main_#t~ret42, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 756#L946 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 775#L954 main_#t~ret42 := valid_product_#res;main_~tmp~3 := main_#t~ret42;havoc main_#t~ret42; 770#L500 assume 0 != main_~tmp~3; 727#L471 ~switchedOnBeforeTS~0 := 0; 728#L881 havoc test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 704#L902-1 [2021-08-27 16:25:01,874 INFO L793 eck$LassoCheckResult]: Loop: 704#L902-1 assume !false; 705#L526 assume test_~splverifierCounter~0 < 4; 730#L527 test_~tmp~4 := test_#t~nondet43;havoc test_#t~nondet43; 717#L535 assume !(0 != test_~tmp~4); 715#L535-1 test_~tmp___0~0 := test_#t~nondet44;havoc test_#t~nondet44; 716#L545 assume !(0 != test_~tmp___0~0); 689#L545-1 test_~tmp___2~0 := test_#t~nondet45;havoc test_#t~nondet45; 778#L555 assume 0 != test_~tmp___2~0; 685#L561-1 havoc __utac_acc__Specification5_spec__2_#t~ret77;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 729#L704 __utac_acc__Specification5_spec__2_#t~ret77 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret77;havoc __utac_acc__Specification5_spec__2_#t~ret77; 692#L891 assume !(0 != ~pumpRunning~0); 693#L601 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret47, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 776#L633 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret66, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 721#L863 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 722#L868 isHighWaterLevel_#t~ret66 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret66;havoc isHighWaterLevel_#t~ret66; 736#L753 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 708#L753-2 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 709#L759 processEnvironment_#t~ret47 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret47;havoc processEnvironment_#t~ret47; 746#L637 assume !(0 != processEnvironment_~tmp~5); 690#L608 havoc __utac_acc__Specification5_spec__3_#t~ret78, __utac_acc__Specification5_spec__3_#t~ret79, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 691#L855 __utac_acc__Specification5_spec__3_#t~ret78 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret78;havoc __utac_acc__Specification5_spec__3_#t~ret78; 703#L902 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~8); 704#L902-1 [2021-08-27 16:25:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:01,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2021-08-27 16:25:01,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:01,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567427192] [2021-08-27 16:25:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:01,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:01,916 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:01,971 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1275820079, now seen corresponding path program 1 times [2021-08-27 16:25:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:01,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667610239] [2021-08-27 16:25:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:01,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:02,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:02,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667610239] [2021-08-27 16:25:02,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667610239] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:02,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:02,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:25:02,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365267302] [2021-08-27 16:25:02,027 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:25:02,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:25:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:25:02,028 INFO L87 Difference]: Start difference. First operand 184 states and 248 transitions. cyclomatic complexity: 67 Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-08-27 16:25:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:02,206 INFO L93 Difference]: Finished difference Result 673 states and 907 transitions. [2021-08-27 16:25:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 16:25:02,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 907 transitions. [2021-08-27 16:25:02,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 479 [2021-08-27 16:25:02,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 673 states and 907 transitions. [2021-08-27 16:25:02,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2021-08-27 16:25:02,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2021-08-27 16:25:02,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 907 transitions. [2021-08-27 16:25:02,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:02,230 INFO L681 BuchiCegarLoop]: Abstraction has 673 states and 907 transitions. [2021-08-27 16:25:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 907 transitions. [2021-08-27 16:25:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 358. [2021-08-27 16:25:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 358 states have (on average 1.324022346368715) internal successors, (474), 357 states have internal predecessors, (474), 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) [2021-08-27 16:25:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 474 transitions. [2021-08-27 16:25:02,262 INFO L704 BuchiCegarLoop]: Abstraction has 358 states and 474 transitions. [2021-08-27 16:25:02,262 INFO L587 BuchiCegarLoop]: Abstraction has 358 states and 474 transitions. [2021-08-27 16:25:02,262 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:25:02,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 474 transitions. [2021-08-27 16:25:02,264 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 262 [2021-08-27 16:25:02,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:02,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:02,266 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:02,266 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 16:25:02,267 INFO L791 eck$LassoCheckResult]: Stem: 1664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(13);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(110, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 2 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string55.base, #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(102, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string57.base, #t~string57.offset, 1);call write~init~int(80, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(117, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(109, #t~string57.base, 3 + #t~string57.offset, 1);call write~init~int(112, #t~string57.base, 4 + #t~string57.offset, 1);call write~init~int(58, #t~string57.base, 5 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 6 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string63.base, #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string65.base, #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 1 + #t~string65.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(13);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string70.base, #t~string70.offset, 1);call write~init~int(77, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(101, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(104, #t~string70.base, 4 + #t~string70.offset, 1);call write~init~int(58, #t~string70.base, 5 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 6 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string72.base, #t~string72.offset, 1);call write~init~int(82, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(73, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(84, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 4 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string74.base, #t~string74.offset, 1);call write~init~int(75, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 2 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string76.base, #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 1 + #t~string76.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0; 1642#L-1 havoc main_#res;havoc main_#t~ret42, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 1643#L946 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 1672#L954 main_#t~ret42 := valid_product_#res;main_~tmp~3 := main_#t~ret42;havoc main_#t~ret42; 1663#L500 assume 0 != main_~tmp~3; 1605#L471 ~switchedOnBeforeTS~0 := 0; 1606#L881 havoc test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1628#L902-1 [2021-08-27 16:25:02,267 INFO L793 eck$LassoCheckResult]: Loop: 1628#L902-1 assume !false; 1835#L526 assume test_~splverifierCounter~0 < 4; 1836#L527 test_~tmp~4 := test_#t~nondet43;havoc test_#t~nondet43; 1874#L535 assume !(0 != test_~tmp~4); 1872#L535-1 test_~tmp___0~0 := test_#t~nondet44;havoc test_#t~nondet44; 1871#L545 assume !(0 != test_~tmp___0~0); 1869#L545-1 test_~tmp___2~0 := test_#t~nondet45;havoc test_#t~nondet45; 1868#L555 assume 0 != test_~tmp___2~0; 1832#L561-1 havoc __utac_acc__Specification5_spec__2_#t~ret77;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1831#L704 __utac_acc__Specification5_spec__2_#t~ret77 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret77;havoc __utac_acc__Specification5_spec__2_#t~ret77; 1830#L891 assume !(0 != ~pumpRunning~0); 1673#L601 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret47, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 1674#L633 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret66, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 1600#L863 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 1601#L868 isHighWaterLevel_#t~ret66 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret66;havoc isHighWaterLevel_#t~ret66; 1617#L753 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 1587#L753-2 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1588#L759 processEnvironment_#t~ret47 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret47;havoc processEnvironment_#t~ret47; 1629#L637 assume !(0 != processEnvironment_~tmp~5); 1630#L608 havoc __utac_acc__Specification5_spec__3_#t~ret78, __utac_acc__Specification5_spec__3_#t~ret79, __utac_acc__Specification5_spec__3_~tmp~8, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~8;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 1841#L855 __utac_acc__Specification5_spec__3_#t~ret78 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~8 := __utac_acc__Specification5_spec__3_#t~ret78;havoc __utac_acc__Specification5_spec__3_#t~ret78; 1840#L902 assume 2 != __utac_acc__Specification5_spec__3_~tmp~8;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 1839#L704-1 __utac_acc__Specification5_spec__3_#t~ret79 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret79;havoc __utac_acc__Specification5_spec__3_#t~ret79; 1838#L906 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1628#L902-1 [2021-08-27 16:25:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2021-08-27 16:25:02,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:02,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857611646] [2021-08-27 16:25:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:02,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,300 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,339 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:02,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1997403210, now seen corresponding path program 1 times [2021-08-27 16:25:02,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:02,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845178297] [2021-08-27 16:25:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:02,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,345 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1856809872, now seen corresponding path program 1 times [2021-08-27 16:25:02,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:02,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711983170] [2021-08-27 16:25:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:02,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,370 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:02,403 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:45,226 WARN L207 SmtUtils]: Spent 42.45 s on a formula simplification. DAG size of input: 495 DAG size of output: 437 [2021-08-27 16:26:30,075 WARN L207 SmtUtils]: Spent 21.52 s on a formula simplification that was a NOOP. DAG size: 435 [2021-08-27 16:26:30,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:26:30 BoogieIcfgContainer [2021-08-27 16:26:30,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:26:30,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:26:30,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:26:30,202 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:26:30,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:00" (3/4) ... [2021-08-27 16:26:30,204 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:26:30,242 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:26:30,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:26:30,244 INFO L168 Benchmark]: Toolchain (without parser) took 91295.45 ms. Allocated memory was 69.2 MB in the beginning and 132.1 MB in the end (delta: 62.9 MB). Free memory was 48.8 MB in the beginning and 56.3 MB in the end (delta: -7.5 MB). Peak memory consumption was 54.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,244 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 69.2 MB. Free memory is still 50.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:26:30,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.86 ms. Allocated memory is still 69.2 MB. Free memory was 48.7 MB in the beginning and 47.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.93 ms. Allocated memory is still 69.2 MB. Free memory was 47.0 MB in the beginning and 43.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,246 INFO L168 Benchmark]: Boogie Preprocessor took 63.47 ms. Allocated memory is still 69.2 MB. Free memory was 43.8 MB in the beginning and 41.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,246 INFO L168 Benchmark]: RCFGBuilder took 843.31 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 41.5 MB in the beginning and 50.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,247 INFO L168 Benchmark]: BuchiAutomizer took 89847.72 ms. Allocated memory was 90.2 MB in the beginning and 132.1 MB in the end (delta: 41.9 MB). Free memory was 50.7 MB in the beginning and 58.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 69.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,247 INFO L168 Benchmark]: Witness Printer took 41.67 ms. Allocated memory is still 132.1 MB. Free memory was 58.4 MB in the beginning and 56.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:30,250 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 69.2 MB. Free memory is still 50.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 411.86 ms. Allocated memory is still 69.2 MB. Free memory was 48.7 MB in the beginning and 47.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 78.93 ms. Allocated memory is still 69.2 MB. Free memory was 47.0 MB in the beginning and 43.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.47 ms. Allocated memory is still 69.2 MB. Free memory was 43.8 MB in the beginning and 41.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 843.31 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 41.5 MB in the beginning and 50.7 MB in the end (delta: -9.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 89847.72 ms. Allocated memory was 90.2 MB in the beginning and 132.1 MB in the end (delta: 41.9 MB). Free memory was 50.7 MB in the beginning and 58.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 69.9 MB. Max. memory is 16.1 GB. * Witness Printer took 41.67 ms. Allocated memory is still 132.1 MB. Free memory was 58.4 MB in the beginning and 56.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 358 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 89.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 88.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 68.1ms AutomataMinimizationTime, 3 MinimizatonAttempts, 398 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 358 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 430 SDtfs, 1260 SDslu, 1174 SDs, 0 SdLazy, 164 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 326.5ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 525]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9955} State at position 1 is {NULL=0, NULL=9964, NULL=0, NULL=9955, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b50587a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@618bb91b=57, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74efbdef=0, methaneLevelCritical=0, retValue_acc=1, tmp=0, NULL=0, NULL=9973, tmp___1=0, NULL=9959, retValue_acc=0, NULL=0, NULL=9962, NULL=9971, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75af7d7f=0, NULL=0, waterLevel=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@556a9e07=0, tmp___0=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=9972, tmp=1, NULL=9983, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ac5f660=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bde9590=0, NULL=0, \result=1, NULL=9981, NULL=0, retValue_acc=1, NULL=0, NULL=0, tmp=1, NULL=9982, NULL=9961, NULL=9974, NULL=9958, head=0, NULL=0, NULL=0, tmp=0, NULL=9979, NULL=0, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d2dba81=0, NULL=0, NULL=9980, NULL=9960, NULL=9957, NULL=9965, tmp___0=0, tmp=1, NULL=0, NULL=0, NULL=9977, NULL=9969, switchedOnBeforeTS=0, NULL=9963, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48fff79a=0, \result=0, NULL=9968, NULL=0, NULL=0, NULL=0, systemActive=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7263fabc=0, \result=0, NULL=0, NULL=0, NULL=0, NULL=9978, tmp___0=0, \result=0, NULL=0, NULL=9966, NULL=9967, tmp___2=57, splverifierCounter=0, NULL=0, NULL=0, NULL=9970, NULL=9975, NULL=9976, NULL=9956, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L211] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L408] int cleanupTimeShifts = 4; [L589] int pumpRunning = 0; [L590] int systemActive = 1; [L780] int waterLevel = 1; [L781] int methaneLevelCritical = 0; [L875] int switchedOnBeforeTS ; [L491] int retValue_acc ; [L492] int tmp ; [L950] int retValue_acc ; [L953] retValue_acc = 1 [L954] return (retValue_acc); [L498] tmp = valid_product() [L500] COND TRUE \read(tmp) [L880] switchedOnBeforeTS = 0 [L516] int splverifierCounter ; [L517] int tmp ; [L518] int tmp___0 ; [L519] int tmp___1 ; [L520] int tmp___2 ; [L523] splverifierCounter = 0 Loop: [L525] COND TRUE 1 [L527] COND TRUE splverifierCounter < 4 [L533] tmp = __VERIFIER_nondet_int() [L535] COND FALSE !(\read(tmp)) [L543] tmp___0 = __VERIFIER_nondet_int() [L545] COND FALSE !(\read(tmp___0)) [L553] tmp___2 = __VERIFIER_nondet_int() [L555] COND TRUE \read(tmp___2) [L700] int retValue_acc ; [L703] retValue_acc = pumpRunning [L704] return (retValue_acc); [L889] switchedOnBeforeTS = isPumpRunning() [L601] COND FALSE !(\read(pumpRunning)) [L608] COND TRUE \read(systemActive) [L630] int tmp ; [L633] COND TRUE ! pumpRunning [L745] int retValue_acc ; [L746] int tmp ; [L747] int tmp___0 ; [L860] int retValue_acc ; [L863] COND TRUE waterLevel < 2 [L864] retValue_acc = 1 [L865] return (retValue_acc); [L751] tmp = isHighWaterSensorDry() [L753] COND TRUE \read(tmp) [L754] tmp___0 = 0 [L758] retValue_acc = tmp___0 [L759] return (retValue_acc); [L635] tmp = isHighWaterLevel() [L637] COND FALSE !(\read(tmp)) [L895] int tmp ; [L896] int tmp___0 ; [L851] int retValue_acc ; [L854] retValue_acc = waterLevel [L855] return (retValue_acc); [L900] tmp = getWaterLevel() [L902] COND TRUE tmp != 2 [L700] int retValue_acc ; [L703] retValue_acc = pumpRunning [L704] return (retValue_acc); [L904] tmp___0 = isPumpRunning() [L906] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:26:30,300 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...