./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product57.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 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_spec3_product57.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 3ad9c9f0403f0ff15bc0d5f7c809182c1025bcda .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-wip.dd.multireach-323-8d31f38 [2021-07-06 20:26:09,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:26:09,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:26:09,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:26:09,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:26:09,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:26:09,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:26:09,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:26:09,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:26:09,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:26:09,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:26:09,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:26:09,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:26:09,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:26:09,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:26:09,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:26:09,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:26:09,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:26:09,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:26:09,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:26:09,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:26:09,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:26:09,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:26:09,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:26:09,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:26:09,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:26:09,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:26:09,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:26:09,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:26:09,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:26:09,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:26:09,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:26:09,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:26:09,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:26:09,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:26:09,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:26:09,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:26:09,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:26:09,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:26:09,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:26:09,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:26:09,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 20:26:09,669 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:26:09,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:26:09,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:26:09,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:26:09,671 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:26:09,671 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:26:09,671 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:26:09,672 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:26:09,672 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:26:09,672 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:26:09,672 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:26:09,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:26:09,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:26:09,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:26:09,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:26:09,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:26:09,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:26:09,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:26:09,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:26:09,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:26:09,676 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:26:09,676 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 -> 3ad9c9f0403f0ff15bc0d5f7c809182c1025bcda [2021-07-06 20:26:09,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:26:09,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:26:09,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:26:09,940 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:26:09,940 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:26:09,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product57.cil.c [2021-07-06 20:26:09,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbb0c97/30a3583ea58444eca7bbf8b676aefda7/FLAG206c888ad [2021-07-06 20:26:10,371 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:26:10,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product57.cil.c [2021-07-06 20:26:10,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbb0c97/30a3583ea58444eca7bbf8b676aefda7/FLAG206c888ad [2021-07-06 20:26:10,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbb0c97/30a3583ea58444eca7bbf8b676aefda7 [2021-07-06 20:26:10,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:26:10,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:26:10,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:26:10,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:26:10,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:26:10,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:26:10" (1/1) ... [2021-07-06 20:26:10,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c8c4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:10, skipping insertion in model container [2021-07-06 20:26:10,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:26:10" (1/1) ... [2021-07-06 20:26:10,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:26:10,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:26:11,035 WARN L224 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_spec3_product57.cil.c[13665,13678] [2021-07-06 20:26:11,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:26:11,080 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:26:11,132 WARN L224 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_spec3_product57.cil.c[13665,13678] [2021-07-06 20:26:11,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:26:11,172 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:26:11,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11 WrapperNode [2021-07-06 20:26:11,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:26:11,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:26:11,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:26:11,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:26:11,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:26:11,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:26:11,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:26:11,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:26:11,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:26:11,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:26:11,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:26:11,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:26:11,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (1/1) ... [2021-07-06 20:26:11,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:26:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:26:11,357 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-07-06 20:26:11,378 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-07-06 20:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:26:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:26:11,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:26:11,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:26:11,993 INFO L299 CfgBuilder]: Removed 198 assume(true) statements. [2021-07-06 20:26:11,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:26:11 BoogieIcfgContainer [2021-07-06 20:26:11,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:26:11,995 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:26:11,995 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:26:11,997 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:26:11,997 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:26:11,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:26:10" (1/3) ... [2021-07-06 20:26:11,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8d2e1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:26:11, skipping insertion in model container [2021-07-06 20:26:11,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:26:11,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:26:11" (2/3) ... [2021-07-06 20:26:11,998 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8d2e1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:26:11, skipping insertion in model container [2021-07-06 20:26:11,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:26:11,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:26:11" (3/3) ... [2021-07-06 20:26:11,999 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product57.cil.c [2021-07-06 20:26:12,023 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:26:12,024 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:26:12,024 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:26:12,024 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:26:12,024 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:26:12,024 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:26:12,024 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:26:12,024 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:26:12,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.510948905109489) internal successors, (207), 137 states have internal predecessors, (207), 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-07-06 20:26:12,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2021-07-06 20:26:12,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:26:12,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:26:12,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,056 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,056 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:26:12,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.510948905109489) internal successors, (207), 137 states have internal predecessors, (207), 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-07-06 20:26:12,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 89 [2021-07-06 20:26:12,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:26:12,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:26:12,061 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,061 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,064 INFO L791 eck$LassoCheckResult]: Stem: 108#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~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(77, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(101, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(116, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(104, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string47.base, #t~string47.offset, 1);call write~init~int(82, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(73, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(84, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 4 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(75, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 1 + #t~string51.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(80, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(117, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(109, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string75.base, #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 1 + #t~string75.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 10#L-1true havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 9#L544true 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; 15#L552true main_#t~ret82 := valid_product_#res;main_~tmp~10 := main_#t~ret82;havoc main_#t~ret82; 96#L969true assume 0 != main_~tmp~10; 136#L946true havoc test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_#t~nondet81, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 17#L574-1true [2021-07-06 20:26:12,065 INFO L793 eck$LassoCheckResult]: Loop: 17#L574-1true assume !false; 8#L833true assume test_~splverifierCounter~0 < 4; 103#L834true test_~tmp~9 := test_#t~nondet78;havoc test_#t~nondet78; 114#L842true assume !(0 != test_~tmp~9); 107#L842-1true test_~tmp___0~3 := test_#t~nondet79;havoc test_#t~nondet79; 11#L852true assume !(0 != test_~tmp___0~3); 14#L852-1true test_~tmp___2~0 := test_#t~nondet80;havoc test_#t~nondet80; 90#L862true assume 0 != test_~tmp___2~0; 50#L868-2true assume !(0 != ~pumpRunning~0); 139#L613true assume !(0 != ~systemActive~0); 82#L620true havoc __utac_acc__Specification3_spec__1_#t~ret53, __utac_acc__Specification3_spec__1_#t~ret54, __utac_acc__Specification3_spec__1_#t~ret55, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 115#L459-2true __utac_acc__Specification3_spec__1_#t~ret53 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret53;havoc __utac_acc__Specification3_spec__1_#t~ret53; 47#L568true assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 17#L574-1true [2021-07-06 20:26:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:26:12,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773055933] [2021-07-06 20:26:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,189 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,273 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,312 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:12,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1679097931, now seen corresponding path program 1 times [2021-07-06 20:26:12,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749383639] [2021-07-06 20:26:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,334 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,338 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash 35181007, now seen corresponding path program 1 times [2021-07-06 20:26:12,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817069493] [2021-07-06 20:26:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:26:12,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:12,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:12,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:12,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:26:12,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:26:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:26:12,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:26:12,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817069493] [2021-07-06 20:26:12,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817069493] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:26:12,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:26:12,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:26:12,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084597253] [2021-07-06 20:26:12,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:26:12,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:26:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:26:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:26:12,600 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 1.510948905109489) internal successors, (207), 137 states have internal predecessors, (207), 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.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-07-06 20:26:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:26:12,729 INFO L93 Difference]: Finished difference Result 138 states and 196 transitions. [2021-07-06 20:26:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 20:26:12,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 196 transitions. [2021-07-06 20:26:12,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-07-06 20:26:12,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 131 states and 189 transitions. [2021-07-06 20:26:12,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-07-06 20:26:12,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-07-06 20:26:12,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 189 transitions. [2021-07-06 20:26:12,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:26:12,738 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 189 transitions. [2021-07-06 20:26:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 189 transitions. [2021-07-06 20:26:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-07-06 20:26:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 130 states have internal predecessors, (189), 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-07-06 20:26:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2021-07-06 20:26:12,775 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 189 transitions. [2021-07-06 20:26:12,776 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 189 transitions. [2021-07-06 20:26:12,776 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:26:12,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 189 transitions. [2021-07-06 20:26:12,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-07-06 20:26:12,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:26:12,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:26:12,778 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,778 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,778 INFO L791 eck$LassoCheckResult]: Stem: 410#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~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(77, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(101, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(116, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(104, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string47.base, #t~string47.offset, 1);call write~init~int(82, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(73, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(84, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 4 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(75, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 1 + #t~string51.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(80, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(117, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(109, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string75.base, #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 1 + #t~string75.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 309#L-1 havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 307#L544 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; 308#L552 main_#t~ret82 := valid_product_#res;main_~tmp~10 := main_#t~ret82;havoc main_#t~ret82; 320#L969 assume 0 != main_~tmp~10; 406#L946 havoc test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_#t~nondet81, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 315#L574-1 [2021-07-06 20:26:12,779 INFO L793 eck$LassoCheckResult]: Loop: 315#L574-1 assume !false; 304#L833 assume test_~splverifierCounter~0 < 4; 305#L834 test_~tmp~9 := test_#t~nondet78;havoc test_#t~nondet78; 408#L842 assume !(0 != test_~tmp~9); 409#L842-1 test_~tmp___0~3 := test_#t~nondet79;havoc test_#t~nondet79; 310#L852 assume !(0 != test_~tmp___0~3); 311#L852-1 test_~tmp___2~0 := test_#t~nondet80;havoc test_#t~nondet80; 317#L862 assume 0 != test_~tmp___2~0; 351#L868-2 assume !(0 != ~pumpRunning~0); 372#L613 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 423#L671 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret56, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 352#L645-1 assume !(0 == ~pumpRunning~0); 354#L620 havoc __utac_acc__Specification3_spec__1_#t~ret53, __utac_acc__Specification3_spec__1_#t~ret54, __utac_acc__Specification3_spec__1_#t~ret55, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 402#L459-2 __utac_acc__Specification3_spec__1_#t~ret53 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret53;havoc __utac_acc__Specification3_spec__1_#t~ret53; 368#L568 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 315#L574-1 [2021-07-06 20:26:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:26:12,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509285742] [2021-07-06 20:26:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,810 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,832 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1986081058, now seen corresponding path program 1 times [2021-07-06 20:26:12,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266108514] [2021-07-06 20:26:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:26:12,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:26:12,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:12,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:12,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:26:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:26:12,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:26:12,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266108514] [2021-07-06 20:26:12,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266108514] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:26:12,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:26:12,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:26:12,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692390944] [2021-07-06 20:26:12,851 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:26:12,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:26:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:26:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:26:12,852 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-07-06 20:26:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:26:12,905 INFO L93 Difference]: Finished difference Result 178 states and 246 transitions. [2021-07-06 20:26:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:26:12,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 246 transitions. [2021-07-06 20:26:12,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 122 [2021-07-06 20:26:12,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 178 states and 246 transitions. [2021-07-06 20:26:12,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2021-07-06 20:26:12,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2021-07-06 20:26:12,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 246 transitions. [2021-07-06 20:26:12,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:26:12,910 INFO L681 BuchiCegarLoop]: Abstraction has 178 states and 246 transitions. [2021-07-06 20:26:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 246 transitions. [2021-07-06 20:26:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-07-06 20:26:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 177 states have internal predecessors, (246), 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-07-06 20:26:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 246 transitions. [2021-07-06 20:26:12,915 INFO L704 BuchiCegarLoop]: Abstraction has 178 states and 246 transitions. [2021-07-06 20:26:12,915 INFO L587 BuchiCegarLoop]: Abstraction has 178 states and 246 transitions. [2021-07-06 20:26:12,915 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:26:12,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 246 transitions. [2021-07-06 20:26:12,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 122 [2021-07-06 20:26:12,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:26:12,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:26:12,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:26:12,917 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] [2021-07-06 20:26:12,917 INFO L791 eck$LassoCheckResult]: Stem: 729#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~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(77, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(101, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(116, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(104, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string47.base, #t~string47.offset, 1);call write~init~int(82, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(73, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(84, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 4 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(75, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 1 + #t~string51.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(80, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(117, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(109, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string75.base, #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 1 + #t~string75.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 627#L-1 havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 622#L544 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; 623#L552 main_#t~ret82 := valid_product_#res;main_~tmp~10 := main_#t~ret82;havoc main_#t~ret82; 635#L969 assume 0 != main_~tmp~10; 725#L946 havoc test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_#t~nondet81, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 630#L574-1 [2021-07-06 20:26:12,918 INFO L793 eck$LassoCheckResult]: Loop: 630#L574-1 assume !false; 619#L833 assume test_~splverifierCounter~0 < 4; 620#L834 test_~tmp~9 := test_#t~nondet78;havoc test_#t~nondet78; 727#L842 assume !(0 != test_~tmp~9); 728#L842-1 test_~tmp___0~3 := test_#t~nondet79;havoc test_#t~nondet79; 624#L852 assume !(0 != test_~tmp___0~3); 625#L852-1 test_~tmp___2~0 := test_#t~nondet80;havoc test_#t~nondet80; 632#L862 assume 0 != test_~tmp___2~0; 668#L868-2 assume !(0 != ~pumpRunning~0); 684#L613 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 744#L671 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret56, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 669#L645-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret76, isHighWaterLevel_~retValue_acc~11, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~11;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 670#L499-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 704#L504-1 isHighWaterLevel_#t~ret76 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret76;havoc isHighWaterLevel_#t~ret76; 657#L791-3 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 658#L791-5 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 638#L797-1 processEnvironment__wrappee__highWaterSensor_#t~ret56 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~4 := processEnvironment__wrappee__highWaterSensor_#t~ret56;havoc processEnvironment__wrappee__highWaterSensor_#t~ret56; 639#L649-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~4); 720#L620 havoc __utac_acc__Specification3_spec__1_#t~ret53, __utac_acc__Specification3_spec__1_#t~ret54, __utac_acc__Specification3_spec__1_#t~ret55, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 721#L459-2 __utac_acc__Specification3_spec__1_#t~ret53 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret53;havoc __utac_acc__Specification3_spec__1_#t~ret53; 682#L568 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 630#L574-1 [2021-07-06 20:26:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:26:12,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134212267] [2021-07-06 20:26:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,944 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,962 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,970 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1392929194, now seen corresponding path program 1 times [2021-07-06 20:26:12,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097276820] [2021-07-06 20:26:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,975 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:12,977 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:12,979 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1849000388, now seen corresponding path program 1 times [2021-07-06 20:26:12,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:12,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779503872] [2021-07-06 20:26:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:12,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:26:13,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:13,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:13,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:13,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:13,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:13,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:26:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:26:13,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:26:13,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779503872] [2021-07-06 20:26:13,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779503872] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:26:13,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:26:13,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:26:13,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44820007] [2021-07-06 20:26:13,120 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-07-06 20:26:13,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:13,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 20:26:13,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:26:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:26:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:26:13,169 INFO L87 Difference]: Start difference. First operand 178 states and 246 transitions. cyclomatic complexity: 70 Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-07-06 20:26:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:26:13,329 INFO L93 Difference]: Finished difference Result 621 states and 863 transitions. [2021-07-06 20:26:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:26:13,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 863 transitions. [2021-07-06 20:26:13,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 452 [2021-07-06 20:26:13,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 863 transitions. [2021-07-06 20:26:13,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2021-07-06 20:26:13,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2021-07-06 20:26:13,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 863 transitions. [2021-07-06 20:26:13,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:26:13,344 INFO L681 BuchiCegarLoop]: Abstraction has 621 states and 863 transitions. [2021-07-06 20:26:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 863 transitions. [2021-07-06 20:26:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 350. [2021-07-06 20:26:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 1.3657142857142857) internal successors, (478), 349 states have internal predecessors, (478), 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-07-06 20:26:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 478 transitions. [2021-07-06 20:26:13,371 INFO L704 BuchiCegarLoop]: Abstraction has 350 states and 478 transitions. [2021-07-06 20:26:13,371 INFO L587 BuchiCegarLoop]: Abstraction has 350 states and 478 transitions. [2021-07-06 20:26:13,371 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:26:13,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 478 transitions. [2021-07-06 20:26:13,373 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 244 [2021-07-06 20:26:13,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:26:13,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:26:13,374 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:26:13,374 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-07-06 20:26:13,374 INFO L791 eck$LassoCheckResult]: Stem: 1564#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~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(30);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(9);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(30);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(9);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(13);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string45.base, #t~string45.offset, 1);call write~init~int(77, #t~string45.base, 1 + #t~string45.offset, 1);call write~init~int(101, #t~string45.base, 2 + #t~string45.offset, 1);call write~init~int(116, #t~string45.base, 3 + #t~string45.offset, 1);call write~init~int(104, #t~string45.base, 4 + #t~string45.offset, 1);call write~init~int(58, #t~string45.base, 5 + #t~string45.offset, 1);call write~init~int(0, #t~string45.base, 6 + #t~string45.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string47.base, #t~string47.offset, 1);call write~init~int(82, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(73, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(84, #t~string47.base, 3 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 4 + #t~string47.offset, 1);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string49.base, #t~string49.offset, 1);call write~init~int(75, #t~string49.base, 1 + #t~string49.offset, 1);call write~init~int(0, #t~string49.base, 2 + #t~string49.offset, 1);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string51.base, #t~string51.offset, 1);call write~init~int(0, #t~string51.base, 1 + #t~string51.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(13);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string63.base, #t~string63.offset, 1);call write~init~int(110, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 2 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string65.base, #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(102, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string67.base, #t~string67.offset, 1);call write~init~int(80, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(117, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(109, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(112, #t~string67.base, 4 + #t~string67.offset, 1);call write~init~int(58, #t~string67.base, 5 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 6 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(110, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string71.base, #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(102, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string73.base, #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string75.base, #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 1 + #t~string75.offset, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 1444#L-1 havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 1439#L544 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; 1440#L552 main_#t~ret82 := valid_product_#res;main_~tmp~10 := main_#t~ret82;havoc main_#t~ret82; 1452#L969 assume 0 != main_~tmp~10; 1558#L946 havoc test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_#t~nondet81, test_~splverifierCounter~0, test_~tmp~9, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~9;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1585#L574-1 [2021-07-06 20:26:13,374 INFO L793 eck$LassoCheckResult]: Loop: 1585#L574-1 assume !false; 1735#L833 assume test_~splverifierCounter~0 < 4; 1736#L834 test_~tmp~9 := test_#t~nondet78;havoc test_#t~nondet78; 1775#L842 assume !(0 != test_~tmp~9); 1563#L842-1 test_~tmp___0~3 := test_#t~nondet79;havoc test_#t~nondet79; 1441#L852 assume !(0 != test_~tmp___0~3); 1442#L852-1 test_~tmp___2~0 := test_#t~nondet80;havoc test_#t~nondet80; 1449#L862 assume 0 != test_~tmp___2~0; 1751#L868-2 assume !(0 != ~pumpRunning~0); 1749#L613 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 1746#L671 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret56, processEnvironment__wrappee__highWaterSensor_~tmp~4;havoc processEnvironment__wrappee__highWaterSensor_~tmp~4; 1744#L645-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret76, isHighWaterLevel_~retValue_acc~11, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~11;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 1742#L499-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 1740#L504-1 isHighWaterLevel_#t~ret76 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret76;havoc isHighWaterLevel_#t~ret76; 1739#L791-3 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 1478#L791-5 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 1455#L797-1 processEnvironment__wrappee__highWaterSensor_#t~ret56 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~4 := processEnvironment__wrappee__highWaterSensor_#t~ret56;havoc processEnvironment__wrappee__highWaterSensor_#t~ret56; 1456#L649-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~4); 1547#L620 havoc __utac_acc__Specification3_spec__1_#t~ret53, __utac_acc__Specification3_spec__1_#t~ret54, __utac_acc__Specification3_spec__1_#t~ret55, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 1550#L459-2 __utac_acc__Specification3_spec__1_#t~ret53 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret53;havoc __utac_acc__Specification3_spec__1_#t~ret53; 1502#L568 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 1503#L491 __utac_acc__Specification3_spec__1_#t~ret54 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret54;havoc __utac_acc__Specification3_spec__1_#t~ret54; 1737#L574 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 1585#L574-1 [2021-07-06 20:26:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:26:13,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:13,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604645068] [2021-07-06 20:26:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:13,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,420 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,441 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:13,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1424832324, now seen corresponding path program 1 times [2021-07-06 20:26:13,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:13,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018387353] [2021-07-06 20:26:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:13,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,458 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,468 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:26:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1227079082, now seen corresponding path program 1 times [2021-07-06 20:26:13,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:26:13,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143304459] [2021-07-06 20:26:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:26:13,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:26:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,501 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:26:13,524 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:26:13,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:26:13,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:13,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-07-06 20:26:54,749 WARN L205 SmtUtils]: Spent 41.06 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:26:54,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:54,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:27:15,185 WARN L205 SmtUtils]: Spent 20.37 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:27:15,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:27:15 BoogieIcfgContainer [2021-07-06 20:27:15,317 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:27:15,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:27:15,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:27:15,318 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:27:15,318 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:26:11" (3/4) ... [2021-07-06 20:27:15,320 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:27:15,346 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:27:15,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:27:15,347 INFO L168 Benchmark]: Toolchain (without parser) took 64606.91 ms. Allocated memory was 54.5 MB in the beginning and 127.9 MB in the end (delta: 73.4 MB). Free memory was 37.3 MB in the beginning and 79.4 MB in the end (delta: -42.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,347 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 44.0 MB. Free memory is still 25.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:27:15,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.26 ms. Allocated memory is still 54.5 MB. Free memory was 37.1 MB in the beginning and 27.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.32 ms. Allocated memory is still 54.5 MB. Free memory was 27.3 MB in the beginning and 23.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,348 INFO L168 Benchmark]: Boogie Preprocessor took 41.54 ms. Allocated memory is still 54.5 MB. Free memory was 23.4 MB in the beginning and 34.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,348 INFO L168 Benchmark]: RCFGBuilder took 683.47 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 34.2 MB in the beginning and 46.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,349 INFO L168 Benchmark]: BuchiAutomizer took 63322.59 ms. Allocated memory was 69.2 MB in the beginning and 127.9 MB in the end (delta: 58.7 MB). Free memory was 45.9 MB in the beginning and 82.5 MB in the end (delta: -36.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,349 INFO L168 Benchmark]: Witness Printer took 28.66 ms. Allocated memory is still 127.9 MB. Free memory was 82.5 MB in the beginning and 79.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:27:15,350 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.17 ms. Allocated memory is still 44.0 MB. Free memory is still 25.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 432.26 ms. Allocated memory is still 54.5 MB. Free memory was 37.1 MB in the beginning and 27.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.32 ms. Allocated memory is still 54.5 MB. Free memory was 27.3 MB in the beginning and 23.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.54 ms. Allocated memory is still 54.5 MB. Free memory was 23.4 MB in the beginning and 34.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 683.47 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 34.2 MB in the beginning and 46.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 63322.59 ms. Allocated memory was 69.2 MB in the beginning and 127.9 MB in the end (delta: 58.7 MB). Free memory was 45.9 MB in the beginning and 82.5 MB in the end (delta: -36.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. * Witness Printer took 28.66 ms. Allocated memory is still 127.9 MB. Free memory was 82.5 MB in the beginning and 79.4 MB in the end (delta: 3.1 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 350 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 62.7s. Construction of modules took 0.1s. 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 61.3ms AutomataMinimizationTime, 3 MinimizatonAttempts, 271 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 350 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 629 SDtfs, 1474 SDslu, 936 SDs, 0 SdLazy, 143 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 194.2ms Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 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: 832]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=5877} State at position 1 is {NULL=0, NULL=0, NULL=5877, NULL=5878, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ffda218=0, NULL=0, tmp___1=0, tmp=0, NULL=5903, NULL=0, NULL=5897, NULL=5895, cleanupTimeShifts=4, NULL=5898, tmp=0, tmp=1, NULL=0, waterLevel=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e6ba928=0, NULL=0, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=0, NULL=0, NULL=0, \result=1, NULL=5887, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e329672=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e02e0b8=0, NULL=5902, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67b7e22d=0, tmp=1, tmp___0=0, NULL=0, retValue_acc=1, NULL=5900, NULL=5901, NULL=5885, head=0, NULL=0, NULL=0, tmp=0, NULL=5905, NULL=0, NULL=0, NULL=5892, NULL=0, NULL=0, NULL=5880, NULL=5894, NULL=0, NULL=5893, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a695b69=0, tmp___0=0, NULL=0, NULL=0, NULL=0, tmp___0=1, NULL=5904, tmp=0, NULL=5891, NULL=5879, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@738e32e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@289c27b2=0, NULL=0, NULL=0, NULL=0, systemActive=1, NULL=5883, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@769b3702=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bb16b61=53, retValue_acc=0, \result=0, NULL=5890, NULL=5889, retValue_acc=0, NULL=5896, \result=0, NULL=0, NULL=5899, NULL=5886, retValue_acc=1, NULL=5882, tmp___2=53, splverifierCounter=0, NULL=0, \result=0, NULL=5881, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53c0f0aa=0, NULL=5884, NULL=5888} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L211] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L416] int waterLevel = 1; [L417] int methaneLevelCritical = 0; [L606] int pumpRunning = 0; [L607] int systemActive = 1; [L887] int cleanupTimeShifts = 4; [L960] int retValue_acc ; [L961] int tmp ; [L548] int retValue_acc ; [L551] retValue_acc = 1 [L552] return (retValue_acc); [L967] tmp = valid_product() [L969] COND TRUE \read(tmp) [L823] int splverifierCounter ; [L824] int tmp ; [L825] int tmp___0 ; [L826] int tmp___1 ; [L827] int tmp___2 ; [L830] splverifierCounter = 0 Loop: [L832] COND TRUE 1 [L834] COND TRUE splverifierCounter < 4 [L840] tmp = __VERIFIER_nondet_int() [L842] COND FALSE !(\read(tmp)) [L850] tmp___0 = __VERIFIER_nondet_int() [L852] COND FALSE !(\read(tmp___0)) [L860] tmp___2 = __VERIFIER_nondet_int() [L862] COND TRUE \read(tmp___2) [L613] COND FALSE !(\read(pumpRunning)) [L620] COND TRUE \read(systemActive) [L668] int tmp ; [L671] COND FALSE !(\read(pumpRunning)) [L642] int tmp ; [L645] COND TRUE ! pumpRunning [L783] int retValue_acc ; [L784] int tmp ; [L785] int tmp___0 ; [L496] int retValue_acc ; [L499] COND TRUE waterLevel < 2 [L500] retValue_acc = 1 [L501] return (retValue_acc); [L789] tmp = isHighWaterSensorDry() [L791] COND TRUE \read(tmp) [L792] tmp___0 = 0 [L796] retValue_acc = tmp___0 [L797] return (retValue_acc); [L647] tmp = isHighWaterLevel() [L649] COND FALSE !(\read(tmp)) [L560] int tmp ; [L561] int tmp___0 ; [L562] int tmp___1 ; [L455] int retValue_acc ; [L458] retValue_acc = methaneLevelCritical [L459] return (retValue_acc); [L566] tmp = isMethaneLevelCritical() [L568] COND FALSE !(\read(tmp)) [L487] int retValue_acc ; [L490] retValue_acc = waterLevel [L491] return (retValue_acc); [L572] tmp___0 = getWaterLevel() [L574] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:27:15,389 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...