./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.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 feddb53df5c889a09349b532f3a03633c4161684 ........................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-2e94e6a [2019-01-01 23:47:06,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:47:06,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:47:06,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:47:06,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:47:06,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:47:06,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:47:06,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:47:06,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:47:06,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:47:06,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:47:06,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:47:06,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:47:06,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:47:06,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:47:06,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:47:06,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:47:06,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:47:06,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:47:06,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:47:06,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:47:06,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:47:06,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:47:06,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:47:06,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:47:06,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:47:06,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:47:06,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:47:06,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:47:06,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:47:06,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:47:06,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:47:06,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:47:06,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:47:06,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:47:06,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:47:06,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:47:06,935 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:47:06,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:47:06,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:47:06,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:47:06,940 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:47:06,941 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:47:06,941 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:47:06,941 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:47:06,941 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:47:06,941 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:47:06,942 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:47:06,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:47:06,942 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:47:06,942 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:47:06,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:47:06,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:47:06,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:47:06,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:47:06,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:47:06,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:47:06,945 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:47:06,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:47:06,945 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:47:06,945 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:47:06,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:47:06,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:47:06,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:47:06,946 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:47:06,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:47:06,947 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:47:06,947 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:47:06,949 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:47:06,950 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> feddb53df5c889a09349b532f3a03633c4161684 [2019-01-01 23:47:06,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:47:07,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:47:07,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:47:07,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:47:07,018 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:47:07,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:07,083 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeee5cbd/660c3e2e13084d1d83b117a3502b4ba1/FLAGde4483021 [2019-01-01 23:47:07,628 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:47:07,630 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:07,649 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeee5cbd/660c3e2e13084d1d83b117a3502b4ba1/FLAGde4483021 [2019-01-01 23:47:07,880 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbeee5cbd/660c3e2e13084d1d83b117a3502b4ba1 [2019-01-01 23:47:07,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:47:07,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:47:07,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:07,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:47:07,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:47:07,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:07" (1/1) ... [2019-01-01 23:47:07,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a354ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:07, skipping insertion in model container [2019-01-01 23:47:07,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:07" (1/1) ... [2019-01-01 23:47:07,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:47:07,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:47:08,301 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:08,318 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:47:08,447 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:08,485 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:47:08,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08 WrapperNode [2019-01-01 23:47:08,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:08,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:08,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:47:08,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:47:08,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:08,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:47:08,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:47:08,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:47:08,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... [2019-01-01 23:47:08,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:47:08,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:47:08,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:47:08,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:47:08,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 23:47:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:47:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:47:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:47:08,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:47:09,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:47:09,842 INFO L280 CfgBuilder]: Removed 98 assue(true) statements. [2019-01-01 23:47:09,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:09 BoogieIcfgContainer [2019-01-01 23:47:09,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:47:09,843 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:47:09,843 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:47:09,846 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:47:09,847 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:09,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:47:07" (1/3) ... [2019-01-01 23:47:09,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62df96de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:09, skipping insertion in model container [2019-01-01 23:47:09,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:09,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:08" (2/3) ... [2019-01-01 23:47:09,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62df96de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:09, skipping insertion in model container [2019-01-01 23:47:09,850 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:09,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:09" (3/3) ... [2019-01-01 23:47:09,852 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product34_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:09,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:47:09,908 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:47:09,908 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:47:09,908 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:47:09,909 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:47:09,909 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:47:09,909 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:47:09,909 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:47:09,909 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:47:09,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-01 23:47:09,955 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:47:09,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:09,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:09,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:09,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:09,966 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:47:09,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-01 23:47:09,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:47:09,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:09,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:09,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:09,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:09,982 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;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);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 20#L-1true havoc main_#res;havoc main_#t~ret2, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 57#L195true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 71#L203true main_#t~ret2 := valid_product_#res;main_~tmp~1 := main_#t~ret2;havoc main_#t~ret2; 70#L159true assume 0 != main_~tmp~1; 41#L132true havoc test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 11#L51-1true [2019-01-01 23:47:09,991 INFO L796 eck$LassoCheckResult]: Loop: 11#L51-1true assume !false; 30#L220true assume test_~splverifierCounter~0 < 4; 48#L221true test_~tmp~2 := test_#t~nondet4;havoc test_#t~nondet4; 62#L229true assume !(0 != test_~tmp~2); 77#L229-1true test_~tmp___0~1 := test_#t~nondet5;havoc test_#t~nondet5; 43#L239true assume !(0 != test_~tmp___0~1); 58#L239-1true test_~tmp___2~0 := test_#t~nondet6;havoc test_#t~nondet6; 40#L249true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 53#L257-2true assume !(0 != ~pumpRunning~0); 38#L289true assume !(0 != ~systemActive~0); 14#L296true havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 59#L517true __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 16#L51true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 11#L51-1true [2019-01-01 23:47:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:09,999 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:47:10,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:10,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:10,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1680575549, now seen corresponding path program 1 times [2019-01-01 23:47:10,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:10,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:10,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:10,914 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:10,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:10,931 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-01-01 23:47:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:11,030 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2019-01-01 23:47:11,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:11,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 104 transitions. [2019-01-01 23:47:11,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-01 23:47:11,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2019-01-01 23:47:11,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-01 23:47:11,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:47:11,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-01-01 23:47:11,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:11,050 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-01 23:47:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-01-01 23:47:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-01 23:47:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 23:47:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-01-01 23:47:11,089 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-01 23:47:11,089 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-01 23:47:11,089 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:47:11,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-01-01 23:47:11,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-01 23:47:11,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:11,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:11,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:11,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:11,095 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;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);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 188#L-1 havoc main_#res;havoc main_#t~ret2, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 189#L195 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 222#L203 main_#t~ret2 := valid_product_#res;main_~tmp~1 := main_#t~ret2;havoc main_#t~ret2; 225#L159 assume 0 != main_~tmp~1; 214#L132 havoc test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 174#L51-1 [2019-01-01 23:47:11,095 INFO L796 eck$LassoCheckResult]: Loop: 174#L51-1 assume !false; 175#L220 assume test_~splverifierCounter~0 < 4; 200#L221 test_~tmp~2 := test_#t~nondet4;havoc test_#t~nondet4; 219#L229 assume !(0 != test_~tmp~2); 172#L229-1 test_~tmp___0~1 := test_#t~nondet5;havoc test_#t~nondet5; 215#L239 assume !(0 != test_~tmp___0~1); 199#L239-1 test_~tmp___2~0 := test_#t~nondet6;havoc test_#t~nondet6; 211#L249 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 212#L257-2 assume !(0 != ~pumpRunning~0); 209#L289 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 176#L321 assume !(0 == ~pumpRunning~0); 177#L296 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 179#L517 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 180#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 174#L51-1 [2019-01-01 23:47:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:47:11,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash -589844997, now seen corresponding path program 1 times [2019-01-01 23:47:11,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:11,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:11,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:11,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:11,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:11,502 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:11,504 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-01-01 23:47:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:11,679 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2019-01-01 23:47:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:11,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2019-01-01 23:47:11,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2019-01-01 23:47:11,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 147 transitions. [2019-01-01 23:47:11,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-01 23:47:11,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-01 23:47:11,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 147 transitions. [2019-01-01 23:47:11,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:11,689 INFO L705 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-01 23:47:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 147 transitions. [2019-01-01 23:47:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-01 23:47:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 23:47:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2019-01-01 23:47:11,700 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-01 23:47:11,700 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-01 23:47:11,700 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:47:11,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 147 transitions. [2019-01-01 23:47:11,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2019-01-01 23:47:11,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:11,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:11,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:11,704 INFO L867 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-01-01 23:47:11,704 INFO L794 eck$LassoCheckResult]: Stem: 392#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;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);~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 373#L-1 havoc main_#res;havoc main_#t~ret2, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 374#L195 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 409#L203 main_#t~ret2 := valid_product_#res;main_~tmp~1 := main_#t~ret2;havoc main_#t~ret2; 416#L159 assume 0 != main_~tmp~1; 398#L132 havoc test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 361#L51-1 [2019-01-01 23:47:11,706 INFO L796 eck$LassoCheckResult]: Loop: 361#L51-1 assume !false; 362#L220 assume test_~splverifierCounter~0 < 4; 386#L221 test_~tmp~2 := test_#t~nondet4;havoc test_#t~nondet4; 404#L229 assume !(0 != test_~tmp~2); 358#L229-1 test_~tmp___0~1 := test_#t~nondet5;havoc test_#t~nondet5; 399#L239 assume !(0 != test_~tmp___0~1); 385#L239-1 test_~tmp___2~0 := test_#t~nondet6;havoc test_#t~nondet6; 395#L249 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 396#L257-2 assume !(0 != ~pumpRunning~0); 393#L289 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 359#L321 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret26, isHighWaterLevel_~retValue_acc~5, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~5;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 360#L525 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 375#L530 isHighWaterLevel_#t~ret26 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret26;havoc isHighWaterLevel_#t~ret26; 376#L423 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~2 := 0; 417#L423-2 isHighWaterLevel_~retValue_acc~5 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~5; 401#L429 processEnvironment_#t~ret8 := isHighWaterLevel_#res;processEnvironment_~tmp~3 := processEnvironment_#t~ret8;havoc processEnvironment_#t~ret8; 381#L325 assume !(0 != processEnvironment_~tmp~3); 363#L296 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 364#L517 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 365#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 361#L51-1 [2019-01-01 23:47:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:47:11,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:11,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1033973017, now seen corresponding path program 1 times [2019-01-01 23:47:11,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:11,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1019261043, now seen corresponding path program 1 times [2019-01-01 23:47:11,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:11,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:11,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:13,031 WARN L181 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-01 23:47:13,429 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 23:47:45,917 WARN L181 SmtUtils]: Spent 32.47 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:01,422 WARN L181 SmtUtils]: Spent 15.50 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:01,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:01 BoogieIcfgContainer [2019-01-01 23:48:01,499 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:01,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:01,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:01,499 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:01,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:09" (3/4) ... [2019-01-01 23:48:01,505 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:01,624 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:01,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:01,625 INFO L168 Benchmark]: Toolchain (without parser) took 53740.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 947.3 MB in the beginning and 945.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 321.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,627 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:01,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,629 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:01,630 INFO L168 Benchmark]: RCFGBuilder took 1149.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,630 INFO L168 Benchmark]: BuchiAutomizer took 51655.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 956.7 MB in the end (delta: 113.0 MB). Peak memory consumption was 428.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,633 INFO L168 Benchmark]: Witness Printer took 124.88 ms. Allocated memory is still 1.3 GB. Free memory was 956.7 MB in the beginning and 945.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,639 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 599.94 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1149.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51655.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 956.7 MB in the end (delta: 113.0 MB). Peak memory consumption was 428.8 MB. Max. memory is 11.5 GB. * Witness Printer took 124.88 ms. Allocated memory is still 1.3 GB. Free memory was 956.7 MB in the beginning and 945.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 51.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 109 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 212 SDtfs, 178 SDslu, 48 SDs, 0 SdLazy, 24 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 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: 219]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=-12, NULL=0, NULL=0, NULL=-10, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cd2fd5f=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@161d0b4d=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67443172=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1082040c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7224ad7d=0, NULL=-25, NULL=-18, NULL=-13, methaneLevelCritical=0, tmp___0=0, tmp=0, retValue_acc=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-24, NULL=0, tmp___1=0, NULL=-9, tmp___0=0, NULL=-1, NULL=-23, cleanupTimeShifts=4, NULL=-3, NULL=-5, NULL=-19, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-11, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23ffa66=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@684a2e98=0, NULL=-15, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37c8dbc6=0, \result=0, NULL=-17, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=-2, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e60cd3c=0, NULL=-6, NULL=0, NULL=0, NULL=-22, tmp=1, NULL=0, NULL=0, NULL=0, \result=1, NULL=-21, tmp=1, tmp=1, retValue_acc=1, retValue_acc=1, tmp___2=71, NULL=-14, tmp___0=0, splverifierCounter=0, NULL=0, NULL=-16, tmp=0, head=0, NULL=0, NULL=-8, NULL=-7, NULL=0, NULL=0, NULL=-4, NULL=-20} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L69] int cleanupTimeShifts = 4; [L282] int pumpRunning = 0; [L283] int systemActive = 1; [L442] int waterLevel = 1; [L443] int methaneLevelCritical = 0; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L150] int retValue_acc ; [L151] int tmp ; [L199] int retValue_acc ; [L202] retValue_acc = 1 [L203] return (retValue_acc); [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) [L210] int splverifierCounter ; [L211] int tmp ; [L212] int tmp___0 ; [L213] int tmp___1 ; [L214] int tmp___2 ; [L217] splverifierCounter = 0 Loop: [L219] COND TRUE 1 [L221] COND TRUE splverifierCounter < 4 [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 [L289] COND FALSE !(\read(pumpRunning)) [L296] COND TRUE \read(systemActive) [L318] int tmp ; [L321] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L522] int retValue_acc ; [L525] COND TRUE waterLevel < 2 [L526] retValue_acc = 1 [L527] return (retValue_acc); [L421] tmp = isHighWaterSensorDry() [L423] COND TRUE \read(tmp) [L424] tmp___0 = 0 [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); [L323] tmp = isHighWaterLevel() [L325] COND FALSE !(\read(tmp)) [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...