./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec5_product20.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 fab453ece5fcff1538ea80c83122b1ca9f5a0f1e ................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:12:48,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:12:48,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:12:48,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:12:48,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:12:48,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:12:48,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:12:48,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:12:48,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:12:48,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:12:48,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:12:48,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:12:48,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:12:48,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:12:48,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:12:48,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:12:48,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:12:48,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:12:48,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:12:48,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:12:48,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:12:48,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:12:48,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:12:48,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:12:48,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:12:48,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:12:48,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:12:48,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:12:48,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:12:48,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:12:48,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:12:48,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:12:48,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:12:48,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:12:48,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:12:48,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:12:48,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:12:48,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:12:48,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:12:48,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:12:48,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:12:48,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:12:48,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:12:48,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:12:48,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:12:48,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:12:48,896 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:12:48,896 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:12:48,896 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:12:48,896 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:12:48,899 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:12:48,899 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:12:48,899 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:12:48,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:12:48,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:12:48,900 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:12:48,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:12:48,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:12:48,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:12:48,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:12:48,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:12:48,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:12:48,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:12:48,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:12:48,904 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:12:48,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:12:48,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:12:48,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:12:48,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:12:48,905 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:12:48,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:12:48,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:12:48,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:12:48,908 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:12:48,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:12:48,911 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> fab453ece5fcff1538ea80c83122b1ca9f5a0f1e [2019-11-28 21:12:49,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:12:49,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:12:49,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:12:49,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:12:49,282 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:12:49,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product20.cil.c [2019-11-28 21:12:49,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea0ea46e/182224d856cf4d729a7b629038f93bf9/FLAG3ea6cd6ff [2019-11-28 21:12:49,815 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:12:49,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product20.cil.c [2019-11-28 21:12:49,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea0ea46e/182224d856cf4d729a7b629038f93bf9/FLAG3ea6cd6ff [2019-11-28 21:12:50,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea0ea46e/182224d856cf4d729a7b629038f93bf9 [2019-11-28 21:12:50,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:12:50,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:12:50,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:12:50,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:12:50,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:12:50,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:50,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2f9c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50, skipping insertion in model container [2019-11-28 21:12:50,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:50,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:12:50,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:12:50,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:12:50,757 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:12:50,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:12:50,941 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:12:50,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50 WrapperNode [2019-11-28 21:12:50,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:12:50,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:12:50,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:12:50,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:12:50,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:50,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:12:51,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:12:51,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:12:51,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:12:51,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (1/1) ... [2019-11-28 21:12:51,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:12:51,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:12:51,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:12:51,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:12:51,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (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-11-28 21:12:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:12:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 21:12:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:12:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:12:51,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:12:51,926 INFO L287 CfgBuilder]: Removed 116 assume(true) statements. [2019-11-28 21:12:51,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:12:51 BoogieIcfgContainer [2019-11-28 21:12:51,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:12:51,929 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:12:51,929 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:12:51,933 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:12:51,934 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:51,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:12:50" (1/3) ... [2019-11-28 21:12:51,936 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1be41d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:12:51, skipping insertion in model container [2019-11-28 21:12:51,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:51,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:50" (2/3) ... [2019-11-28 21:12:51,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1be41d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:12:51, skipping insertion in model container [2019-11-28 21:12:51,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:51,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:12:51" (3/3) ... [2019-11-28 21:12:51,941 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product20.cil.c [2019-11-28 21:12:51,992 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:12:51,992 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:12:51,993 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:12:51,993 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:12:51,993 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:12:51,993 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:12:51,993 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:12:51,994 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:12:52,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-11-28 21:12:52,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-28 21:12:52,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:52,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:52,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,048 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:12:52,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2019-11-28 21:12:52,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-11-28 21:12:52,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:52,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:52,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,056 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,062 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; 7#L-1true havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 26#L578true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 53#L586true main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 69#L686true assume 0 != main_~tmp~4; 5#L661true ~switchedOnBeforeTS~0 := 0; 57#L510true havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 34#L531-1true [2019-11-28 21:12:52,063 INFO L796 eck$LassoCheckResult]: Loop: 34#L531-1true assume !false; 9#L713true assume test_~splverifierCounter~0 < 4; 54#L714true test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 61#L722true assume !(0 != test_~tmp~5); 64#L722-1true test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 36#L732true assume !(0 != test_~tmp___0~1); 40#L732-1true test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 15#L742true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 24#L750-1true havoc __utac_acc__Specification5_spec__2_#t~ret45;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 44#L868true __utac_acc__Specification5_spec__2_#t~ret45 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret45;havoc __utac_acc__Specification5_spec__2_#t~ret45; 33#L520true assume !(0 != ~pumpRunning~0); 42#L783true assume !(0 != ~systemActive~0); 28#L790true havoc __utac_acc__Specification5_spec__3_#t~ret46, __utac_acc__Specification5_spec__3_#t~ret47, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 59#L488true __utac_acc__Specification5_spec__3_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret46;havoc __utac_acc__Specification5_spec__3_#t~ret46; 31#L531true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 34#L531-1true [2019-11-28 21:12:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-11-28 21:12:52,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:52,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369457563] [2019-11-28 21:12:52,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash 675133686, now seen corresponding path program 1 times [2019-11-28 21:12:52,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:52,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869842141] [2019-11-28 21:12:52,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:12:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:12:52,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869842141] [2019-11-28 21:12:52,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:12:52,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:12:52,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583393988] [2019-11-28 21:12:52,615 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:12:52,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:12:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:12:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:12:52,636 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2019-11-28 21:12:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:12:52,727 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2019-11-28 21:12:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:12:52,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 221 transitions. [2019-11-28 21:12:52,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2019-11-28 21:12:52,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 145 states and 206 transitions. [2019-11-28 21:12:52,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2019-11-28 21:12:52,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-11-28 21:12:52,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 206 transitions. [2019-11-28 21:12:52,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:12:52,751 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 206 transitions. [2019-11-28 21:12:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 206 transitions. [2019-11-28 21:12:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-11-28 21:12:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 21:12:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2019-11-28 21:12:52,795 INFO L711 BuchiCegarLoop]: Abstraction has 143 states and 203 transitions. [2019-11-28 21:12:52,795 INFO L591 BuchiCegarLoop]: Abstraction has 143 states and 203 transitions. [2019-11-28 21:12:52,796 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:12:52,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 203 transitions. [2019-11-28 21:12:52,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 100 [2019-11-28 21:12:52,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:52,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:52,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:52,801 INFO L794 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; 261#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 262#L578 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 288#L586 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 330#L686 assume 0 != main_~tmp~4; 257#L661 ~switchedOnBeforeTS~0 := 0; 258#L510 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 332#L531-1 [2019-11-28 21:12:52,801 INFO L796 eck$LassoCheckResult]: Loop: 332#L531-1 assume !false; 351#L713 assume test_~splverifierCounter~0 < 4; 352#L714 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 337#L722 assume !(0 != test_~tmp~5); 277#L722-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 304#L732 assume !(0 != test_~tmp___0~1); 306#L732-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 272#L742 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 274#L750-1 havoc __utac_acc__Specification5_spec__2_#t~ret45;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 285#L868 __utac_acc__Specification5_spec__2_#t~ret45 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret45;havoc __utac_acc__Specification5_spec__2_#t~ret45; 318#L520 assume !(0 != ~pumpRunning~0); 314#L783 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 315#L815 assume !(0 != ~pumpRunning~0); 356#L790 havoc __utac_acc__Specification5_spec__3_#t~ret46, __utac_acc__Specification5_spec__3_#t~ret47, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 335#L488 __utac_acc__Specification5_spec__3_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret46;havoc __utac_acc__Specification5_spec__3_#t~ret46; 336#L531 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 332#L531-1 [2019-11-28 21:12:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-11-28 21:12:52,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:52,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581455582] [2019-11-28 21:12:52,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash -572685309, now seen corresponding path program 1 times [2019-11-28 21:12:52,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696055951] [2019-11-28 21:12:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:52,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -747445943, now seen corresponding path program 1 times [2019-11-28 21:12:52,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:52,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109279519] [2019-11-28 21:12:52,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:12:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:12:53,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109279519] [2019-11-28 21:12:53,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:12:53,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:12:53,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057836490] [2019-11-28 21:12:53,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:12:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:12:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:12:53,208 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. cyclomatic complexity: 63 Second operand 5 states. [2019-11-28 21:12:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:12:53,411 INFO L93 Difference]: Finished difference Result 398 states and 558 transitions. [2019-11-28 21:12:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:12:53,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 558 transitions. [2019-11-28 21:12:53,421 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-11-28 21:12:53,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 398 states and 558 transitions. [2019-11-28 21:12:53,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2019-11-28 21:12:53,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2019-11-28 21:12:53,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 398 states and 558 transitions. [2019-11-28 21:12:53,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:12:53,432 INFO L688 BuchiCegarLoop]: Abstraction has 398 states and 558 transitions. [2019-11-28 21:12:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states and 558 transitions. [2019-11-28 21:12:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 279. [2019-11-28 21:12:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-28 21:12:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 385 transitions. [2019-11-28 21:12:53,454 INFO L711 BuchiCegarLoop]: Abstraction has 279 states and 385 transitions. [2019-11-28 21:12:53,454 INFO L591 BuchiCegarLoop]: Abstraction has 279 states and 385 transitions. [2019-11-28 21:12:53,454 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:12:53,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 385 transitions. [2019-11-28 21:12:53,458 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-11-28 21:12:53,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:53,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:53,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:53,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:53,460 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;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);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(13);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string59.base, #t~string59.offset, 1);call write~init~int(110, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 2 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string61.base, #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(102, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string63.base, #t~string63.offset, 1);call write~init~int(80, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(117, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(109, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(112, #t~string63.base, 4 + #t~string63.offset, 1);call write~init~int(58, #t~string63.base, 5 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 6 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(110, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string67.base, #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(102, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string69.base, #t~string69.offset, 1);call write~init~int(32, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; 818#L-1 havoc main_#res;havoc main_#t~ret49, main_~retValue_acc~8, main_~tmp~4;havoc main_~retValue_acc~8;havoc main_~tmp~4; 819#L578 havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 845#L586 main_#t~ret49 := valid_product_#res;main_~tmp~4 := main_#t~ret49;havoc main_#t~ret49; 882#L686 assume 0 != main_~tmp~4; 814#L661 ~switchedOnBeforeTS~0 := 0; 815#L510 havoc test_#t~nondet50, test_#t~nondet51, test_#t~nondet52, test_#t~nondet53, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 886#L531-1 [2019-11-28 21:12:53,460 INFO L796 eck$LassoCheckResult]: Loop: 886#L531-1 assume !false; 1060#L713 assume test_~splverifierCounter~0 < 4; 1059#L714 test_~tmp~5 := test_#t~nondet50;havoc test_#t~nondet50; 1058#L722 assume !(0 != test_~tmp~5); 1053#L722-1 test_~tmp___0~1 := test_#t~nondet51;havoc test_#t~nondet51; 1051#L732 assume !(0 != test_~tmp___0~1); 1047#L732-1 test_~tmp___2~0 := test_#t~nondet52;havoc test_#t~nondet52; 1045#L742 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 831#L750-1 havoc __utac_acc__Specification5_spec__2_#t~ret45;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 1038#L868 __utac_acc__Specification5_spec__2_#t~ret45 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret45;havoc __utac_acc__Specification5_spec__2_#t~ret45; 1035#L520 assume !(0 != ~pumpRunning~0); 1036#L783 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret54, processEnvironment_~tmp~6;havoc processEnvironment_~tmp~6; 1081#L815 assume !(0 != ~pumpRunning~0); 1077#L790 havoc __utac_acc__Specification5_spec__3_#t~ret46, __utac_acc__Specification5_spec__3_#t~ret47, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 1076#L488 __utac_acc__Specification5_spec__3_#t~ret46 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret46;havoc __utac_acc__Specification5_spec__3_#t~ret46; 849#L531 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~10;havoc isPumpRunning_~retValue_acc~10;isPumpRunning_~retValue_acc~10 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~10; 850#L868-1 __utac_acc__Specification5_spec__3_#t~ret47 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret47;havoc __utac_acc__Specification5_spec__3_#t~ret47; 1063#L535 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 886#L531-1 [2019-11-28 21:12:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-11-28 21:12:53,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:53,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047011167] [2019-11-28 21:12:53,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash -594781890, now seen corresponding path program 1 times [2019-11-28 21:12:53,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:53,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919783530] [2019-11-28 21:12:53,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1036026620, now seen corresponding path program 1 times [2019-11-28 21:12:53,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:53,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73598572] [2019-11-28 21:12:53,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:53,697 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:53,813 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-28 21:13:23,655 WARN L192 SmtUtils]: Spent 29.78 s on a formula simplification. DAG size of input: 456 DAG size of output: 404 [2019-11-28 21:13:38,569 WARN L192 SmtUtils]: Spent 14.91 s on a formula simplification that was a NOOP. DAG size: 402 [2019-11-28 21:13:38,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:13:38 BoogieIcfgContainer [2019-11-28 21:13:38,667 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:13:38,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:13:38,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:13:38,668 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:13:38,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:12:51" (3/4) ... [2019-11-28 21:13:38,671 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:13:38,732 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:13:38,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:13:38,734 INFO L168 Benchmark]: Toolchain (without parser) took 48569.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -266.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:38,735 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:13:38,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:38,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.54 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-11-28 21:13:38,737 INFO L168 Benchmark]: Boogie Preprocessor took 39.68 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-11-28 21:13:38,737 INFO L168 Benchmark]: RCFGBuilder took 866.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:38,738 INFO L168 Benchmark]: BuchiAutomizer took 46737.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.9 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:38,738 INFO L168 Benchmark]: Witness Printer took 65.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:13:38,742 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.54 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. * Boogie Preprocessor took 39.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 866.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 46737.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.9 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 5 locations. The remainder module has 279 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 46.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 121 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 279 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 281 SDtfs, 458 SDslu, 422 SDs, 0 SdLazy, 92 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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: 712]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7746} State at position 1 is {NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38cf11da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a1637f0=0, NULL=7746, NULL=0, NULL=7757, NULL=0, NULL=0, NULL=7775, NULL=7758, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1daabc4b=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3137b742=71, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@278b84c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30f437b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c421249=0, tmp=1, NULL=0, NULL=0, tmp=0, NULL=0, tmp___1=0, NULL=7761, NULL=7748, NULL=7756, NULL=7760, NULL=7766, retValue_acc=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=7750, NULL=7754, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14e9a416=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55843973=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=7755, \result=1, NULL=0, NULL=0, NULL=0, NULL=7752, NULL=0, tmp___0=0, \result=1, NULL=7751, head=0, pumpRunning=0, NULL=7749, \result=0, NULL=7763, tmp=1, NULL=0, NULL=0, NULL=0, NULL=7759, NULL=7777, retValue_acc=1, NULL=7762, NULL=0, tmp___2=71, retValue_acc=1, NULL=7772, tmp___0=0, splverifierCounter=0, NULL=0, NULL=7776, head=0, NULL=0, NULL=7771, tmp=0, NULL=7747, NULL=0, NULL=7764, NULL=0, NULL=0, NULL=7778, NULL=7753} - 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; [L413] int waterLevel = 1; [L414] int methaneLevelCritical = 0; [L504] int switchedOnBeforeTS ; [L600] int cleanupTimeShifts = 4; [L773] int pumpRunning = 0; [L774] int systemActive = 1; [L677] int retValue_acc ; [L678] int tmp ; [L582] int retValue_acc ; [L585] retValue_acc = 1 [L586] return (retValue_acc); [L684] tmp = valid_product() [L686] COND TRUE \read(tmp) [L509] switchedOnBeforeTS = 0 [L703] int splverifierCounter ; [L704] int tmp ; [L705] int tmp___0 ; [L706] int tmp___1 ; [L707] int tmp___2 ; [L710] splverifierCounter = 0 Loop: [L712] COND TRUE 1 [L714] COND TRUE splverifierCounter < 4 [L720] tmp = __VERIFIER_nondet_int() [L722] COND FALSE !(\read(tmp)) [L730] tmp___0 = __VERIFIER_nondet_int() [L732] COND FALSE !(\read(tmp___0)) [L740] tmp___2 = __VERIFIER_nondet_int() [L742] COND TRUE \read(tmp___2) [L946] systemActive = 1 [L864] int retValue_acc ; [L867] retValue_acc = pumpRunning [L868] return (retValue_acc); [L518] switchedOnBeforeTS = isPumpRunning() [L783] COND FALSE !(\read(pumpRunning)) [L790] COND TRUE \read(systemActive) [L812] int tmp ; [L815] COND FALSE !(\read(pumpRunning)) [L524] int tmp ; [L525] int tmp___0 ; [L484] int retValue_acc ; [L487] retValue_acc = waterLevel [L488] return (retValue_acc); [L529] tmp = getWaterLevel() [L531] COND TRUE tmp != 2 [L864] int retValue_acc ; [L867] retValue_acc = pumpRunning [L868] return (retValue_acc); [L533] tmp___0 = isPumpRunning() [L535] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...