./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_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_product52_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 ac98b61700c421642ba0cea32b1043bdcac0ece8 ............................................................................................................................................................................................................................................................................................................................................................................................................................. 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:48:12,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:48:12,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:48:12,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:48:12,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:48:12,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:48:12,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:48:12,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:48:12,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:48:12,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:48:12,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:48:12,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:48:12,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:48:12,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:48:12,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:48:12,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:48:12,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:48:12,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:48:12,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:48:12,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:48:12,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:48:12,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:48:12,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:48:12,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:48:12,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:48:12,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:48:12,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:48:12,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:48:12,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:48:12,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:48:12,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:48:12,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:48:12,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:48:12,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:48:12,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:48:12,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:48:12,926 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:48:12,958 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:48:12,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:48:12,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:48:12,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:48:12,959 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:48:12,961 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:48:12,961 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:48:12,961 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:48:12,961 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:48:12,961 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:48:12,961 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:48:12,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:48:12,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:48:12,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:48:12,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:48:12,964 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:48:12,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:48:12,965 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:48:12,965 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:48:12,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:48:12,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:48:12,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:48:12,966 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:48:12,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:48:12,966 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:48:12,967 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:48:12,968 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:48:12,968 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 -> ac98b61700c421642ba0cea32b1043bdcac0ece8 [2019-01-01 23:48:13,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:48:13,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:48:13,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:48:13,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:48:13,068 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:48:13,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-01 23:48:13,127 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d966ff2/378e0e936eb14db694521ba1b2240517/FLAG3c7a761b9 [2019-01-01 23:48:13,684 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:48:13,688 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-01 23:48:13,709 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d966ff2/378e0e936eb14db694521ba1b2240517/FLAG3c7a761b9 [2019-01-01 23:48:13,963 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d966ff2/378e0e936eb14db694521ba1b2240517 [2019-01-01 23:48:13,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:48:13,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:48:13,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:48:13,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:48:13,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:48:13,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:48:13" (1/1) ... [2019-01-01 23:48:13,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4155732f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:13, skipping insertion in model container [2019-01-01 23:48:13,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:48:13" (1/1) ... [2019-01-01 23:48:13,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:48:14,051 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:48:14,486 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:48:14,517 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:48:14,679 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:48:14,727 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:48:14,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14 WrapperNode [2019-01-01 23:48:14,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:48:14,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:48:14,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:48:14,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:48:14,738 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:48:14" (1/1) ... [2019-01-01 23:48:14,756 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:48:14" (1/1) ... [2019-01-01 23:48:14,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:48:14,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:48:14,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:48:14,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:48:14,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (1/1) ... [2019-01-01 23:48:14,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:48:14,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:48:14,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:48:14,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:48:14,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (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:48:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:48:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:48:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:48:14,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:48:16,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:48:16,364 INFO L280 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-01 23:48:16,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:16 BoogieIcfgContainer [2019-01-01 23:48:16,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:48:16,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:48:16,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:48:16,370 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:48:16,371 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:16,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:48:13" (1/3) ... [2019-01-01 23:48:16,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f39e10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:48:16, skipping insertion in model container [2019-01-01 23:48:16,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:16,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:48:14" (2/3) ... [2019-01-01 23:48:16,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f39e10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:48:16, skipping insertion in model container [2019-01-01 23:48:16,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:48:16,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:16" (3/3) ... [2019-01-01 23:48:16,375 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-01 23:48:16,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:48:16,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:48:16,446 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:48:16,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:48:16,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:48:16,447 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:48:16,447 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:48:16,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:48:16,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:48:16,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-01-01 23:48:16,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:48:16,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:16,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:16,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:16,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:16,505 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:48:16,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states. [2019-01-01 23:48:16,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2019-01-01 23:48:16,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:16,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:16,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:16,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:16,520 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(25);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 10#L-1true havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 78#L936true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 96#L944true main_#t~ret70 := valid_product_#res;main_~tmp~8 := main_#t~ret70;havoc main_#t~ret70; 82#L900true assume 0 != main_~tmp~8; 41#L874true havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 98#L966-1true [2019-01-01 23:48:16,521 INFO L796 eck$LassoCheckResult]: Loop: 98#L966-1true assume !false; 79#L391true assume test_~splverifierCounter~0 < 4; 46#L392true test_~tmp~4 := test_#t~nondet31;havoc test_#t~nondet31; 65#L400true assume !(0 != test_~tmp~4); 69#L400-1true test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 99#L410true assume !(0 != test_~tmp___0~2); 84#L410-1true test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 3#L420true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 36#L428-1true assume !(0 != ~pumpRunning~0); 58#L166true assume !(0 != ~systemActive~0); 105#L173true havoc __utac_acc__Specification4_spec__1_#t~ret72, __utac_acc__Specification4_spec__1_#t~ret73, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 110#L123true __utac_acc__Specification4_spec__1_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret72;havoc __utac_acc__Specification4_spec__1_#t~ret72; 95#L966true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 98#L966-1true [2019-01-01 23:48:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:16,527 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:48:16,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:16,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:16,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:16,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:16,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:17,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1670232116, now seen corresponding path program 1 times [2019-01-01 23:48:17,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:17,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:17,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:17,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:17,597 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:48:17,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:17,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:48:17,606 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:48:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:48:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:48:17,630 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2019-01-01 23:48:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:17,792 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2019-01-01 23:48:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:48:17,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 330 transitions. [2019-01-01 23:48:17,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:48:17,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 315 transitions. [2019-01-01 23:48:17,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-01-01 23:48:17,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2019-01-01 23:48:17,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 315 transitions. [2019-01-01 23:48:17,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:17,818 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 315 transitions. [2019-01-01 23:48:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 315 transitions. [2019-01-01 23:48:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-01-01 23:48:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-01 23:48:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2019-01-01 23:48:17,870 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-01-01 23:48:17,870 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-01-01 23:48:17,870 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:48:17,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 312 transitions. [2019-01-01 23:48:17,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2019-01-01 23:48:17,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:17,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:17,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:17,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:48:17,884 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(25);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 365#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 366#L936 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 454#L944 main_#t~ret70 := valid_product_#res;main_~tmp~8 := main_#t~ret70;havoc main_#t~ret70; 457#L900 assume 0 != main_~tmp~8; 409#L874 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 410#L966-1 [2019-01-01 23:48:17,884 INFO L796 eck$LassoCheckResult]: Loop: 410#L966-1 assume !false; 455#L391 assume test_~splverifierCounter~0 < 4; 417#L392 test_~tmp~4 := test_#t~nondet31;havoc test_#t~nondet31; 418#L400 assume !(0 != test_~tmp~4); 445#L400-1 test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 449#L410 assume !(0 != test_~tmp___0~2); 448#L410-1 test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 351#L420 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 352#L428-1 assume !(0 != ~pumpRunning~0); 379#L166 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret11, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 434#L224 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret10, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 443#L198-1 assume !(0 == ~pumpRunning~0); 475#L173 havoc __utac_acc__Specification4_spec__1_#t~ret72, __utac_acc__Specification4_spec__1_#t~ret73, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 476#L123 __utac_acc__Specification4_spec__1_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret72;havoc __utac_acc__Specification4_spec__1_#t~ret72; 469#L966 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 410#L966-1 [2019-01-01 23:48:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:48:17,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:17,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1415980246, now seen corresponding path program 1 times [2019-01-01 23:48:18,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:18,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:18,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:48:18,352 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:48:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:48:18,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:48:18,353 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:48:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:48:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:48:18,355 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. cyclomatic complexity: 105 Second operand 3 states. [2019-01-01 23:48:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:48:18,630 INFO L93 Difference]: Finished difference Result 293 states and 412 transitions. [2019-01-01 23:48:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:48:18,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 412 transitions. [2019-01-01 23:48:18,636 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 207 [2019-01-01 23:48:18,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 412 transitions. [2019-01-01 23:48:18,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2019-01-01 23:48:18,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2019-01-01 23:48:18,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 412 transitions. [2019-01-01 23:48:18,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:48:18,644 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 412 transitions. [2019-01-01 23:48:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 412 transitions. [2019-01-01 23:48:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-01-01 23:48:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-01 23:48:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2019-01-01 23:48:18,669 INFO L728 BuchiCegarLoop]: Abstraction has 293 states and 412 transitions. [2019-01-01 23:48:18,669 INFO L608 BuchiCegarLoop]: Abstraction has 293 states and 412 transitions. [2019-01-01 23:48:18,669 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:48:18,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 412 transitions. [2019-01-01 23:48:18,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 207 [2019-01-01 23:48:18,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:48:18,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:48:18,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:48:18,673 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] [2019-01-01 23:48:18,674 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(25);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 874#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 875#L936 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 958#L944 main_#t~ret70 := valid_product_#res;main_~tmp~8 := main_#t~ret70;havoc main_#t~ret70; 961#L900 assume 0 != main_~tmp~8; 919#L874 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 920#L966-1 [2019-01-01 23:48:18,674 INFO L796 eck$LassoCheckResult]: Loop: 920#L966-1 assume !false; 959#L391 assume test_~splverifierCounter~0 < 4; 928#L392 test_~tmp~4 := test_#t~nondet31;havoc test_#t~nondet31; 929#L400 assume !(0 != test_~tmp~4); 949#L400-1 test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 953#L410 assume !(0 != test_~tmp___0~2); 952#L410-1 test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 860#L420 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 861#L428-1 assume !(0 != ~pumpRunning~0); 915#L166 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret11, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 943#L224 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret10, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 947#L198-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret29, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 896#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 897#L136-1 isHighWaterLevel_#t~ret29 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret29;havoc isHighWaterLevel_#t~ret29; 907#L326-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 908#L326-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 869#L332-1 processEnvironment__wrappee__highWaterSensor_#t~ret10 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret10;havoc processEnvironment__wrappee__highWaterSensor_#t~ret10; 870#L202-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 922#L173 havoc __utac_acc__Specification4_spec__1_#t~ret72, __utac_acc__Specification4_spec__1_#t~ret73, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 976#L123 __utac_acc__Specification4_spec__1_#t~ret72 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret72;havoc __utac_acc__Specification4_spec__1_#t~ret72; 971#L966 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 920#L966-1 [2019-01-01 23:48:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:48:18,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:18,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:18,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:19,018 INFO L82 PathProgramCache]: Analyzing trace with hash 890409558, now seen corresponding path program 1 times [2019-01-01 23:48:19,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:19,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:19,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:19,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:48:19,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:48:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1346480752, now seen corresponding path program 1 times [2019-01-01 23:48:19,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:48:19,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:48:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:48:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:48:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:48:20,436 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-01 23:48:20,579 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 23:48:51,456 WARN L181 SmtUtils]: Spent 30.84 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:49:06,492 WARN L181 SmtUtils]: Spent 15.04 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:49:06,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:49:06 BoogieIcfgContainer [2019-01-01 23:49:06,613 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:49:06,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:49:06,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:49:06,614 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:49:06,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:48:16" (3/4) ... [2019-01-01 23:49:06,625 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:49:06,754 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:49:06,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:49:06,756 INFO L168 Benchmark]: Toolchain (without parser) took 52788.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -245.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,757 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:06,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:49:06,759 INFO L168 Benchmark]: Boogie Preprocessor took 58.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,760 INFO L168 Benchmark]: RCFGBuilder took 1495.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,761 INFO L168 Benchmark]: BuchiAutomizer took 50247.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.6 MB). Peak memory consumption was 380.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,761 INFO L168 Benchmark]: Witness Printer took 140.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:49:06,767 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 759.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1495.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50247.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.6 MB). Peak memory consumption was 380.8 MB. Max. memory is 11.5 GB. * Witness Printer took 140.93 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 293 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 49.4s. Construction of modules took 0.3s. 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 293 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 324 SDtfs, 271 SDslu, 224 SDs, 0 SdLazy, 41 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 390]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=11204} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=-8, NULL=-21, NULL=0, NULL=11204, NULL=-1, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b2e4459=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65c8d4a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@491e579=0, NULL=-7, retValue_acc=1, NULL=-4, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@607e9e8=0, tmp___0=0, NULL=0, tmp=0, NULL=0, NULL=0, tmp___1=0, retValue_acc=0, tmp=0, NULL=-9, NULL=-3, cleanupTimeShifts=4, NULL=-5, NULL=6592, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@632ebbd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@569ea8b8=56, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=-10, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, \result=1, retValue_acc=1, NULL=-2, head=0, pumpRunning=0, NULL=-15, \result=0, NULL=-18, retValue_acc=1, NULL=0, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e5cb5fe=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f25ea2=0, NULL=-19, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3757a6e0=0, tmp=1, NULL=-20, tmp___2=56, tmp___0=0, tmp=1, NULL=-13, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bedfff0=0, tmp=0, head=0, NULL=0, NULL=0, NULL=-12, NULL=0, NULL=0, NULL=-6, NULL=-22, NULL=0, NULL=-14, NULL=11203, NULL=-17} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L618] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L815] int cleanupTimeShifts = 4; [L891] int retValue_acc ; [L892] int tmp ; [L940] int retValue_acc ; [L943] retValue_acc = 1 [L944] return (retValue_acc); [L898] tmp = valid_product() [L900] COND TRUE \read(tmp) [L381] int splverifierCounter ; [L382] int tmp ; [L383] int tmp___0 ; [L384] int tmp___1 ; [L385] int tmp___2 ; [L388] splverifierCounter = 0 Loop: [L390] COND TRUE 1 [L392] COND TRUE splverifierCounter < 4 [L398] tmp = __VERIFIER_nondet_int() [L400] COND FALSE !(\read(tmp)) [L408] tmp___0 = __VERIFIER_nondet_int() [L410] COND FALSE !(\read(tmp___0)) [L418] tmp___2 = __VERIFIER_nondet_int() [L420] COND TRUE \read(tmp___2) [L374] systemActive = 1 [L166] COND FALSE !(\read(pumpRunning)) [L173] COND TRUE \read(systemActive) [L221] int tmp ; [L224] COND FALSE !(\read(pumpRunning)) [L195] int tmp ; [L198] COND TRUE ! pumpRunning [L318] int retValue_acc ; [L319] int tmp ; [L320] int tmp___0 ; [L128] int retValue_acc ; [L131] COND TRUE waterLevel < 2 [L132] retValue_acc = 1 [L133] return (retValue_acc); [L324] tmp = isHighWaterSensorDry() [L326] COND TRUE \read(tmp) [L327] tmp___0 = 0 [L331] retValue_acc = tmp___0 [L332] return (retValue_acc); [L200] tmp = isHighWaterLevel() [L202] COND FALSE !(\read(tmp)) [L959] int tmp ; [L960] int tmp___0 ; [L119] int retValue_acc ; [L122] retValue_acc = waterLevel [L123] return (retValue_acc); [L964] tmp = getWaterLevel() [L966] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...