./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product44.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_product44.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 e60ff67dae14f5ff0ee1027845136e2245e7a1f5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:25:04,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:25:04,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:25:04,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:25:04,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:25:04,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:25:04,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:25:04,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:25:04,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:25:04,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:25:04,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:25:04,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:25:04,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:25:04,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:25:04,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:25:04,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:25:04,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:25:04,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:25:04,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:25:04,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:25:04,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:25:04,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:25:04,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:25:04,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:25:04,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:25:04,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:25:04,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:25:04,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:25:04,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:25:04,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:25:04,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:25:04,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:25:04,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:25:04,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:25:04,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:25:04,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:25:04,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:25:04,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:25:04,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:25:04,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:25:04,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:25:04,354 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:25:04,369 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:25:04,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:25:04,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:25:04,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:25:04,371 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:25:04,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:25:04,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:25:04,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:25:04,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:25:04,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:25:04,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:25:04,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:25:04,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:25:04,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:25:04,373 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 -> e60ff67dae14f5ff0ee1027845136e2245e7a1f5 [2021-07-06 20:25:04,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:25:04,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:25:04,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:25:04,640 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:25:04,640 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:25:04,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product44.cil.c [2021-07-06 20:25:04,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfe8604e/d36e2fb80f8c4ecabd4f116e238998eb/FLAGcaa0b78c7 [2021-07-06 20:25:05,118 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:25:05,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product44.cil.c [2021-07-06 20:25:05,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfe8604e/d36e2fb80f8c4ecabd4f116e238998eb/FLAGcaa0b78c7 [2021-07-06 20:25:05,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfe8604e/d36e2fb80f8c4ecabd4f116e238998eb [2021-07-06 20:25:05,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:25:05,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:25:05,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:05,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:25:05,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:25:05,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da6c843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05, skipping insertion in model container [2021-07-06 20:25:05,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:25:05,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:25:05,667 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_product44.cil.c[4955,4968] [2021-07-06 20:25:05,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:05,754 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:25:05,774 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_product44.cil.c[4955,4968] [2021-07-06 20:25:05,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:05,847 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:25:05,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05 WrapperNode [2021-07-06 20:25:05,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:05,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:05,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:25:05,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:25:05,855 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:25:05" (1/1) ... [2021-07-06 20:25:05,878 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:25:05" (1/1) ... [2021-07-06 20:25:05,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:05,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:25:05,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:25:05,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:25:05,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:25:05,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:25:05,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:25:05,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:25:05,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (1/1) ... [2021-07-06 20:25:05,946 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:25:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:25:05,974 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:25:05,998 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:25:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:25:06,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:25:06,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:25:06,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:25:06,671 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:25:06,671 INFO L299 CfgBuilder]: Removed 126 assume(true) statements. [2021-07-06 20:25:06,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:06 BoogieIcfgContainer [2021-07-06 20:25:06,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:25:06,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:25:06,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:25:06,674 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:25:06,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:06,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:25:05" (1/3) ... [2021-07-06 20:25:06,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc5a3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:06, skipping insertion in model container [2021-07-06 20:25:06,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:06,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:05" (2/3) ... [2021-07-06 20:25:06,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc5a3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:06, skipping insertion in model container [2021-07-06 20:25:06,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:06,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:06" (3/3) ... [2021-07-06 20:25:06,677 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product44.cil.c [2021-07-06 20:25:06,711 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:25:06,711 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:25:06,711 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:25:06,711 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:25:06,711 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:25:06,711 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:25:06,712 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:25:06,712 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:25:06,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 91 states have internal predecessors, (138), 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:25:06,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2021-07-06 20:25:06,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:06,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:06,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:06,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:06,751 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:25:06,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 91 states have internal predecessors, (138), 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:25:06,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2021-07-06 20:25:06,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:06,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:06,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:06,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:06,759 INFO L791 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(77, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(101, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(116, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(104, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string16.base, #t~string16.offset, 1);call write~init~int(82, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(73, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(84, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 4 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(75, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(30);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(9);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(25);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 17#L-1true havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 3#L303true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 42#L311true main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 62#L132true assume 0 != main_~tmp~0; 83#L105true havoc test_#t~nondet77, test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 63#L165-1true [2021-07-06 20:25:06,759 INFO L793 eck$LassoCheckResult]: Loop: 63#L165-1true assume !false; 7#L899true assume test_~splverifierCounter~0 < 4; 36#L900true test_~tmp~8 := test_#t~nondet77;havoc test_#t~nondet77; 68#L908true assume !(0 != test_~tmp~8); 70#L908-1true test_~tmp___0~2 := test_#t~nondet78;havoc test_#t~nondet78; 45#L918true assume !(0 != test_~tmp___0~2); 47#L918-1true test_~tmp___2~0 := test_#t~nondet79;havoc test_#t~nondet79; 14#L928true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 23#L936-1true assume !(0 != ~pumpRunning~0); 18#L702true assume !(0 != ~systemActive~0); 32#L709true havoc __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~1;havoc isMethaneLevelCritical_~retValue_acc~1;isMethaneLevelCritical_~retValue_acc~1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~1; 6#L230-1true __utac_acc__Specification3_spec__1_#t~ret8 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 86#L159true assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 63#L165-1true [2021-07-06 20:25:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:25:06,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:06,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545690302] [2021-07-06 20:25:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:06,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:06,972 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,040 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,071 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1671648193, now seen corresponding path program 1 times [2021-07-06 20:25:07,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730855550] [2021-07-06 20:25:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:07,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:07,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:07,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:07,126 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:25:07,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:07,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730855550] [2021-07-06 20:25:07,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730855550] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:07,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:07,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:07,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284226808] [2021-07-06 20:25:07,133 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:25:07,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:25:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:25:07,146 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 91 states have internal predecessors, (138), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:07,219 INFO L93 Difference]: Finished difference Result 178 states and 252 transitions. [2021-07-06 20:25:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:25:07,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 252 transitions. [2021-07-06 20:25:07,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 114 [2021-07-06 20:25:07,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 164 states and 237 transitions. [2021-07-06 20:25:07,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-07-06 20:25:07,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-07-06 20:25:07,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 237 transitions. [2021-07-06 20:25:07,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:07,240 INFO L681 BuchiCegarLoop]: Abstraction has 164 states and 237 transitions. [2021-07-06 20:25:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 237 transitions. [2021-07-06 20:25:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2021-07-06 20:25:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 161 states have internal predecessors, (234), 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:25:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2021-07-06 20:25:07,274 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-07-06 20:25:07,274 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-07-06 20:25:07,274 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:25:07,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 234 transitions. [2021-07-06 20:25:07,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-07-06 20:25:07,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:07,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:07,279 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:07,279 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:07,279 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(77, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(101, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(116, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(104, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string16.base, #t~string16.offset, 1);call write~init~int(82, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(73, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(84, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 4 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(75, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(30);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(9);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(25);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 306#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 279#L303 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 280#L311 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 341#L132 assume 0 != main_~tmp~0; 368#L105 havoc test_#t~nondet77, test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 378#L165-1 [2021-07-06 20:25:07,280 INFO L793 eck$LassoCheckResult]: Loop: 378#L165-1 assume !false; 396#L899 assume test_~splverifierCounter~0 < 4; 395#L900 test_~tmp~8 := test_#t~nondet77;havoc test_#t~nondet77; 394#L908 assume !(0 != test_~tmp~8); 392#L908-1 test_~tmp___0~2 := test_#t~nondet78;havoc test_#t~nondet78; 391#L918 assume !(0 != test_~tmp___0~2); 349#L918-1 test_~tmp___2~0 := test_#t~nondet79;havoc test_#t~nondet79; 302#L928 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 303#L936-1 assume !(0 != ~pumpRunning~0); 307#L702 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 308#L734 assume !(0 == ~pumpRunning~0); 402#L709 havoc __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~1;havoc isMethaneLevelCritical_~retValue_acc~1;isMethaneLevelCritical_~retValue_acc~1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~1; 401#L230-1 __utac_acc__Specification3_spec__1_#t~ret8 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 398#L159 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 378#L165-1 [2021-07-06 20:25:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:25:07,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276031706] [2021-07-06 20:25:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,322 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,343 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash -323255282, now seen corresponding path program 1 times [2021-07-06 20:25:07,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656205149] [2021-07-06 20:25:07,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:07,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:07,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:07,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:07,362 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:25:07,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:07,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656205149] [2021-07-06 20:25:07,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656205149] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:07,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:07,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:07,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645079592] [2021-07-06 20:25:07,363 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:25:07,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:07,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:25:07,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:25:07,364 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. cyclomatic complexity: 75 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:25:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:07,424 INFO L93 Difference]: Finished difference Result 257 states and 358 transitions. [2021-07-06 20:25:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:25:07,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 358 transitions. [2021-07-06 20:25:07,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 183 [2021-07-06 20:25:07,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 257 states and 358 transitions. [2021-07-06 20:25:07,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2021-07-06 20:25:07,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2021-07-06 20:25:07,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 257 states and 358 transitions. [2021-07-06 20:25:07,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:07,429 INFO L681 BuchiCegarLoop]: Abstraction has 257 states and 358 transitions. [2021-07-06 20:25:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states and 358 transitions. [2021-07-06 20:25:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2021-07-06 20:25:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 256 states have internal predecessors, (358), 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:25:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 358 transitions. [2021-07-06 20:25:07,435 INFO L704 BuchiCegarLoop]: Abstraction has 257 states and 358 transitions. [2021-07-06 20:25:07,435 INFO L587 BuchiCegarLoop]: Abstraction has 257 states and 358 transitions. [2021-07-06 20:25:07,435 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:25:07,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 358 transitions. [2021-07-06 20:25:07,436 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 183 [2021-07-06 20:25:07,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:07,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:07,437 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:07,437 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] [2021-07-06 20:25:07,437 INFO L791 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(77, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(101, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(116, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(104, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string16.base, #t~string16.offset, 1);call write~init~int(82, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(73, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(84, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 4 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(75, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(30);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(9);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(25);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 734#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 706#L303 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 707#L311 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 767#L132 assume 0 != main_~tmp~0; 785#L105 havoc test_#t~nondet77, test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 761#L165-1 [2021-07-06 20:25:07,438 INFO L793 eck$LassoCheckResult]: Loop: 761#L165-1 assume !false; 715#L899 assume test_~splverifierCounter~0 < 4; 716#L900 test_~tmp~8 := test_#t~nondet77;havoc test_#t~nondet77; 759#L908 assume !(0 != test_~tmp~8); 781#L908-1 test_~tmp___0~2 := test_#t~nondet78;havoc test_#t~nondet78; 770#L918 assume !(0 != test_~tmp___0~2); 771#L918-1 test_~tmp___2~0 := test_#t~nondet79;havoc test_#t~nondet79; 727#L928 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 728#L936-1 assume !(0 != ~pumpRunning~0); 735#L702 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 736#L734 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~3;havoc isHighWaterSensorDry_~retValue_acc~3; 754#L270 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~3 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~3; 755#L275 isHighWaterLevel_#t~ret76 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret76;havoc isHighWaterLevel_#t~ret76; 773#L854 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 791#L854-2 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 779#L860 processEnvironment_#t~ret57 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret57;havoc processEnvironment_#t~ret57; 722#L738 assume !(0 != processEnvironment_~tmp~5); 713#L709 havoc __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~1;havoc isMethaneLevelCritical_~retValue_acc~1;isMethaneLevelCritical_~retValue_acc~1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~1; 959#L230-1 __utac_acc__Specification3_spec__1_#t~ret8 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 799#L159 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 761#L165-1 [2021-07-06 20:25:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:25:07,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182768308] [2021-07-06 20:25:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,459 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,488 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1551152038, now seen corresponding path program 1 times [2021-07-06 20:25:07,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366623181] [2021-07-06 20:25:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,509 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,511 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1536440064, now seen corresponding path program 1 times [2021-07-06 20:25:07,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219528365] [2021-07-06 20:25:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:07,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:07,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:07,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:07,551 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:25:07,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:07,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219528365] [2021-07-06 20:25:07,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219528365] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:07,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:07,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:07,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110028827] [2021-07-06 20:25:07,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:07,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-06 20:25:07,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:25:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:25:07,702 INFO L87 Difference]: Start difference. First operand 257 states and 358 transitions. cyclomatic complexity: 104 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:25:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:07,849 INFO L93 Difference]: Finished difference Result 856 states and 1198 transitions. [2021-07-06 20:25:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:25:07,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 856 states and 1198 transitions. [2021-07-06 20:25:07,863 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 646 [2021-07-06 20:25:07,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 856 states to 856 states and 1198 transitions. [2021-07-06 20:25:07,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 856 [2021-07-06 20:25:07,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 856 [2021-07-06 20:25:07,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 856 states and 1198 transitions. [2021-07-06 20:25:07,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:07,870 INFO L681 BuchiCegarLoop]: Abstraction has 856 states and 1198 transitions. [2021-07-06 20:25:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states and 1198 transitions. [2021-07-06 20:25:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 508. [2021-07-06 20:25:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 508 states have (on average 1.3661417322834646) internal successors, (694), 507 states have internal predecessors, (694), 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:25:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 694 transitions. [2021-07-06 20:25:07,908 INFO L704 BuchiCegarLoop]: Abstraction has 508 states and 694 transitions. [2021-07-06 20:25:07,908 INFO L587 BuchiCegarLoop]: Abstraction has 508 states and 694 transitions. [2021-07-06 20:25:07,908 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:25:07,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 508 states and 694 transitions. [2021-07-06 20:25:07,918 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 366 [2021-07-06 20:25:07,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:07,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:07,919 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:07,919 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] [2021-07-06 20:25:07,919 INFO L791 eck$LassoCheckResult]: Stem: 1913#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string14.base, #t~string14.offset, 1);call write~init~int(77, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(101, #t~string14.base, 2 + #t~string14.offset, 1);call write~init~int(116, #t~string14.base, 3 + #t~string14.offset, 1);call write~init~int(104, #t~string14.base, 4 + #t~string14.offset, 1);call write~init~int(58, #t~string14.base, 5 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 6 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string16.base, #t~string16.offset, 1);call write~init~int(82, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(73, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(84, #t~string16.base, 3 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 4 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(75, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string20.base, #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 1 + #t~string20.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(21);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(21);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(30);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(9);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(25);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1; 1867#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 1835#L303 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 1836#L311 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 1903#L132 assume 0 != main_~tmp~0; 1925#L105 havoc test_#t~nondet77, test_#t~nondet78, test_#t~nondet79, test_#t~nondet80, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1896#L165-1 [2021-07-06 20:25:07,920 INFO L793 eck$LassoCheckResult]: Loop: 1896#L165-1 assume !false; 1843#L899 assume test_~splverifierCounter~0 < 4; 1844#L900 test_~tmp~8 := test_#t~nondet77;havoc test_#t~nondet77; 1892#L908 assume !(0 != test_~tmp~8); 1920#L908-1 test_~tmp___0~2 := test_#t~nondet78;havoc test_#t~nondet78; 1907#L918 assume !(0 != test_~tmp___0~2); 1908#L918-1 test_~tmp___2~0 := test_#t~nondet79;havoc test_#t~nondet79; 2340#L928 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1872#L936-1 assume !(0 != ~pumpRunning~0); 1868#L702 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret57, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 1869#L734 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~3;havoc isHighWaterSensorDry_~retValue_acc~3; 1889#L270 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~3 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~3; 1890#L275 isHighWaterLevel_#t~ret76 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret76;havoc isHighWaterLevel_#t~ret76; 1910#L854 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~1 := 0; 1933#L854-2 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 1917#L860 processEnvironment_#t~ret57 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret57;havoc processEnvironment_#t~ret57; 1853#L738 assume !(0 != processEnvironment_~tmp~5); 1847#L709 havoc __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~1;havoc isMethaneLevelCritical_~retValue_acc~1;isMethaneLevelCritical_~retValue_acc~1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~1; 1841#L230-1 __utac_acc__Specification3_spec__1_#t~ret8 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 1842#L159 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~1);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 1940#L262 __utac_acc__Specification3_spec__1_#t~ret9 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret9;havoc __utac_acc__Specification3_spec__1_#t~ret9; 1895#L165 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 1896#L165-1 [2021-07-06 20:25:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:25:07,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998442365] [2021-07-06 20:25:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,940 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,954 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,959 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -303450068, now seen corresponding path program 1 times [2021-07-06 20:25:07,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948625578] [2021-07-06 20:25:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,963 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,965 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:07,967 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 949855058, now seen corresponding path program 1 times [2021-07-06 20:25:07,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:07,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692942468] [2021-07-06 20:25:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:07,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:07,988 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:08,016 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:08,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:08,147 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-07-06 20:25:08,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:08,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-06 20:25:47,994 WARN L205 SmtUtils]: Spent 39.78 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:25:48,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:48,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:26:07,645 WARN L205 SmtUtils]: Spent 19.60 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:26:07,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:26:07 BoogieIcfgContainer [2021-07-06 20:26:07,779 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:26:07,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:26:07,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:26:07,780 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:26:07,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:06" (3/4) ... [2021-07-06 20:26:07,782 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:26:07,818 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:26:07,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:26:07,819 INFO L168 Benchmark]: Toolchain (without parser) took 62310.18 ms. Allocated memory was 60.8 MB in the beginning and 107.0 MB in the end (delta: 46.1 MB). Free memory was 40.4 MB in the beginning and 51.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,819 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory is still 42.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:26:07,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.82 ms. Allocated memory is still 60.8 MB. Free memory was 40.2 MB in the beginning and 36.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 60.8 MB. Free memory was 36.2 MB in the beginning and 33.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,820 INFO L168 Benchmark]: Boogie Preprocessor took 38.42 ms. Allocated memory is still 60.8 MB. Free memory was 32.8 MB in the beginning and 30.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,820 INFO L168 Benchmark]: RCFGBuilder took 731.85 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 30.5 MB in the beginning and 46.1 MB in the end (delta: -15.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,820 INFO L168 Benchmark]: BuchiAutomizer took 61106.67 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 45.7 MB in the beginning and 54.8 MB in the end (delta: -9.1 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,821 INFO L168 Benchmark]: Witness Printer took 38.62 ms. Allocated memory is still 107.0 MB. Free memory was 54.8 MB in the beginning and 51.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:07,822 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory is still 42.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 339.82 ms. Allocated memory is still 60.8 MB. Free memory was 40.2 MB in the beginning and 36.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 60.8 MB. Free memory was 36.2 MB in the beginning and 33.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.42 ms. Allocated memory is still 60.8 MB. Free memory was 32.8 MB in the beginning and 30.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 731.85 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 30.5 MB in the beginning and 46.1 MB in the end (delta: -15.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 61106.67 ms. Allocated memory was 73.4 MB in the beginning and 107.0 MB in the end (delta: 33.6 MB). Free memory was 45.7 MB in the beginning and 54.8 MB in the end (delta: -9.1 MB). Peak memory consumption was 62.7 MB. Max. memory is 16.1 GB. * Witness Printer took 38.62 ms. Allocated memory is still 107.0 MB. Free memory was 54.8 MB in the beginning and 51.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 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 5 locations. The remainder module has 508 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 60.5s. 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 67.9ms AutomataMinimizationTime, 3 MinimizatonAttempts, 350 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 508 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 419 SDtfs, 688 SDslu, 689 SDs, 0 SdLazy, 111 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 154.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 898]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=11663} State at position 1 is {NULL=0, NULL=0, NULL=11663, NULL=11666, NULL=0, NULL=0, NULL=0, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bfb0c7a=0, NULL=0, tmp___1=0, tmp=0, NULL=0, NULL=11681, tmp=0, cleanupTimeShifts=4, NULL=11664, NULL=11674, NULL=11675, waterLevel=1, NULL=0, NULL=0, NULL=11671, retValue_acc=1, \result=1, head=0, pumpRunning=0, tmp=1, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e7c2a4a=0, \result=1, NULL=11672, NULL=0, retValue_acc=0, NULL=11690, NULL=0, tmp=1, NULL=0, tmp___0=0, NULL=11691, head=0, tmp=0, NULL=11668, retValue_acc=0, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13fcdde0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16124bf5=0, NULL=0, NULL=0, NULL=11669, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f8c1041=0, tmp___0=0, NULL=0, NULL=0, NULL=11670, NULL=0, tmp___0=1, NULL=11687, NULL=11684, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7165de0=81, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@363c41cd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eec4c53=0, NULL=0, systemActive=1, NULL=11683, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@792699d9=0, NULL=0, NULL=11680, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=11682, NULL=11677, NULL=11685, \result=0, NULL=11688, NULL=0, NULL=0, NULL=0, retValue_acc=1, NULL=11667, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cc8573e=0, NULL=11678, tmp___2=81, splverifierCounter=0, NULL=0, \result=0, NULL=11673, tmp___1=0, NULL=0, NULL=11676, NULL=11689, NULL=11679, NULL=11665, NULL=11686} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L42] int cleanupTimeShifts = 4; [L187] int waterLevel = 1; [L188] int methaneLevelCritical = 0; [L494] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L695] int pumpRunning = 0; [L696] int systemActive = 1; [L123] int retValue_acc ; [L124] int tmp ; [L307] int retValue_acc ; [L310] retValue_acc = 1 [L311] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L889] int splverifierCounter ; [L890] int tmp ; [L891] int tmp___0 ; [L892] int tmp___1 ; [L893] int tmp___2 ; [L896] splverifierCounter = 0 Loop: [L898] COND TRUE 1 [L900] COND TRUE splverifierCounter < 4 [L906] tmp = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp)) [L916] tmp___0 = __VERIFIER_nondet_int() [L918] COND FALSE !(\read(tmp___0)) [L926] tmp___2 = __VERIFIER_nondet_int() [L928] COND TRUE \read(tmp___2) [L883] systemActive = 1 [L702] COND FALSE !(\read(pumpRunning)) [L709] COND TRUE \read(systemActive) [L731] int tmp ; [L734] COND TRUE ! pumpRunning [L846] int retValue_acc ; [L847] int tmp ; [L848] int tmp___0 ; [L267] int retValue_acc ; [L270] COND TRUE waterLevel < 2 [L271] retValue_acc = 1 [L272] return (retValue_acc); [L852] tmp = isHighWaterSensorDry() [L854] COND TRUE \read(tmp) [L855] tmp___0 = 0 [L859] retValue_acc = tmp___0 [L860] return (retValue_acc); [L736] tmp = isHighWaterLevel() [L738] COND FALSE !(\read(tmp)) [L151] int tmp ; [L152] int tmp___0 ; [L153] int tmp___1 ; [L226] int retValue_acc ; [L229] retValue_acc = methaneLevelCritical [L230] return (retValue_acc); [L157] tmp = isMethaneLevelCritical() [L159] COND FALSE !(\read(tmp)) [L258] int retValue_acc ; [L261] retValue_acc = waterLevel [L262] return (retValue_acc); [L163] tmp___0 = getWaterLevel() [L165] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:26:07,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...