./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product63_true-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_product63_true-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 3f5feda30a80cf6aabd7a2a811c7fc0f92333d0d ...................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:49:00,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:49:00,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:49:00,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:49:00,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:49:00,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:49:00,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:49:00,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:49:00,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:49:00,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:49:00,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:49:00,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:49:00,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:49:00,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:49:00,801 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:49:00,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:49:00,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:49:00,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:49:00,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:49:00,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:49:00,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:49:00,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:49:00,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:49:00,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:49:00,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:49:00,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:49:00,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:49:00,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:49:00,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:49:00,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:49:00,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:49:00,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:49:00,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:49:00,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:49:00,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:49:00,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:49:00,849 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:49:00,872 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:49:00,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:49:00,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:49:00,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:49:00,873 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:49:00,874 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:49:00,874 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:49:00,875 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:49:00,875 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:49:00,875 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:49:00,875 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:49:00,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:49:00,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:49:00,878 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:49:00,878 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:49:00,878 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:49:00,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:49:00,879 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:49:00,879 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:49:00,879 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:49:00,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:49:00,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:49:00,881 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:49:00,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:49:00,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:49:00,881 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:49:00,883 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:49:00,883 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 -> 3f5feda30a80cf6aabd7a2a811c7fc0f92333d0d [2019-01-01 23:49:00,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:49:00,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:49:00,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:49:00,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:49:00,937 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:49:00,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product63_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:00,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6aa51b3/f4045a5921d84d4f936e5f9bd0bf5b44/FLAGeef35d7cd [2019-01-01 23:49:01,514 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:49:01,515 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product63_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:01,528 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6aa51b3/f4045a5921d84d4f936e5f9bd0bf5b44/FLAGeef35d7cd [2019-01-01 23:49:01,786 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef6aa51b3/f4045a5921d84d4f936e5f9bd0bf5b44 [2019-01-01 23:49:01,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:49:01,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:49:01,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:01,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:49:01,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:49:01,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:01" (1/1) ... [2019-01-01 23:49:01,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457b6fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:01, skipping insertion in model container [2019-01-01 23:49:01,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:01" (1/1) ... [2019-01-01 23:49:01,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:49:01,875 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:49:02,302 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:02,319 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:49:02,494 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:02,539 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:49:02,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02 WrapperNode [2019-01-01 23:49:02,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:02,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:02,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:49:02,541 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:49:02,549 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:49:02" (1/1) ... [2019-01-01 23:49:02,573 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:49:02" (1/1) ... [2019-01-01 23:49:02,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:02,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:49:02,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:49:02,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:49:02,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (1/1) ... [2019-01-01 23:49:02,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:49:02,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:49:02,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:49:02,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:49:02,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (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:49:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:49:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:49:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:49:02,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:49:04,955 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:49:04,955 INFO L280 CfgBuilder]: Removed 352 assue(true) statements. [2019-01-01 23:49:04,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:04 BoogieIcfgContainer [2019-01-01 23:49:04,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:49:04,957 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:49:04,957 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:49:04,960 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:49:04,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:04,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:49:01" (1/3) ... [2019-01-01 23:49:04,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e179133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:04, skipping insertion in model container [2019-01-01 23:49:04,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:04,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:02" (2/3) ... [2019-01-01 23:49:04,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e179133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:04, skipping insertion in model container [2019-01-01 23:49:04,964 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:04,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:04" (3/3) ... [2019-01-01 23:49:04,966 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product63_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:05,021 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:49:05,022 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:49:05,022 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:49:05,022 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:49:05,022 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:49:05,022 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:49:05,023 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:49:05,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:49:05,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:49:05,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states. [2019-01-01 23:49:05,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 147 [2019-01-01 23:49:05,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:05,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:05,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:49:05,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:05,099 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:49:05,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states. [2019-01-01 23:49:05,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 147 [2019-01-01 23:49:05,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:05,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:05,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:49:05,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:05,120 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 6#L-1true havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 45#L532true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 195#L540true main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 196#L496true assume 0 != main_~tmp~3; 181#L469true havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~11, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~11;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 89#L556-1true [2019-01-01 23:49:05,121 INFO L796 eck$LassoCheckResult]: Loop: 89#L556-1true assume !false; 210#L960true assume test_~splverifierCounter~0 < 4; 198#L961true test_~tmp~11 := test_#t~nondet72;havoc test_#t~nondet72; 71#L969true assume !(0 != test_~tmp~11); 74#L969-1true test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 116#L979true assume !(0 != test_~tmp___0~3); 117#L979-1true test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 46#L989true assume 0 != test_~tmp___2~0; 16#L995-1true assume !(0 != ~pumpRunning~0); 218#L701true assume !(0 != ~systemActive~0); 50#L708true havoc __utac_acc__Specification4_spec__1_#t~ret37, __utac_acc__Specification4_spec__1_#t~ret38, __utac_acc__Specification4_spec__1_~tmp~4, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~4;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; 3#L654true __utac_acc__Specification4_spec__1_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~4 := __utac_acc__Specification4_spec__1_#t~ret37;havoc __utac_acc__Specification4_spec__1_#t~ret37; 86#L556true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~4); 89#L556-1true [2019-01-01 23:49:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:49:05,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:05,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1666538037, now seen corresponding path program 1 times [2019-01-01 23:49:06,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:06,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 47740901, now seen corresponding path program 1 times [2019-01-01 23:49:06,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:06,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:06,552 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:49:06,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:06,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:49:06,858 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:49:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:49:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:49:07,015 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 6 states. [2019-01-01 23:49:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:07,699 INFO L93 Difference]: Finished difference Result 492 states and 714 transitions. [2019-01-01 23:49:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:49:07,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 714 transitions. [2019-01-01 23:49:07,727 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 321 [2019-01-01 23:49:07,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 471 states and 693 transitions. [2019-01-01 23:49:07,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2019-01-01 23:49:07,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2019-01-01 23:49:07,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 693 transitions. [2019-01-01 23:49:07,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:07,765 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 693 transitions. [2019-01-01 23:49:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 693 transitions. [2019-01-01 23:49:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 258. [2019-01-01 23:49:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-01 23:49:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 378 transitions. [2019-01-01 23:49:07,845 INFO L728 BuchiCegarLoop]: Abstraction has 258 states and 378 transitions. [2019-01-01 23:49:07,845 INFO L608 BuchiCegarLoop]: Abstraction has 258 states and 378 transitions. [2019-01-01 23:49:07,845 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:49:07,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 378 transitions. [2019-01-01 23:49:07,848 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 176 [2019-01-01 23:49:07,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:07,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:07,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:49:07,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:07,850 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 740#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 741#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 806#L540 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 939#L496 assume 0 != main_~tmp~3; 938#L469 havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~11, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~11;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 788#L556-1 [2019-01-01 23:49:07,851 INFO L796 eck$LassoCheckResult]: Loop: 788#L556-1 assume !false; 854#L960 assume test_~splverifierCounter~0 < 4; 940#L961 test_~tmp~11 := test_#t~nondet72;havoc test_#t~nondet72; 837#L969 assume !(0 != test_~tmp~11); 839#L969-1 test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 841#L979 assume !(0 != test_~tmp___0~3); 820#L979-1 test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 807#L989 assume 0 != test_~tmp___2~0; 754#L995-1 assume !(0 != ~pumpRunning~0); 759#L701 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 822#L785 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret50, processEnvironment__wrappee__methaneQuery_~tmp~6;havoc processEnvironment__wrappee__methaneQuery_~tmp~6; 824#L759-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret49, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 880#L733-3 assume !(0 == ~pumpRunning~0); 813#L708 havoc __utac_acc__Specification4_spec__1_#t~ret37, __utac_acc__Specification4_spec__1_#t~ret38, __utac_acc__Specification4_spec__1_~tmp~4, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~4;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; 734#L654 __utac_acc__Specification4_spec__1_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~4 := __utac_acc__Specification4_spec__1_#t~ret37;havoc __utac_acc__Specification4_spec__1_#t~ret37; 735#L556 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~4); 788#L556-1 [2019-01-01 23:49:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:49:07,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:07,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:07,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1439331007, now seen corresponding path program 1 times [2019-01-01 23:49:08,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:08,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:08,232 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:49:08,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:08,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:49:08,233 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:49:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:49:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:49:08,234 INFO L87 Difference]: Start difference. First operand 258 states and 378 transitions. cyclomatic complexity: 123 Second operand 3 states. [2019-01-01 23:49:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:08,879 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2019-01-01 23:49:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:49:08,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 346 transitions. [2019-01-01 23:49:08,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 176 [2019-01-01 23:49:08,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 252 states and 346 transitions. [2019-01-01 23:49:08,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2019-01-01 23:49:08,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2019-01-01 23:49:08,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 346 transitions. [2019-01-01 23:49:08,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:08,888 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 346 transitions. [2019-01-01 23:49:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 346 transitions. [2019-01-01 23:49:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-01 23:49:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-01 23:49:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 346 transitions. [2019-01-01 23:49:08,905 INFO L728 BuchiCegarLoop]: Abstraction has 252 states and 346 transitions. [2019-01-01 23:49:08,905 INFO L608 BuchiCegarLoop]: Abstraction has 252 states and 346 transitions. [2019-01-01 23:49:08,906 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:49:08,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 252 states and 346 transitions. [2019-01-01 23:49:08,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 176 [2019-01-01 23:49:08,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:08,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:08,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:49:08,910 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, 1, 1] [2019-01-01 23:49:08,910 INFO L794 eck$LassoCheckResult]: Stem: 1410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(13);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string42.base, #t~string42.offset, 1);call write~init~int(77, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(101, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(116, #t~string42.base, 3 + #t~string42.offset, 1);call write~init~int(104, #t~string42.base, 4 + #t~string42.offset, 1);call write~init~int(58, #t~string42.base, 5 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 6 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string44.base, #t~string44.offset, 1);call write~init~int(82, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(73, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(84, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 4 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string46.base, #t~string46.offset, 1);call write~init~int(75, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 2 + #t~string46.offset, 1);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string48.base, #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 1 + #t~string48.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(13);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string57.base, #t~string57.offset, 1);call write~init~int(110, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 2 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(102, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(80, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(117, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(109, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(112, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string69.base, #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 1 + #t~string69.offset, 1); 1284#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 1285#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 1368#L540 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 1381#L496 assume 0 != main_~tmp~3; 1365#L469 havoc test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_~splverifierCounter~0, test_~tmp~11, test_~tmp___0~3, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~11;havoc test_~tmp___0~3;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1349#L556-1 [2019-01-01 23:49:08,911 INFO L796 eck$LassoCheckResult]: Loop: 1349#L556-1 assume !false; 1408#L960 assume test_~splverifierCounter~0 < 4; 1426#L961 test_~tmp~11 := test_#t~nondet72;havoc test_#t~nondet72; 1475#L969 assume !(0 != test_~tmp~11); 1398#L969-1 test_~tmp___0~3 := test_#t~nondet73;havoc test_#t~nondet73; 1399#L979 assume !(0 != test_~tmp___0~3); 1380#L979-1 test_~tmp___2~0 := test_#t~nondet74;havoc test_#t~nondet74; 1470#L989 assume 0 != test_~tmp___2~0; 1316#L995-1 assume !(0 != ~pumpRunning~0); 1317#L701 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~7;havoc processEnvironment_~tmp~7; 1382#L785 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret50, processEnvironment__wrappee__methaneQuery_~tmp~6;havoc processEnvironment__wrappee__methaneQuery_~tmp~6; 1383#L759-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret49, processEnvironment__wrappee__highWaterSensor_~tmp~5;havoc processEnvironment__wrappee__highWaterSensor_~tmp~5; 1377#L733-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret70, isHighWaterLevel_~retValue_acc~12, isHighWaterLevel_~tmp~9, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~12;havoc isHighWaterLevel_~tmp~9;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 1288#L662-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 1289#L667-3 isHighWaterLevel_#t~ret70 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~9 := isHighWaterLevel_#t~ret70;havoc isHighWaterLevel_#t~ret70; 1328#L904-9 assume 0 != isHighWaterLevel_~tmp~9;isHighWaterLevel_~tmp___0~1 := 0; 1290#L904-11 isHighWaterLevel_~retValue_acc~12 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~12; 1273#L910-3 processEnvironment__wrappee__highWaterSensor_#t~ret49 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~5 := processEnvironment__wrappee__highWaterSensor_#t~ret49;havoc processEnvironment__wrappee__highWaterSensor_#t~ret49; 1274#L737-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~5); 1280#L708 havoc __utac_acc__Specification4_spec__1_#t~ret37, __utac_acc__Specification4_spec__1_#t~ret38, __utac_acc__Specification4_spec__1_~tmp~4, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~4;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; 1252#L654 __utac_acc__Specification4_spec__1_#t~ret37 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~4 := __utac_acc__Specification4_spec__1_#t~ret37;havoc __utac_acc__Specification4_spec__1_#t~ret37; 1253#L556 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~4); 1349#L556-1 [2019-01-01 23:49:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:49:08,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:08,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:08,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:08,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:08,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1579572237, now seen corresponding path program 1 times [2019-01-01 23:49:09,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:09,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1462089933, now seen corresponding path program 1 times [2019-01-01 23:49:09,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:09,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:09,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:10,301 WARN L181 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:49:10,422 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:49:41,204 WARN L181 SmtUtils]: Spent 30.77 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:49:56,061 WARN L181 SmtUtils]: Spent 14.86 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:49:56,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:49:56 BoogieIcfgContainer [2019-01-01 23:49:56,161 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:49:56,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:49:56,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:49:56,162 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:49:56,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:04" (3/4) ... [2019-01-01 23:49:56,168 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:49:56,266 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:49:56,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:49:56,268 INFO L168 Benchmark]: Toolchain (without parser) took 54477.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -350.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:49:56,270 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:49:56,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:56,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.49 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-01-01 23:49:56,271 INFO L168 Benchmark]: Boogie Preprocessor took 113.06 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:56,275 INFO L168 Benchmark]: RCFGBuilder took 2203.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:56,276 INFO L168 Benchmark]: BuchiAutomizer took 51204.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 994.6 MB in the beginning and 1.3 GB in the end (delta: -306.7 MB). Peak memory consumption was 380.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:56,279 INFO L168 Benchmark]: Witness Printer took 105.39 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:49:56,282 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.49 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. * Boogie Preprocessor took 113.06 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2203.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51204.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 994.6 MB in the beginning and 1.3 GB in the end (delta: -306.7 MB). Peak memory consumption was 380.1 MB. Max. memory is 11.5 GB. * Witness Printer took 105.39 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. 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 6 locations. The remainder module has 252 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 49.4s. Construction of modules took 1.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 213 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 258 states and ocurred in iteration 1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 550 SDtfs, 1444 SDslu, 1274 SDs, 0 SdLazy, 85 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 959]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9839} State at position 1 is {NULL=0, NULL=-8, NULL=0, NULL=0, NULL=9839, NULL=-16, NULL=0, retValue_acc=0, NULL=0, NULL=0, NULL=-12, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d64851b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bfcb83b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@181c36f2=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bf287bd=0, NULL=0, NULL=0, NULL=0, tmp___1=0, NULL=-22, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@131b6088=0, NULL=3175, tmp___0=0, NULL=-10, cleanupTimeShifts=4, NULL=-20, NULL=-21, tmp=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-13, \result=1, NULL=0, NULL=0, \result=0, NULL=-6, NULL=0, NULL=0, \result=1, NULL=-1, head=0, pumpRunning=0, retValue_acc=1, NULL=-15, \result=0, NULL=-3, tmp=1, NULL=0, NULL=0, retValue_acc=1, \result=1, NULL=9838, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1db3815a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b47df4f=54, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30b30400=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a5a6016=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@290b0261=0, NULL=-19, NULL=9458, NULL=-5, retValue_acc=0, tmp=1, tmp___0=0, retValue_acc=1, tmp___2=54, tmp=0, NULL=-11, splverifierCounter=0, NULL=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5907504=0, NULL=-17, head=0, NULL=0, NULL=-4, NULL=-9, NULL=0, NULL=-14, tmp=0, NULL=0, NULL=0, NULL=-7, NULL=0, tmp=0, NULL=-18} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L579] int waterLevel = 1; [L580] int methaneLevelCritical = 0; [L694] int pumpRunning = 0; [L695] int systemActive = 1; [L487] int retValue_acc ; [L488] int tmp ; [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) [L950] int splverifierCounter ; [L951] int tmp ; [L952] int tmp___0 ; [L953] int tmp___1 ; [L954] int tmp___2 ; [L957] splverifierCounter = 0 Loop: [L959] COND TRUE 1 [L961] COND TRUE splverifierCounter < 4 [L967] tmp = __VERIFIER_nondet_int() [L969] COND FALSE !(\read(tmp)) [L977] tmp___0 = __VERIFIER_nondet_int() [L979] COND FALSE !(\read(tmp___0)) [L987] tmp___2 = __VERIFIER_nondet_int() [L989] COND TRUE \read(tmp___2) [L701] COND FALSE !(\read(pumpRunning)) [L708] COND TRUE \read(systemActive) [L782] int tmp ; [L785] COND FALSE !(\read(pumpRunning)) [L756] int tmp ; [L759] COND FALSE !(\read(pumpRunning)) [L730] int tmp ; [L733] COND TRUE ! pumpRunning [L896] int retValue_acc ; [L897] int tmp ; [L898] int tmp___0 ; [L659] int retValue_acc ; [L662] COND TRUE waterLevel < 2 [L663] retValue_acc = 1 [L664] return (retValue_acc); [L902] tmp = isHighWaterSensorDry() [L904] COND TRUE \read(tmp) [L905] tmp___0 = 0 [L909] retValue_acc = tmp___0 [L910] return (retValue_acc); [L735] tmp = isHighWaterLevel() [L737] COND FALSE !(\read(tmp)) [L549] int tmp ; [L550] int tmp___0 ; [L650] int retValue_acc ; [L653] retValue_acc = waterLevel [L654] return (retValue_acc); [L554] tmp = getWaterLevel() [L556] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...