./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer --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 75ad40de7ac44b78584ba916fa204e981921222d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 18:53:51,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:53:51,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:53:51,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:53:51,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:53:51,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:53:51,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:53:51,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:53:51,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:53:51,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:53:51,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:53:51,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:53:51,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:53:51,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:53:51,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:53:51,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:53:51,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:53:51,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:53:51,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:53:51,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:53:51,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:53:51,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:53:51,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:53:51,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:53:51,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:53:51,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:53:51,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:53:51,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:53:51,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:53:51,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:53:51,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:53:51,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:53:51,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:53:51,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:53:51,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:53:51,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:53:51,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:53:51,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:53:51,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:53:51,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:53:51,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:53:51,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:53:51,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:53:51,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:53:51,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:53:51,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:53:51,233 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:53:51,233 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:53:51,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:53:51,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:53:51,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:53:51,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:53:51,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:53:51,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:53:51,236 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:53:51,236 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:53:51,236 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer 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 -> 75ad40de7ac44b78584ba916fa204e981921222d [2019-12-07 18:53:51,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:53:51,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:53:51,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:53:51,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:53:51,344 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:53:51,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c [2019-12-07 18:53:51,382 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/data/b718057a6/47bfae9f16a542b2bcf9d26639b55472/FLAG0200d204a [2019-12-07 18:53:51,731 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:53:51,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c [2019-12-07 18:53:51,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/data/b718057a6/47bfae9f16a542b2bcf9d26639b55472/FLAG0200d204a [2019-12-07 18:53:51,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/data/b718057a6/47bfae9f16a542b2bcf9d26639b55472 [2019-12-07 18:53:51,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:53:51,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:53:51,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:51,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:53:51,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:53:51,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:51" (1/1) ... [2019-12-07 18:53:51,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7b5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:51, skipping insertion in model container [2019-12-07 18:53:51,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:51" (1/1) ... [2019-12-07 18:53:51,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:53:51,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:53:52,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:52,021 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:53:52,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:52,089 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:53:52,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52 WrapperNode [2019-12-07 18:53:52,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:52,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:53:52,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:53:52,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:53:52,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:53:52,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:53:52,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:53:52,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:53:52,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... [2019-12-07 18:53:52,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:53:52,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:53:52,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:53:52,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:53:52,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:53:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:53:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:53:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:53:52,580 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:53:52,581 INFO L287 CfgBuilder]: Removed 106 assume(true) statements. [2019-12-07 18:53:52,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:52 BoogieIcfgContainer [2019-12-07 18:53:52,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:53:52,582 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:53:52,582 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:53:52,584 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:53:52,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:53:52,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:53:51" (1/3) ... [2019-12-07 18:53:52,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@170ff655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:53:52, skipping insertion in model container [2019-12-07 18:53:52,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:53:52,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:52" (2/3) ... [2019-12-07 18:53:52,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@170ff655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:53:52, skipping insertion in model container [2019-12-07 18:53:52,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:53:52,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:52" (3/3) ... [2019-12-07 18:53:52,587 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product35.cil.c [2019-12-07 18:53:52,615 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:53:52,615 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:53:52,615 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:53:52,615 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:53:52,616 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:53:52,616 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:53:52,616 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:53:52,616 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:53:52,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-12-07 18:53:52,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-12-07 18:53:52,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:53:52,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:53:52,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:53:52,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:52,649 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:53:52,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-12-07 18:53:52,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-12-07 18:53:52,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:53:52,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:53:52,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:53:52,653 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:52,657 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(13);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string30.base, #t~string30.offset, 1);call write~init~int(77, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(101, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(116, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(104, #t~string30.base, 4 + #t~string30.offset, 1);call write~init~int(58, #t~string30.base, 5 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 6 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string32.base, #t~string32.offset, 1);call write~init~int(82, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(73, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(84, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 4 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(75, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 14#L-1true havoc main_#res;havoc main_#t~ret26, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 61#L539true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 68#L547true main_#t~ret26 := valid_product_#res;main_~tmp~4 := main_#t~ret26;havoc main_#t~ret26; 3#L409true assume 0 != main_~tmp~4; 12#L383true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 63#L305-1true [2019-12-07 18:53:52,657 INFO L796 eck$LassoCheckResult]: Loop: 63#L305-1true assume !false; 62#L56true assume test_~splverifierCounter~0 < 4; 84#L57true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 19#L65true assume !(0 != test_~tmp~0); 16#L65-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 79#L75true assume !(0 != test_~tmp___0~0); 75#L75-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 52#L85true assume 0 != test_~tmp___2~0; 4#L91-1true assume !(0 != ~pumpRunning~0); 35#L128true assume !(0 != ~systemActive~0); 9#L135true havoc __utac_acc__Specification3_spec__1_#t~ret23, __utac_acc__Specification3_spec__1_#t~ret24, __utac_acc__Specification3_spec__1_#t~ret25, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 56#L466true __utac_acc__Specification3_spec__1_#t~ret23 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret23;havoc __utac_acc__Specification3_spec__1_#t~ret23; 18#L299true assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 63#L305-1true [2019-12-07 18:53:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-12-07 18:53:52,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:52,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991120909] [2019-12-07 18:53:52,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:52,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1672941122, now seen corresponding path program 1 times [2019-12-07 18:53:52,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:52,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589748416] [2019-12-07 18:53:52,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:52,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:52,868 INFO L82 PathProgramCache]: Analyzing trace with hash 41337816, now seen corresponding path program 1 times [2019-12-07 18:53:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:52,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228202245] [2019-12-07 18:53:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:52,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228202245] [2019-12-07 18:53:52,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:52,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:53:52,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19252342] [2019-12-07 18:53:53,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:53:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:53:53,024 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 6 states. [2019-12-07 18:53:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:53,146 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2019-12-07 18:53:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:53:53,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 303 transitions. [2019-12-07 18:53:53,154 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 137 [2019-12-07 18:53:53,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 195 states and 282 transitions. [2019-12-07 18:53:53,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2019-12-07 18:53:53,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2019-12-07 18:53:53,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 282 transitions. [2019-12-07 18:53:53,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:53:53,162 INFO L688 BuchiCegarLoop]: Abstraction has 195 states and 282 transitions. [2019-12-07 18:53:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 282 transitions. [2019-12-07 18:53:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2019-12-07 18:53:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 18:53:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2019-12-07 18:53:53,188 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 177 transitions. [2019-12-07 18:53:53,188 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 177 transitions. [2019-12-07 18:53:53,188 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:53:53,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 177 transitions. [2019-12-07 18:53:53,190 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2019-12-07 18:53:53,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:53:53,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:53:53,190 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:53:53,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:53,191 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(13);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string30.base, #t~string30.offset, 1);call write~init~int(77, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(101, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(116, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(104, #t~string30.base, 4 + #t~string30.offset, 1);call write~init~int(58, #t~string30.base, 5 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 6 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string32.base, #t~string32.offset, 1);call write~init~int(82, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(73, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(84, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 4 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(75, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 337#L-1 havoc main_#res;havoc main_#t~ret26, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 338#L539 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 385#L547 main_#t~ret26 := valid_product_#res;main_~tmp~4 := main_#t~ret26;havoc main_#t~ret26; 317#L409 assume 0 != main_~tmp~4; 318#L383 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 334#L305-1 [2019-12-07 18:53:53,191 INFO L796 eck$LassoCheckResult]: Loop: 334#L305-1 assume !false; 386#L56 assume test_~splverifierCounter~0 < 4; 387#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 346#L65 assume !(0 != test_~tmp~0); 340#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 341#L75 assume !(0 != test_~tmp___0~0); 353#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 379#L85 assume 0 != test_~tmp___2~0; 319#L91-1 assume !(0 != ~pumpRunning~0); 321#L128 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 342#L160 assume !(0 == ~pumpRunning~0); 328#L135 havoc __utac_acc__Specification3_spec__1_#t~ret23, __utac_acc__Specification3_spec__1_#t~ret24, __utac_acc__Specification3_spec__1_#t~ret25, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 329#L466 __utac_acc__Specification3_spec__1_#t~ret23 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret23;havoc __utac_acc__Specification3_spec__1_#t~ret23; 344#L299 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 334#L305-1 [2019-12-07 18:53:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-12-07 18:53:53,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351570677] [2019-12-07 18:53:53,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -353177362, now seen corresponding path program 1 times [2019-12-07 18:53:53,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081155848] [2019-12-07 18:53:53,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:53,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081155848] [2019-12-07 18:53:53,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:53,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:53,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323545013] [2019-12-07 18:53:53,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:53:53,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:53:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:53:53,260 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. cyclomatic complexity: 57 Second operand 3 states. [2019-12-07 18:53:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:53,308 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-12-07 18:53:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:53:53,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 229 transitions. [2019-12-07 18:53:53,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-12-07 18:53:53,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 229 transitions. [2019-12-07 18:53:53,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2019-12-07 18:53:53,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2019-12-07 18:53:53,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 229 transitions. [2019-12-07 18:53:53,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:53:53,313 INFO L688 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2019-12-07 18:53:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 229 transitions. [2019-12-07 18:53:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-12-07 18:53:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:53:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2019-12-07 18:53:53,321 INFO L711 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2019-12-07 18:53:53,321 INFO L591 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2019-12-07 18:53:53,321 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:53:53,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 229 transitions. [2019-12-07 18:53:53,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2019-12-07 18:53:53,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:53:53,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:53:53,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:53:53,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:53:53,323 INFO L794 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(13);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string30.base, #t~string30.offset, 1);call write~init~int(77, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(101, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(116, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(104, #t~string30.base, 4 + #t~string30.offset, 1);call write~init~int(58, #t~string30.base, 5 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 6 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string32.base, #t~string32.offset, 1);call write~init~int(82, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(73, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(84, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 4 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(75, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 634#L-1 havoc main_#res;havoc main_#t~ret26, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 635#L539 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 696#L547 main_#t~ret26 := valid_product_#res;main_~tmp~4 := main_#t~ret26;havoc main_#t~ret26; 616#L409 assume 0 != main_~tmp~4; 617#L383 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 630#L305-1 [2019-12-07 18:53:53,323 INFO L796 eck$LassoCheckResult]: Loop: 630#L305-1 assume !false; 694#L56 assume test_~splverifierCounter~0 < 4; 695#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 642#L65 assume !(0 != test_~tmp~0); 636#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 637#L75 assume !(0 != test_~tmp___0~0); 651#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 687#L85 assume 0 != test_~tmp___2~0; 614#L91-1 assume !(0 != ~pumpRunning~0); 615#L128 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 638#L160 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret22, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 639#L506 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 631#L511 isHighWaterLevel_#t~ret22 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret22;havoc isHighWaterLevel_#t~ret22; 632#L262 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~1 := 0; 698#L262-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 690#L268 processEnvironment_#t~ret4 := isHighWaterLevel_#res;processEnvironment_~tmp~1 := processEnvironment_#t~ret4;havoc processEnvironment_#t~ret4; 652#L164 assume !(0 != processEnvironment_~tmp~1); 654#L135 havoc __utac_acc__Specification3_spec__1_#t~ret23, __utac_acc__Specification3_spec__1_#t~ret24, __utac_acc__Specification3_spec__1_#t~ret25, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 756#L466 __utac_acc__Specification3_spec__1_#t~ret23 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret23;havoc __utac_acc__Specification3_spec__1_#t~ret23; 640#L299 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 630#L305-1 [2019-12-07 18:53:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-12-07 18:53:53,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188928492] [2019-12-07 18:53:53,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -539551526, now seen corresponding path program 1 times [2019-12-07 18:53:53,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137142264] [2019-12-07 18:53:53,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash -524839552, now seen corresponding path program 1 times [2019-12-07 18:53:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995647662] [2019-12-07 18:53:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:53,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995647662] [2019-12-07 18:53:53,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:53,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:53,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977816851] [2019-12-07 18:53:53,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:53:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:53:53,541 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. cyclomatic complexity: 64 Second operand 5 states. [2019-12-07 18:53:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:53,608 INFO L93 Difference]: Finished difference Result 548 states and 750 transitions. [2019-12-07 18:53:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:53:53,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 750 transitions. [2019-12-07 18:53:53,613 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 414 [2019-12-07 18:53:53,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 750 transitions. [2019-12-07 18:53:53,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2019-12-07 18:53:53,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2019-12-07 18:53:53,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 750 transitions. [2019-12-07 18:53:53,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:53:53,620 INFO L688 BuchiCegarLoop]: Abstraction has 548 states and 750 transitions. [2019-12-07 18:53:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 750 transitions. [2019-12-07 18:53:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 330. [2019-12-07 18:53:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-07 18:53:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 440 transitions. [2019-12-07 18:53:53,636 INFO L711 BuchiCegarLoop]: Abstraction has 330 states and 440 transitions. [2019-12-07 18:53:53,636 INFO L591 BuchiCegarLoop]: Abstraction has 330 states and 440 transitions. [2019-12-07 18:53:53,636 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:53:53,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 440 transitions. [2019-12-07 18:53:53,638 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 240 [2019-12-07 18:53:53,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:53:53,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:53:53,639 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 18:53:53,639 INFO L850 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] [2019-12-07 18:53:53,639 INFO L794 eck$LassoCheckResult]: Stem: 1398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(13);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string9.base, #t~string9.offset, 1);call write~init~int(110, #t~string9.base, 1 + #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 2 + #t~string9.offset, 1);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(102, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 3 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(80, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(117, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(109, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(112, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(110, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(102, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 3 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(32, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(13);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string30.base, #t~string30.offset, 1);call write~init~int(77, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(101, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(116, #t~string30.base, 3 + #t~string30.offset, 1);call write~init~int(104, #t~string30.base, 4 + #t~string30.offset, 1);call write~init~int(58, #t~string30.base, 5 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 6 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string32.base, #t~string32.offset, 1);call write~init~int(82, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(73, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(84, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 4 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(75, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 1368#L-1 havoc main_#res;havoc main_#t~ret26, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 1369#L539 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1437#L547 main_#t~ret26 := valid_product_#res;main_~tmp~4 := main_#t~ret26;havoc main_#t~ret26; 1350#L409 assume 0 != main_~tmp~4; 1351#L383 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1366#L305-1 [2019-12-07 18:53:53,639 INFO L796 eck$LassoCheckResult]: Loop: 1366#L305-1 assume !false; 1606#L56 assume test_~splverifierCounter~0 < 4; 1607#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 1666#L65 assume !(0 != test_~tmp~0); 1664#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 1663#L75 assume !(0 != test_~tmp___0~0); 1662#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 1661#L85 assume 0 != test_~tmp___2~0; 1644#L91-1 assume !(0 != ~pumpRunning~0); 1585#L128 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret4, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1634#L160 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret22, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1483#L506 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1642#L511 isHighWaterLevel_#t~ret22 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret22;havoc isHighWaterLevel_#t~ret22; 1640#L262 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~1 := 0; 1454#L262-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1432#L268 processEnvironment_#t~ret4 := isHighWaterLevel_#res;processEnvironment_~tmp~1 := processEnvironment_#t~ret4;havoc processEnvironment_#t~ret4; 1387#L164 assume !(0 != processEnvironment_~tmp~1); 1389#L135 havoc __utac_acc__Specification3_spec__1_#t~ret23, __utac_acc__Specification3_spec__1_#t~ret24, __utac_acc__Specification3_spec__1_#t~ret25, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 1613#L466 __utac_acc__Specification3_spec__1_#t~ret23 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret23;havoc __utac_acc__Specification3_spec__1_#t~ret23; 1612#L299 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1611#L498 __utac_acc__Specification3_spec__1_#t~ret24 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret24;havoc __utac_acc__Specification3_spec__1_#t~ret24; 1609#L305 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1366#L305-1 [2019-12-07 18:53:53,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2019-12-07 18:53:53,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855180594] [2019-12-07 18:53:53,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1182032684, now seen corresponding path program 1 times [2019-12-07 18:53:53,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997497149] [2019-12-07 18:53:53,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:53:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1859629486, now seen corresponding path program 1 times [2019-12-07 18:53:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528843053] [2019-12-07 18:53:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:53:53,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:54:18,212 WARN L192 SmtUtils]: Spent 24.34 s on a formula simplification. DAG size of input: 452 DAG size of output: 400 [2019-12-07 18:54:30,543 WARN L192 SmtUtils]: Spent 12.33 s on a formula simplification that was a NOOP. DAG size: 400 [2019-12-07 18:54:30,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 06:54:30 BoogieIcfgContainer [2019-12-07 18:54:30,598 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 18:54:30,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:54:30,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:54:30,598 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:54:30,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:52" (3/4) ... [2019-12-07 18:54:30,601 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-12-07 18:54:30,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_279b89aa-9d8b-40e7-8836-8e1aa3da6b27/bin/uautomizer/witness.graphml [2019-12-07 18:54:30,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:54:30,640 INFO L168 Benchmark]: Toolchain (without parser) took 38887.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.8 MB in the beginning and 982.9 MB in the end (delta: -43.1 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,640 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:54:30,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,641 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:54:30,641 INFO L168 Benchmark]: RCFGBuilder took 423.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,641 INFO L168 Benchmark]: BuchiAutomizer took 38016.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.0 GB in the beginning and 985.2 MB in the end (delta: 47.4 MB). Peak memory consumption was 245.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,642 INFO L168 Benchmark]: Witness Printer took 40.45 ms. Allocated memory is still 1.2 GB. Free memory was 985.2 MB in the beginning and 982.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:54:30,643 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 423.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38016.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.0 GB in the beginning and 985.2 MB in the end (delta: 47.4 MB). Peak memory consumption was 245.7 MB. Max. memory is 11.5 GB. * Witness Printer took 40.45 ms. Allocated memory is still 1.2 GB. Free memory was 985.2 MB in the beginning and 982.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 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 330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 37.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 290 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 330 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 396 SDtfs, 1042 SDslu, 1066 SDs, 0 SdLazy, 103 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 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: 55]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4795} State at position 1 is {NULL=4802, NULL=0, NULL=4795, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@521fe34e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42f349ea=0, NULL=4799, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@629dd997=63, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cccea91=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19c7a16e=0, NULL=4820, NULL=4814, methaneLevelCritical=0, tmp___0=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, NULL=4796, NULL=0, tmp___1=0, NULL=4818, NULL=4804, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46f5c51d=0, cleanupTimeShifts=4, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67e6da90=0, NULL=4803, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb93289=0, tmp=0, NULL=4805, tmp___0=1, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=4816, \result=1, NULL=0, NULL=0, NULL=4809, \result=0, retValue_acc=0, tmp___0=0, NULL=4817, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, NULL=4808, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b784518=0, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f79857=0, NULL=4798, tmp=1, NULL=0, NULL=0, NULL=4807, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, NULL=4806, NULL=4815, retValue_acc=1, tmp=1, tmp___2=63, NULL=4797, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=4801, NULL=4819, NULL=4811, tmp=0, tmp___1=0, head=0, NULL=0, NULL=4800, NULL=4810, NULL=0, NULL=0, NULL=4813, NULL=4812} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L324] int cleanupTimeShifts = 4; [L423] int waterLevel = 1; [L424] int methaneLevelCritical = 0; [L730] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L400] int retValue_acc ; [L401] int tmp ; [L543] int retValue_acc ; [L546] retValue_acc = 1 [L547] return (retValue_acc); [L407] tmp = valid_product() [L409] COND TRUE \read(tmp) [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 Loop: [L55] COND TRUE 1 [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) [L128] COND FALSE !(\read(pumpRunning)) [L135] COND TRUE \read(systemActive) [L157] int tmp ; [L160] COND TRUE ! pumpRunning [L254] int retValue_acc ; [L255] int tmp ; [L256] int tmp___0 ; [L503] int retValue_acc ; [L506] COND TRUE waterLevel < 2 [L507] retValue_acc = 1 [L508] return (retValue_acc); [L260] tmp = isHighWaterSensorDry() [L262] COND TRUE \read(tmp) [L263] tmp___0 = 0 [L267] retValue_acc = tmp___0 [L268] return (retValue_acc); [L162] tmp = isHighWaterLevel() [L164] COND FALSE !(\read(tmp)) [L291] int tmp ; [L292] int tmp___0 ; [L293] int tmp___1 ; [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); [L297] tmp = isMethaneLevelCritical() [L299] COND FALSE !(\read(tmp)) [L494] int retValue_acc ; [L497] retValue_acc = waterLevel [L498] return (retValue_acc); [L303] tmp___0 = getWaterLevel() [L305] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...