./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product14.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_product14.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 41585ee22e5b9d0bbbd49fc44fb82de5616beee1 ................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:12:27,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:12:27,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:12:27,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:12:27,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:12:27,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:12:27,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:12:27,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:12:27,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:12:27,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:12:27,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:12:27,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:12:27,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:12:27,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:12:27,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:12:27,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:12:27,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:12:27,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:12:27,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:12:27,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:12:27,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:12:27,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:12:27,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:12:27,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:12:27,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:12:27,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:12:27,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:12:27,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:12:27,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:12:27,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:12:27,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:12:27,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:12:27,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:12:27,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:12:27,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:12:27,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:12:27,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:12:27,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:12:27,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:12:27,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:12:27,392 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:27,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:12:27,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:12:27,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:12:27,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:12:27,411 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:12:27,411 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:12:27,411 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:12:27,412 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:12:27,412 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:12:27,412 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:12:27,412 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:12:27,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:12:27,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:12:27,413 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:12:27,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:12:27,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:12:27,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:12:27,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:12:27,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:12:27,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:12:27,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:12:27,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:12:27,415 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:12:27,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:12:27,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:12:27,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:12:27,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:12:27,416 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:12:27,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:12:27,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:12:27,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:12:27,417 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:12:27,418 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:12:27,418 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 -> 41585ee22e5b9d0bbbd49fc44fb82de5616beee1 [2019-11-28 21:12:27,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:12:27,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:12:27,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:12:27,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:12:27,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:12:27,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product14.cil.c [2019-11-28 21:12:27,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b775d33/99606fcdeb6f4a84a7aaffa51a6d159d/FLAG9761c4559 [2019-11-28 21:12:28,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:12:28,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product14.cil.c [2019-11-28 21:12:28,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b775d33/99606fcdeb6f4a84a7aaffa51a6d159d/FLAG9761c4559 [2019-11-28 21:12:28,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b775d33/99606fcdeb6f4a84a7aaffa51a6d159d [2019-11-28 21:12:28,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:12:28,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:12:28,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:12:28,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:12:28,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:12:28,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:12:28" (1/1) ... [2019-11-28 21:12:28,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107d63bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:28, skipping insertion in model container [2019-11-28 21:12:28,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:12:28" (1/1) ... [2019-11-28 21:12:28,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:12:28,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:12:29,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:12:29,197 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:12:29,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:12:29,350 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:12:29,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:29 WrapperNode [2019-11-28 21:12:29,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:12:29,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:12:29,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:12:29,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:12:29,361 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:29" (1/1) ... [2019-11-28 21:12:29,380 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:29" (1/1) ... [2019-11-28 21:12:29,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:12:29,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:12:29,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:12:29,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:12:29,427 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:29" (1/1) ... [2019-11-28 21:12:29,427 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:29" (1/1) ... [2019-11-28 21:12:29,432 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:29" (1/1) ... [2019-11-28 21:12:29,432 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:29" (1/1) ... [2019-11-28 21:12:29,450 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:29" (1/1) ... [2019-11-28 21:12:29,457 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:29" (1/1) ... [2019-11-28 21:12:29,460 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:29" (1/1) ... [2019-11-28 21:12:29,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:12:29,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:12:29,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:12:29,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:12:29,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:29" (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:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:12:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 21:12:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:12:29,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:12:30,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:12:30,302 INFO L287 CfgBuilder]: Removed 112 assume(true) statements. [2019-11-28 21:12:30,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:12:30 BoogieIcfgContainer [2019-11-28 21:12:30,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:12:30,304 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:12:30,304 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:12:30,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:12:30,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:30,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:12:28" (1/3) ... [2019-11-28 21:12:30,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d02d094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:12:30, skipping insertion in model container [2019-11-28 21:12:30,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:30,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:12:29" (2/3) ... [2019-11-28 21:12:30,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d02d094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:12:30, skipping insertion in model container [2019-11-28 21:12:30,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:12:30,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:12:30" (3/3) ... [2019-11-28 21:12:30,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product14.cil.c [2019-11-28 21:12:30,358 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:12:30,359 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:12:30,359 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:12:30,359 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:12:30,359 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:12:30,360 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:12:30,360 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:12:30,360 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:12:30,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-11-28 21:12:30,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-11-28 21:12:30,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:30,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:30,410 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:30,410 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:30,411 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:12:30,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-11-28 21:12:30,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-11-28 21:12:30,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:30,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:30,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:30,420 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:30,433 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #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(75, #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(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~ret3, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 3#L899true havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 24#L907true main_#t~ret3 := valid_product_#res;main_~tmp~1 := main_#t~ret3;havoc main_#t~ret3; 36#L183true assume 0 != main_~tmp~1; 51#L155true ~switchedOnBeforeTS~0 := 0; 53#L49true havoc test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 16#L70-1true [2019-11-28 21:12:30,435 INFO L796 eck$LassoCheckResult]: Loop: 16#L70-1true assume !false; 68#L821true assume test_~splverifierCounter~0 < 4; 5#L822true test_~tmp~7 := test_#t~nondet68;havoc test_#t~nondet68; 9#L830true assume !(0 != test_~tmp~7); 10#L830-1true test_~tmp___0~1 := test_#t~nondet69;havoc test_#t~nondet69; 72#L840true assume !(0 != test_~tmp___0~1); 75#L840-1true test_~tmp___2~0 := test_#t~nondet70;havoc test_#t~nondet70; 63#L850true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 66#L858-2true havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 27#L681true __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 19#L59true assume !(0 != ~pumpRunning~0); 49#L579true assume !(0 != ~systemActive~0); 59#L586true havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 42#L805true __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 20#L70true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 16#L70-1true [2019-11-28 21:12:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:30,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-11-28 21:12:30,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:30,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327766500] [2019-11-28 21:12:30,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:30,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1011068557, now seen corresponding path program 1 times [2019-11-28 21:12:30,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46400919] [2019-11-28 21:12:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:12:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:12:30,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46400919] [2019-11-28 21:12:30,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:12:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:12:30,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245559088] [2019-11-28 21:12:30,967 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:12:30,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:12:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:12:30,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:12:30,989 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-11-28 21:12:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:12:31,037 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2019-11-28 21:12:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:12:31,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 101 transitions. [2019-11-28 21:12:31,044 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-11-28 21:12:31,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 93 transitions. [2019-11-28 21:12:31,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 21:12:31,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 21:12:31,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 93 transitions. [2019-11-28 21:12:31,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:12:31,054 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-11-28 21:12:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 93 transitions. [2019-11-28 21:12:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 21:12:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 21:12:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2019-11-28 21:12:31,085 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-11-28 21:12:31,085 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-11-28 21:12:31,085 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:12:31,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 93 transitions. [2019-11-28 21:12:31,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-11-28 21:12:31,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:31,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:31,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:31,088 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:31,089 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #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(75, #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(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 169#L-1 havoc main_#res;havoc main_#t~ret3, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 159#L899 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 160#L907 main_#t~ret3 := valid_product_#res;main_~tmp~1 := main_#t~ret3;havoc main_#t~ret3; 200#L183 assume 0 != main_~tmp~1; 209#L155 ~switchedOnBeforeTS~0 := 0; 219#L49 havoc test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 180#L70-1 [2019-11-28 21:12:31,089 INFO L796 eck$LassoCheckResult]: Loop: 180#L70-1 assume !false; 181#L821 assume test_~splverifierCounter~0 < 4; 163#L822 test_~tmp~7 := test_#t~nondet68;havoc test_#t~nondet68; 164#L830 assume !(0 != test_~tmp~7); 171#L830-1 test_~tmp___0~1 := test_#t~nondet69;havoc test_#t~nondet69; 172#L840 assume !(0 != test_~tmp___0~1); 162#L840-1 test_~tmp___2~0 := test_#t~nondet70;havoc test_#t~nondet70; 222#L850 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 224#L858-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 204#L681 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 187#L59 assume !(0 != ~pumpRunning~0); 188#L579 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 184#L611 assume !(0 != ~pumpRunning~0); 185#L586 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 211#L805 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 190#L70 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0); 180#L70-1 [2019-11-28 21:12:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-11-28 21:12:31,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583286456] [2019-11-28 21:12:31,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1257825731, now seen corresponding path program 1 times [2019-11-28 21:12:31,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581101687] [2019-11-28 21:12:31,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1083065097, now seen corresponding path program 1 times [2019-11-28 21:12:31,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910993440] [2019-11-28 21:12:31,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:12:31,388 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:31,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910993440] [2019-11-28 21:12:31,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:12:31,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:12:31,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702900881] [2019-11-28 21:12:31,505 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-28 21:12:31,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:12:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:12:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:12:31,593 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-11-28 21:12:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:12:31,763 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2019-11-28 21:12:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 21:12:31,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 255 transitions. [2019-11-28 21:12:31,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-11-28 21:12:31,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 255 transitions. [2019-11-28 21:12:31,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2019-11-28 21:12:31,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2019-11-28 21:12:31,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 255 transitions. [2019-11-28 21:12:31,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:12:31,775 INFO L688 BuchiCegarLoop]: Abstraction has 188 states and 255 transitions. [2019-11-28 21:12:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 255 transitions. [2019-11-28 21:12:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 129. [2019-11-28 21:12:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 21:12:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2019-11-28 21:12:31,788 INFO L711 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-11-28 21:12:31,788 INFO L591 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-11-28 21:12:31,788 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:12:31,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 172 transitions. [2019-11-28 21:12:31,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-11-28 21:12:31,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:12:31,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:12:31,792 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:12:31,792 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:31,792 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string45.base, #t~string45.offset, 1);call write~init~int(110, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 2 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string47.base, #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(102, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string49.base, #t~string49.offset, 1);call write~init~int(80, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(117, #t~string49.base, 2 + #t~string49.offset, 1);call write~init~int(109, #t~string49.base, 3 + #t~string49.offset, 1);call write~init~int(112, #t~string49.base, 4 + #t~string49.offset, 1);call write~init~int(58, #t~string49.base, 5 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 6 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string51.base, #t~string51.offset, 1);call write~init~int(110, #t~string51.base, 1 + #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 2 + #t~string51.offset, 1);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string53.base, #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 1 + #t~string53.offset, 1);call write~init~int(102, #t~string53.base, 2 + #t~string53.offset, 1);call write~init~int(0, #t~string53.base, 3 + #t~string53.offset, 1);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string55.base, #t~string55.offset, 1);call write~init~int(32, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 2 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string57.base, #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 1 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string61.base, #t~string61.offset, 1);call write~init~int(77, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(101, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(116, #t~string61.base, 3 + #t~string61.offset, 1);call write~init~int(104, #t~string61.base, 4 + #t~string61.offset, 1);call write~init~int(58, #t~string61.base, 5 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 6 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string63.base, #t~string63.offset, 1);call write~init~int(82, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(73, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(84, #t~string63.base, 3 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 4 + #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(75, #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(2);call write~init~int(41, #t~string67.base, #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 1 + #t~string67.offset, 1);~switchedOnBeforeTS~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 441#L-1 havoc main_#res;havoc main_#t~ret3, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 431#L899 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 432#L907 main_#t~ret3 := valid_product_#res;main_~tmp~1 := main_#t~ret3;havoc main_#t~ret3; 476#L183 assume 0 != main_~tmp~1; 484#L155 ~switchedOnBeforeTS~0 := 0; 499#L49 havoc test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~7;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 452#L70-1 [2019-11-28 21:12:31,792 INFO L796 eck$LassoCheckResult]: Loop: 452#L70-1 assume !false; 453#L821 assume test_~splverifierCounter~0 < 4; 435#L822 test_~tmp~7 := test_#t~nondet68;havoc test_#t~nondet68; 436#L830 assume !(0 != test_~tmp~7); 443#L830-1 test_~tmp___0~1 := test_#t~nondet69;havoc test_#t~nondet69; 444#L840 assume !(0 != test_~tmp___0~1); 542#L840-1 test_~tmp___2~0 := test_#t~nondet70;havoc test_#t~nondet70; 541#L850 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 539#L858-2 havoc __utac_acc__Specification5_spec__2_#t~ret0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 538#L681 __utac_acc__Specification5_spec__2_#t~ret0 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret0;havoc __utac_acc__Specification5_spec__2_#t~ret0; 537#L59 assume !(0 != ~pumpRunning~0); 536#L579 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret39, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 533#L611 assume !(0 != ~pumpRunning~0); 530#L586 havoc __utac_acc__Specification5_spec__3_#t~ret1, __utac_acc__Specification5_spec__3_#t~ret2, __utac_acc__Specification5_spec__3_~tmp~0, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~0;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 529#L805 __utac_acc__Specification5_spec__3_#t~ret1 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~0 := __utac_acc__Specification5_spec__3_#t~ret1;havoc __utac_acc__Specification5_spec__3_#t~ret1; 462#L70 assume 2 != __utac_acc__Specification5_spec__3_~tmp~0;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 463#L681-1 __utac_acc__Specification5_spec__3_#t~ret2 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret2;havoc __utac_acc__Specification5_spec__3_#t~ret2; 479#L74 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 452#L70-1 [2019-11-28 21:12:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-11-28 21:12:31,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528853204] [2019-11-28 21:12:31,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1884702974, now seen corresponding path program 1 times [2019-11-28 21:12:31,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396153681] [2019-11-28 21:12:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:31,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:12:31,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1443458244, now seen corresponding path program 1 times [2019-11-28 21:12:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:12:31,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506987744] [2019-11-28 21:12:31,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:12:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:12:32,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:12:32,162 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-28 21:12:57,950 WARN L192 SmtUtils]: Spent 25.73 s on a formula simplification. DAG size of input: 456 DAG size of output: 404 [2019-11-28 21:13:10,365 WARN L192 SmtUtils]: Spent 12.41 s on a formula simplification that was a NOOP. DAG size: 402 [2019-11-28 21:13:10,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:13:10 BoogieIcfgContainer [2019-11-28 21:13:10,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:13:10,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:13:10,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:13:10,445 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:13:10,445 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:30" (3/4) ... [2019-11-28 21:13:10,449 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:13:10,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:13:10,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:13:10,522 INFO L168 Benchmark]: Toolchain (without parser) took 41810.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -227.7 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:10,523 INFO L168 Benchmark]: CDTParser took 0.26 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:10,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:10,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.40 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:10,531 INFO L168 Benchmark]: Boogie Preprocessor took 45.79 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-11-28 21:13:10,532 INFO L168 Benchmark]: RCFGBuilder took 838.66 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:10,533 INFO L168 Benchmark]: BuchiAutomizer took 40139.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.5 MB). Peak memory consumption was 366.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:13:10,533 INFO L168 Benchmark]: Witness Printer took 75.72 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:10,536 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.26 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 638.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.40 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 838.66 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40139.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.5 MB). Peak memory consumption was 366.4 MB. Max. memory is 11.5 GB. * Witness Printer took 75.72 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 129 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 39.6s. 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, 59 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 241 SDtfs, 372 SDslu, 272 SDs, 0 SdLazy, 70 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: 820]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4545} State at position 1 is {NULL=0, NULL=0, NULL=4553, NULL=0, retValue_acc=0, NULL=4545, NULL=0, NULL=0, NULL=4552, NULL=0, methaneLevelCritical=0, NULL=0, NULL=4565, tmp=0, NULL=0, tmp___1=0, tmp=1, NULL=4551, NULL=4569, cleanupTimeShifts=4, NULL=4554, switchedOnBeforeTS=0, NULL=4557, NULL=4546, NULL=4558, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28bec13a=0, \result=0, NULL=4555, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=4549, NULL=0, NULL=0, NULL=0, tmp___0=0, \result=1, head=0, pumpRunning=0, NULL=4561, NULL=4560, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21c766b7=0, NULL=0, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28726900=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77aa0e3b=0, NULL=0, NULL=0, NULL=4566, NULL=4548, retValue_acc=1, NULL=4568, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79904d9d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cfcee9c=60, NULL=4556, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@447b2fd4=0, tmp___2=60, tmp___0=0, NULL=4559, splverifierCounter=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d0b059f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46b640c5=0, NULL=4567, head=0, NULL=0, tmp=0, NULL=4547, NULL=0, NULL=4564, NULL=4563, NULL=0, NULL=0, NULL=4550, NULL=4570, NULL=4562, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L43] int switchedOnBeforeTS ; [L92] int cleanupTimeShifts = 4; [L366] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L569] int pumpRunning = 0; [L570] int systemActive = 1; [L730] int waterLevel = 1; [L731] int methaneLevelCritical = 0; [L174] int retValue_acc ; [L175] int tmp ; [L903] int retValue_acc ; [L906] retValue_acc = 1 [L907] return (retValue_acc); [L181] tmp = valid_product() [L183] COND TRUE \read(tmp) [L48] switchedOnBeforeTS = 0 [L811] int splverifierCounter ; [L812] int tmp ; [L813] int tmp___0 ; [L814] int tmp___1 ; [L815] int tmp___2 ; [L818] splverifierCounter = 0 Loop: [L820] COND TRUE 1 [L822] COND TRUE splverifierCounter < 4 [L828] tmp = __VERIFIER_nondet_int() [L830] COND FALSE !(\read(tmp)) [L838] tmp___0 = __VERIFIER_nondet_int() [L840] COND FALSE !(\read(tmp___0)) [L848] tmp___2 = __VERIFIER_nondet_int() [L850] COND TRUE \read(tmp___2) [L725] systemActive = 1 [L677] int retValue_acc ; [L680] retValue_acc = pumpRunning [L681] return (retValue_acc); [L57] switchedOnBeforeTS = isPumpRunning() [L579] COND FALSE !(\read(pumpRunning)) [L586] COND TRUE \read(systemActive) [L608] int tmp ; [L611] COND FALSE !(\read(pumpRunning)) [L63] int tmp ; [L64] int tmp___0 ; [L801] int retValue_acc ; [L804] retValue_acc = waterLevel [L805] return (retValue_acc); [L68] tmp = getWaterLevel() [L70] COND TRUE tmp != 2 [L677] int retValue_acc ; [L680] retValue_acc = pumpRunning [L681] return (retValue_acc); [L72] tmp___0 = isPumpRunning() [L74] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...