./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product47.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_product47.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 8feac72f23ce01778f11b22abb44ce4ccfa4081c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.1-dev-20ed64e [2021-08-27 16:25:14,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:25:14,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:25:14,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:25:14,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:25:14,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:25:14,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:25:14,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:25:14,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:25:14,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:25:14,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:25:14,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:25:14,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:25:14,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:25:14,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:25:14,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:25:14,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:25:14,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:25:14,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:25:14,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:25:14,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:25:14,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:25:14,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:25:14,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:25:14,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:25:14,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:25:14,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:25:14,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:25:14,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:25:14,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:25:14,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:25:14,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:25:14,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:25:14,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:25:14,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:25:14,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:25:14,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:25:14,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:25:14,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:25:14,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:25:14,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:25:14,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:25:14,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:25:14,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:25:14,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:25:14,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:25:14,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:25:14,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:25:14,571 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:25:14,571 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:25:14,571 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:25:14,572 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:25:14,572 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:25:14,572 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:25:14,572 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:25:14,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:25:14,572 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:25:14,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:25:14,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:25:14,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:25:14,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:25:14,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:25:14,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:25:14,576 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:25:14,576 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 8feac72f23ce01778f11b22abb44ce4ccfa4081c [2021-08-27 16:25:14,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:25:14,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:25:14,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:25:14,823 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:25:14,823 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:25:14,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product47.cil.c [2021-08-27 16:25:14,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba97557c6/69e0f63a6d1a4f83b43f2a9229428aa0/FLAGafa4c5533 [2021-08-27 16:25:15,242 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:25:15,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product47.cil.c [2021-08-27 16:25:15,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba97557c6/69e0f63a6d1a4f83b43f2a9229428aa0/FLAGafa4c5533 [2021-08-27 16:25:15,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba97557c6/69e0f63a6d1a4f83b43f2a9229428aa0 [2021-08-27 16:25:15,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:25:15,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:25:15,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:25:15,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:25:15,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:25:15,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21848039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15, skipping insertion in model container [2021-08-27 16:25:15,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:25:15,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:25:15,431 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product47.cil.c[1281,1294] [2021-08-27 16:25:15,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:25:15,573 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:25:15,585 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product47.cil.c[1281,1294] [2021-08-27 16:25:15,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:25:15,657 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:25:15,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15 WrapperNode [2021-08-27 16:25:15,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:25:15,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:25:15,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:25:15,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:25:15,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:25:15,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:25:15,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:25:15,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:25:15,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:25:15,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:25:15,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:25:15,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:25:15,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (1/1) ... [2021-08-27 16:25:15,754 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:25:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:25:15,815 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 16:25:15,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 16:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:25:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:25:16,624 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:25:16,624 INFO L299 CfgBuilder]: Removed 210 assume(true) statements. [2021-08-27 16:25:16,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:16 BoogieIcfgContainer [2021-08-27 16:25:16,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:25:16,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:25:16,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:25:16,630 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:25:16,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:16,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:25:15" (1/3) ... [2021-08-27 16:25:16,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3429442e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:25:16, skipping insertion in model container [2021-08-27 16:25:16,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:16,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:25:15" (2/3) ... [2021-08-27 16:25:16,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3429442e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:25:16, skipping insertion in model container [2021-08-27 16:25:16,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:25:16,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:16" (3/3) ... [2021-08-27 16:25:16,634 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product47.cil.c [2021-08-27 16:25:16,661 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:25:16,662 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:25:16,662 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:25:16,662 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:25:16,662 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:25:16,662 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:25:16,662 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:25:16,662 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:25:16,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 137 states, 136 states have (on average 1.5) internal successors, (204), 136 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:16,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2021-08-27 16:25:16,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:16,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:16,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:16,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:16,699 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:25:16,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 137 states, 136 states have (on average 1.5) internal successors, (204), 136 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:16,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2021-08-27 16:25:16,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:16,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:16,706 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:16,706 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:16,709 INFO L791 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(13);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string75.base, #t~string75.offset, 1);call write~init~int(77, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(101, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(104, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string77.base, #t~string77.offset, 1);call write~init~int(82, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(84, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 4 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string79.base, #t~string79.offset, 1);call write~init~int(75, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 2 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string81.base, #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 1 + #t~string81.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 44#L-1true havoc main_#res;havoc main_#t~ret32, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 129#L835true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 72#L843true main_#t~ret32 := valid_product_#res;main_~tmp~5 := main_#t~ret32;havoc main_#t~ret32; 69#L433true assume 0 != main_~tmp~5; 79#L405true ~switchedOnBeforeTS~0 := 0; 16#L855true havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 94#L876-1true [2021-08-27 16:25:16,709 INFO L793 eck$LassoCheckResult]: Loop: 94#L876-1true assume !false; 136#L290true assume test_~splverifierCounter~0 < 4; 76#L291true test_~tmp~4 := test_#t~nondet28;havoc test_#t~nondet28; 42#L299true assume !(0 != test_~tmp~4); 40#L299-1true test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 82#L309true assume !(0 != test_~tmp___0~1); 24#L309-1true test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 139#L319true assume 0 != test_~tmp___2~0; 111#L325-1true havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 61#L201true __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 104#L865true assume !(0 != ~pumpRunning~0); 102#L73true assume !(0 != ~systemActive~0); 11#L80true havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 63#L973true __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 92#L876true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 94#L876-1true [2021-08-27 16:25:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2021-08-27 16:25:16,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:16,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422263153] [2021-08-27 16:25:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:16,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:16,845 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:16,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash -239583083, now seen corresponding path program 1 times [2021-08-27 16:25:16,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:16,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106661801] [2021-08-27 16:25:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:16,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:16,957 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:16,978 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1694442127, now seen corresponding path program 1 times [2021-08-27 16:25:16,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:16,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014867034] [2021-08-27 16:25:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:16,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:17,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:17,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014867034] [2021-08-27 16:25:17,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014867034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:17,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:17,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:25:17,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721421192] [2021-08-27 16:25:17,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:17,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 16:25:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 16:25:17,203 INFO L87 Difference]: Start difference. First operand has 137 states, 136 states have (on average 1.5) internal successors, (204), 136 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:17,379 INFO L93 Difference]: Finished difference Result 325 states and 460 transitions. [2021-08-27 16:25:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:25:17,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 460 transitions. [2021-08-27 16:25:17,394 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 211 [2021-08-27 16:25:17,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 304 states and 439 transitions. [2021-08-27 16:25:17,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2021-08-27 16:25:17,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2021-08-27 16:25:17,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 439 transitions. [2021-08-27 16:25:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:17,409 INFO L681 BuchiCegarLoop]: Abstraction has 304 states and 439 transitions. [2021-08-27 16:25:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 439 transitions. [2021-08-27 16:25:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 179. [2021-08-27 16:25:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 1.4357541899441342) internal successors, (257), 178 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 257 transitions. [2021-08-27 16:25:17,445 INFO L704 BuchiCegarLoop]: Abstraction has 179 states and 257 transitions. [2021-08-27 16:25:17,445 INFO L587 BuchiCegarLoop]: Abstraction has 179 states and 257 transitions. [2021-08-27 16:25:17,445 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:25:17,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 257 transitions. [2021-08-27 16:25:17,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2021-08-27 16:25:17,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:17,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:17,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,449 INFO L791 eck$LassoCheckResult]: Stem: 610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(13);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string75.base, #t~string75.offset, 1);call write~init~int(77, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(101, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(104, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string77.base, #t~string77.offset, 1);call write~init~int(82, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(84, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 4 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string79.base, #t~string79.offset, 1);call write~init~int(75, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 2 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string81.base, #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 1 + #t~string81.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 544#L-1 havoc main_#res;havoc main_#t~ret32, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 545#L835 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 582#L843 main_#t~ret32 := valid_product_#res;main_~tmp~5 := main_#t~ret32;havoc main_#t~ret32; 577#L433 assume 0 != main_~tmp~5; 578#L405 ~switchedOnBeforeTS~0 := 0; 504#L855 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 505#L876-1 [2021-08-27 16:25:17,449 INFO L793 eck$LassoCheckResult]: Loop: 505#L876-1 assume !false; 600#L290 assume test_~splverifierCounter~0 < 4; 586#L291 test_~tmp~4 := test_#t~nondet28;havoc test_#t~nondet28; 540#L299 assume !(0 != test_~tmp~4); 536#L299-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 537#L309 assume !(0 != test_~tmp___0~1); 513#L309-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 514#L319 assume 0 != test_~tmp___2~0; 576#L325-1 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 565#L201 __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 566#L865 assume !(0 != ~pumpRunning~0); 521#L73 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 549#L131 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret7, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 551#L105-1 assume !(0 == ~pumpRunning~0); 493#L80 havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 494#L973 __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 569#L876 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 505#L876-1 [2021-08-27 16:25:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2021-08-27 16:25:17,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:17,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746293487] [2021-08-27 16:25:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:17,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:17,499 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:17,561 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1391395369, now seen corresponding path program 1 times [2021-08-27 16:25:17,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:17,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622961118] [2021-08-27 16:25:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:17,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:17,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:17,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622961118] [2021-08-27 16:25:17,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622961118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:17,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:17,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:25:17,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925534831] [2021-08-27 16:25:17,589 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:25:17,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:17,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:25:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:25:17,590 INFO L87 Difference]: Start difference. First operand 179 states and 257 transitions. cyclomatic complexity: 81 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:17,671 INFO L93 Difference]: Finished difference Result 226 states and 308 transitions. [2021-08-27 16:25:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:25:17,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 308 transitions. [2021-08-27 16:25:17,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2021-08-27 16:25:17,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 308 transitions. [2021-08-27 16:25:17,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2021-08-27 16:25:17,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2021-08-27 16:25:17,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 308 transitions. [2021-08-27 16:25:17,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:17,676 INFO L681 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2021-08-27 16:25:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 308 transitions. [2021-08-27 16:25:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-08-27 16:25:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.3628318584070795) internal successors, (308), 225 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2021-08-27 16:25:17,692 INFO L704 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2021-08-27 16:25:17,693 INFO L587 BuchiCegarLoop]: Abstraction has 226 states and 308 transitions. [2021-08-27 16:25:17,693 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:25:17,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 308 transitions. [2021-08-27 16:25:17,695 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 160 [2021-08-27 16:25:17,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:17,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:17,696 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,697 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(13);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string75.base, #t~string75.offset, 1);call write~init~int(77, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(101, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(104, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string77.base, #t~string77.offset, 1);call write~init~int(82, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(84, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 4 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string79.base, #t~string79.offset, 1);call write~init~int(75, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 2 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string81.base, #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 1 + #t~string81.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 959#L-1 havoc main_#res;havoc main_#t~ret32, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 960#L835 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 999#L843 main_#t~ret32 := valid_product_#res;main_~tmp~5 := main_#t~ret32;havoc main_#t~ret32; 994#L433 assume 0 != main_~tmp~5; 995#L405 ~switchedOnBeforeTS~0 := 0; 915#L855 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 916#L876-1 [2021-08-27 16:25:17,698 INFO L793 eck$LassoCheckResult]: Loop: 916#L876-1 assume !false; 1100#L290 assume test_~splverifierCounter~0 < 4; 1003#L291 test_~tmp~4 := test_#t~nondet28;havoc test_#t~nondet28; 955#L299 assume !(0 != test_~tmp~4); 950#L299-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 951#L309 assume !(0 != test_~tmp___0~1); 926#L309-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 927#L319 assume 0 != test_~tmp___2~0; 993#L325-1 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 982#L201 __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 983#L865 assume !(0 != ~pumpRunning~0); 1024#L73 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 964#L131 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret7, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 965#L105-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 948#L981-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 949#L986-1 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 1010#L250-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 1023#L250-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 990#L256-1 processEnvironment__wrappee__methaneQuery_#t~ret7 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~0 := processEnvironment__wrappee__methaneQuery_#t~ret7;havoc processEnvironment__wrappee__methaneQuery_#t~ret7; 991#L109-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~0); 932#L80 havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 1105#L973 __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 1103#L876 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~9); 916#L876-1 [2021-08-27 16:25:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2021-08-27 16:25:17,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:17,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504869041] [2021-08-27 16:25:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:17,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:17,727 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:17,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1936550109, now seen corresponding path program 1 times [2021-08-27 16:25:17,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:17,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715096293] [2021-08-27 16:25:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:17,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:25:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:25:17,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:25:17,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715096293] [2021-08-27 16:25:17,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715096293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:25:17,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:25:17,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:25:17,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513303463] [2021-08-27 16:25:17,808 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:25:17,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:25:17,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:25:17,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:25:17,809 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. cyclomatic complexity: 85 Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:25:17,927 INFO L93 Difference]: Finished difference Result 616 states and 823 transitions. [2021-08-27 16:25:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:25:17,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 616 states and 823 transitions. [2021-08-27 16:25:17,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 409 [2021-08-27 16:25:17,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 616 states to 616 states and 823 transitions. [2021-08-27 16:25:17,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 616 [2021-08-27 16:25:17,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 616 [2021-08-27 16:25:17,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 616 states and 823 transitions. [2021-08-27 16:25:17,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:25:17,934 INFO L681 BuchiCegarLoop]: Abstraction has 616 states and 823 transitions. [2021-08-27 16:25:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states and 823 transitions. [2021-08-27 16:25:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 445. [2021-08-27 16:25:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 445 states have (on average 1.3280898876404494) internal successors, (591), 444 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:25:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 591 transitions. [2021-08-27 16:25:17,948 INFO L704 BuchiCegarLoop]: Abstraction has 445 states and 591 transitions. [2021-08-27 16:25:17,948 INFO L587 BuchiCegarLoop]: Abstraction has 445 states and 591 transitions. [2021-08-27 16:25:17,948 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:25:17,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 445 states and 591 transitions. [2021-08-27 16:25:17,954 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 320 [2021-08-27 16:25:17,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:25:17,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:25:17,956 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,956 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:25:17,956 INFO L791 eck$LassoCheckResult]: Stem: 1899#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(13);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string75.base, #t~string75.offset, 1);call write~init~int(77, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(101, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(104, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string77.base, #t~string77.offset, 1);call write~init~int(82, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(84, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 4 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string79.base, #t~string79.offset, 1);call write~init~int(75, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 2 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string81.base, #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 1 + #t~string81.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1819#L-1 havoc main_#res;havoc main_#t~ret32, main_~retValue_acc~3, main_~tmp~5;havoc main_~retValue_acc~3;havoc main_~tmp~5; 1820#L835 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1858#L843 main_#t~ret32 := valid_product_#res;main_~tmp~5 := main_#t~ret32;havoc main_#t~ret32; 1853#L433 assume 0 != main_~tmp~5; 1854#L405 ~switchedOnBeforeTS~0 := 0; 1773#L855 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1774#L876-1 [2021-08-27 16:25:17,957 INFO L793 eck$LassoCheckResult]: Loop: 1774#L876-1 assume !false; 2158#L290 assume test_~splverifierCounter~0 < 4; 2156#L291 test_~tmp~4 := test_#t~nondet28;havoc test_#t~nondet28; 2155#L299 assume !(0 != test_~tmp~4); 1810#L299-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 1811#L309 assume !(0 != test_~tmp___0~1); 1784#L309-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 1785#L319 assume 0 != test_~tmp___2~0; 1852#L325-1 havoc __utac_acc__Specification5_spec__2_#t~ret69;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1840#L201 __utac_acc__Specification5_spec__2_#t~ret69 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret69;havoc __utac_acc__Specification5_spec__2_#t~ret69; 1841#L865 assume !(0 != ~pumpRunning~0); 1889#L73 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1824#L131 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret7, processEnvironment__wrappee__methaneQuery_~tmp~0;havoc processEnvironment__wrappee__methaneQuery_~tmp~0; 1825#L105-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 1808#L981-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 1809#L986-1 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 1869#L250-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 1888#L250-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1849#L256-1 processEnvironment__wrappee__methaneQuery_#t~ret7 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~0 := processEnvironment__wrappee__methaneQuery_#t~ret7;havoc processEnvironment__wrappee__methaneQuery_#t~ret7; 1850#L109-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~0); 1762#L80 havoc __utac_acc__Specification5_spec__3_#t~ret70, __utac_acc__Specification5_spec__3_#t~ret71, __utac_acc__Specification5_spec__3_~tmp~9, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~9;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 1763#L973 __utac_acc__Specification5_spec__3_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~9 := __utac_acc__Specification5_spec__3_#t~ret70;havoc __utac_acc__Specification5_spec__3_#t~ret70; 1874#L876 assume 2 != __utac_acc__Specification5_spec__3_~tmp~9;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1875#L201-1 __utac_acc__Specification5_spec__3_#t~ret71 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret71;havoc __utac_acc__Specification5_spec__3_#t~ret71; 1812#L880 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1774#L876-1 [2021-08-27 16:25:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2021-08-27 16:25:17,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:17,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744356648] [2021-08-27 16:25:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:17,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:17,989 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:18,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1303826978, now seen corresponding path program 1 times [2021-08-27 16:25:18,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:18,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289028903] [2021-08-27 16:25:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:18,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:18,036 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:18,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:25:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:25:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1367253160, now seen corresponding path program 1 times [2021-08-27 16:25:18,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:25:18,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717790772] [2021-08-27 16:25:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:25:18,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:25:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:18,071 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:25:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:25:18,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:26:06,095 WARN L207 SmtUtils]: Spent 47.75 s on a formula simplification. DAG size of input: 495 DAG size of output: 437 [2021-08-27 16:26:49,358 WARN L207 SmtUtils]: Spent 20.81 s on a formula simplification that was a NOOP. DAG size: 435 [2021-08-27 16:26:49,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:26:49 BoogieIcfgContainer [2021-08-27 16:26:49,506 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:26:49,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:26:49,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:26:49,507 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:26:49,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:25:16" (3/4) ... [2021-08-27 16:26:49,512 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:26:49,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:26:49,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:26:49,576 INFO L168 Benchmark]: Toolchain (without parser) took 94311.79 ms. Allocated memory was 58.7 MB in the beginning and 111.1 MB in the end (delta: 52.4 MB). Free memory was 35.8 MB in the beginning and 40.9 MB in the end (delta: -5.1 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,576 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 39.6 MB in the beginning and 39.6 MB in the end (delta: 27.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:26:49,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.76 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 34.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.22 ms. Allocated memory is still 58.7 MB. Free memory was 34.2 MB in the beginning and 30.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,580 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 58.7 MB. Free memory was 30.2 MB in the beginning and 27.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,580 INFO L168 Benchmark]: RCFGBuilder took 882.77 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 27.4 MB in the beginning and 53.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,580 INFO L168 Benchmark]: BuchiAutomizer took 92877.82 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 53.6 MB in the beginning and 44.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 74.0 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,580 INFO L168 Benchmark]: Witness Printer took 68.66 ms. Allocated memory is still 111.1 MB. Free memory was 44.1 MB in the beginning and 40.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 16:26:49,582 INFO L339 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 58.7 MB. Free memory was 39.6 MB in the beginning and 39.6 MB in the end (delta: 27.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 392.76 ms. Allocated memory is still 58.7 MB. Free memory was 35.6 MB in the beginning and 34.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.22 ms. Allocated memory is still 58.7 MB. Free memory was 34.2 MB in the beginning and 30.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 58.7 MB. Free memory was 30.2 MB in the beginning and 27.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 882.77 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 27.4 MB in the beginning and 53.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 92877.82 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 53.6 MB in the beginning and 44.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 74.0 MB. Max. memory is 16.1 GB. * Witness Printer took 68.66 ms. Allocated memory is still 111.1 MB. Free memory was 44.1 MB in the beginning and 40.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 445 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 92.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 92.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 56.2ms AutomataMinimizationTime, 3 MinimizatonAttempts, 296 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 445 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 642 SDtfs, 1510 SDslu, 1533 SDs, 0 SdLazy, 162 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 208.1ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 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: 289]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, NULL=0, NULL=16382, NULL=0, retValue_acc=1, NULL=1, NULL=0, NULL=16385, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34378eaa=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3fe803be=0, NULL=16384, methaneLevelCritical=0, tmp=0, retValue_acc=0, tmp___1=0, NULL=0, NULL=16391, cleanupTimeShifts=4, NULL=11169, waterLevel=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3307b66e=0, NULL=16406, \result=1, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6021f6f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16df3b7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50082829=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54b12dd0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d2713fa=0, tmp=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10ea4001=49, NULL=16402, NULL=0, tmp=1, NULL=0, NULL=16396, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32f30188=0, NULL=0, tmp___0=0, NULL=16401, NULL=16394, tmp=0, head=0, NULL=0, tmp=0, NULL=16388, NULL=16403, NULL=0, retValue_acc=0, NULL=0, NULL=16395, NULL=16393, tmp=1, tmp___0=0, NULL=0, NULL=0, switchedOnBeforeTS=0, \result=0, NULL=16398, NULL=0, systemActive=1, \result=1, NULL=0, NULL=16390, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=16407, NULL=16389, tmp___0=0, \result=0, NULL=16392, NULL=0, NULL=0, NULL=0, NULL=16399, retValue_acc=1, NULL=11170, NULL=16405, tmp___2=49, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=16404, NULL=16386, retValue_acc=0, NULL=0, NULL=0, NULL=16400, NULL=0, NULL=16387, NULL=16383, NULL=16397} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L61] int pumpRunning = 0; [L62] int systemActive = 1; [L346] int cleanupTimeShifts = 4; [L616] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L849] int switchedOnBeforeTS ; [L898] int waterLevel = 1; [L899] int methaneLevelCritical = 0; [L424] int retValue_acc ; [L425] int tmp ; [L839] int retValue_acc ; [L842] retValue_acc = 1 [L843] return (retValue_acc); [L431] tmp = valid_product() [L433] COND TRUE \read(tmp) [L854] switchedOnBeforeTS = 0 [L280] int splverifierCounter ; [L281] int tmp ; [L282] int tmp___0 ; [L283] int tmp___1 ; [L284] int tmp___2 ; [L287] splverifierCounter = 0 Loop: [L289] COND TRUE 1 [L291] COND TRUE splverifierCounter < 4 [L297] tmp = __VERIFIER_nondet_int() [L299] COND FALSE !(\read(tmp)) [L307] tmp___0 = __VERIFIER_nondet_int() [L309] COND FALSE !(\read(tmp___0)) [L317] tmp___2 = __VERIFIER_nondet_int() [L319] COND TRUE \read(tmp___2) [L197] int retValue_acc ; [L200] retValue_acc = pumpRunning [L201] return (retValue_acc); [L863] switchedOnBeforeTS = isPumpRunning() [L73] COND FALSE !(\read(pumpRunning)) [L80] COND TRUE \read(systemActive) [L128] int tmp ; [L131] COND FALSE !(\read(pumpRunning)) [L102] int tmp ; [L105] COND TRUE ! pumpRunning [L242] int retValue_acc ; [L243] int tmp ; [L244] int tmp___0 ; [L978] int retValue_acc ; [L981] COND TRUE waterLevel < 2 [L982] retValue_acc = 1 [L983] return (retValue_acc); [L248] tmp = isHighWaterSensorDry() [L250] COND TRUE \read(tmp) [L251] tmp___0 = 0 [L255] retValue_acc = tmp___0 [L256] return (retValue_acc); [L107] tmp = isHighWaterLevel() [L109] COND FALSE !(\read(tmp)) [L869] int tmp ; [L870] int tmp___0 ; [L969] int retValue_acc ; [L972] retValue_acc = waterLevel [L973] return (retValue_acc); [L874] tmp = getWaterLevel() [L876] COND TRUE tmp != 2 [L197] int retValue_acc ; [L200] retValue_acc = pumpRunning [L201] return (retValue_acc); [L878] tmp___0 = isPumpRunning() [L880] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:26:49,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...