./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product47.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_spec1_product47.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 061cfb2472421d3cfe55520924b41b3593b27e2a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:13:52,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:13:52,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:13:52,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:13:52,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:13:52,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:13:52,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:13:52,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:13:52,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:13:52,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:13:52,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:13:52,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:13:52,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:13:52,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:13:52,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:13:52,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:13:52,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:13:52,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:13:52,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:13:52,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:13:52,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:13:52,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:13:52,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:13:52,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:13:52,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:13:52,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:13:52,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:13:52,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:13:52,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:13:52,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:13:52,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:13:52,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:13:52,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:13:52,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:13:52,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:13:52,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:13:52,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:13:52,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:13:52,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:13:52,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:13:52,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:13:52,322 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:13:52,359 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:13:52,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:13:52,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:13:52,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:13:52,361 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:13:52,361 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:13:52,361 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:13:52,361 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:13:52,362 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:13:52,362 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:13:52,363 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:13:52,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:13:52,363 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:13:52,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:13:52,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:13:52,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:13:52,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:13:52,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:13:52,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:13:52,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:13:52,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:13:52,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:13:52,365 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:13:52,366 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:13:52,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:13:52,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:13:52,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:13:52,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:13:52,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:13:52,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:13:52,368 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:13:52,368 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 -> 061cfb2472421d3cfe55520924b41b3593b27e2a [2021-07-06 20:13:52,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:13:52,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:13:52,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:13:52,668 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:13:52,673 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:13:52,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product47.cil.c [2021-07-06 20:13:52,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e435c8e/9faa139adb2743e99d719f4bd6881322/FLAGc7ef5869e [2021-07-06 20:13:53,183 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:13:53,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product47.cil.c [2021-07-06 20:13:53,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e435c8e/9faa139adb2743e99d719f4bd6881322/FLAGc7ef5869e [2021-07-06 20:13:53,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e435c8e/9faa139adb2743e99d719f4bd6881322 [2021-07-06 20:13:53,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:13:53,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:13:53,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:13:53,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:13:53,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:13:53,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:13:53" (1/1) ... [2021-07-06 20:13:53,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c90fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:53, skipping insertion in model container [2021-07-06 20:13:53,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:13:53" (1/1) ... [2021-07-06 20:13:53,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:13:53,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:13:53,810 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_spec1_product47.cil.c[1720,1733] [2021-07-06 20:13:53,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:13:53,979 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:13:54,000 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_spec1_product47.cil.c[1720,1733] [2021-07-06 20:13:54,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:13:54,091 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:13:54,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54 WrapperNode [2021-07-06 20:13:54,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:13:54,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:13:54,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:13:54,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:13:54,101 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:13:54" (1/1) ... [2021-07-06 20:13:54,123 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:13:54" (1/1) ... [2021-07-06 20:13:54,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:13:54,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:13:54,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:13:54,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:13:54,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:13:54,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:13:54,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:13:54,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:13:54,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (1/1) ... [2021-07-06 20:13:54,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:13:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:13:54,263 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:13:54,274 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:13:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:13:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:13:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:13:54,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:13:55,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:13:55,104 INFO L299 CfgBuilder]: Removed 196 assume(true) statements. [2021-07-06 20:13:55,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:13:55 BoogieIcfgContainer [2021-07-06 20:13:55,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:13:55,106 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:13:55,106 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:13:55,110 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:13:55,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:13:55,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:13:53" (1/3) ... [2021-07-06 20:13:55,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43602a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:13:55, skipping insertion in model container [2021-07-06 20:13:55,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:13:55,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:13:54" (2/3) ... [2021-07-06 20:13:55,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43602a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:13:55, skipping insertion in model container [2021-07-06 20:13:55,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:13:55,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:13:55" (3/3) ... [2021-07-06 20:13:55,114 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product47.cil.c [2021-07-06 20:13:55,155 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:13:55,155 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:13:55,155 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:13:55,155 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:13:55,155 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:13:55,155 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:13:55,155 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:13:55,155 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:13:55,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 128 states, 127 states have (on average 1.5118110236220472) internal successors, (192), 127 states have internal predecessors, (192), 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:13:55,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2021-07-06 20:13:55,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:55,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:55,196 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,196 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,197 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:13:55,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 128 states, 127 states have (on average 1.5118110236220472) internal successors, (192), 127 states have internal predecessors, (192), 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:13:55,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2021-07-06 20:13:55,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:55,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:55,204 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,204 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,208 INFO L791 eck$LassoCheckResult]: Stem: 82#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 5#L-1true havoc main_#res;havoc main_#t~ret80, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 30#L105true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 51#L113true main_#t~ret80 := valid_product_#res;main_~tmp~9 := main_#t~ret80;havoc main_#t~ret80; 118#L949true assume 0 != main_~tmp~9; 14#L926true havoc test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 24#L53-1true [2021-07-06 20:13:55,208 INFO L793 eck$LassoCheckResult]: Loop: 24#L53-1true assume !false; 124#L445true assume test_~splverifierCounter~0 < 4; 58#L446true test_~tmp~5 := test_#t~nondet41;havoc test_#t~nondet41; 85#L454true assume !(0 != test_~tmp~5); 86#L454-1true test_~tmp___0~2 := test_#t~nondet42;havoc test_#t~nondet42; 9#L464true assume !(0 != test_~tmp___0~2); 13#L464-1true test_~tmp___2~0 := test_#t~nondet43;havoc test_#t~nondet43; 44#L474true assume 0 != test_~tmp___2~0; 25#L480-1true assume !(0 != ~pumpRunning~0); 4#L230true assume !(0 != ~systemActive~0); 66#L237true havoc __utac_acc__Specification1_spec__1_#t~ret7, __utac_acc__Specification1_spec__1_#t~ret8, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 130#L167-3true __utac_acc__Specification1_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret7;havoc __utac_acc__Specification1_spec__1_#t~ret7; 34#L53true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 24#L53-1true [2021-07-06 20:13:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:13:55,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:55,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404077116] [2021-07-06 20:13:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:55,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:55,431 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:55,492 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:55,517 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1670724661, now seen corresponding path program 1 times [2021-07-06 20:13:55,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:55,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465272237] [2021-07-06 20:13:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:55,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:55,525 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:55,527 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:55,530 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash 43554277, now seen corresponding path program 1 times [2021-07-06 20:13:55,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:55,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268170147] [2021-07-06 20:13:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:55,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:13:55,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:55,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:55,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:55,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:13:55,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:55,638 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:13:55,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:13:55,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268170147] [2021-07-06 20:13:55,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268170147] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:13:55,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:13:55,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:13:55,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461502608] [2021-07-06 20:13:55,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:55,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-06 20:13:55,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:13:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:13:55,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:13:55,711 INFO L87 Difference]: Start difference. First operand has 128 states, 127 states have (on average 1.5118110236220472) internal successors, (192), 127 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:13:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:13:55,851 INFO L93 Difference]: Finished difference Result 300 states and 426 transitions. [2021-07-06 20:13:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:13:55,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 426 transitions. [2021-07-06 20:13:55,863 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 193 [2021-07-06 20:13:55,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 279 states and 405 transitions. [2021-07-06 20:13:55,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2021-07-06 20:13:55,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2021-07-06 20:13:55,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 405 transitions. [2021-07-06 20:13:55,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:13:55,888 INFO L681 BuchiCegarLoop]: Abstraction has 279 states and 405 transitions. [2021-07-06 20:13:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 405 transitions. [2021-07-06 20:13:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 162. [2021-07-06 20:13:55,929 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:13:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2021-07-06 20:13:55,931 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-07-06 20:13:55,931 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 234 transitions. [2021-07-06 20:13:55,932 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:13:55,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 234 transitions. [2021-07-06 20:13:55,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-07-06 20:13:55,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:55,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:55,935 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:55,935 INFO L791 eck$LassoCheckResult]: Stem: 543#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 451#L-1 havoc main_#res;havoc main_#t~ret80, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 452#L105 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 491#L113 main_#t~ret80 := valid_product_#res;main_~tmp~9 := main_#t~ret80;havoc main_#t~ret80; 515#L949 assume 0 != main_~tmp~9; 469#L926 havoc test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 470#L53-1 [2021-07-06 20:13:55,935 INFO L793 eck$LassoCheckResult]: Loop: 470#L53-1 assume !false; 484#L445 assume test_~splverifierCounter~0 < 4; 521#L446 test_~tmp~5 := test_#t~nondet41;havoc test_#t~nondet41; 522#L454 assume !(0 != test_~tmp~5); 467#L454-1 test_~tmp___0~2 := test_#t~nondet42;havoc test_#t~nondet42; 461#L464 assume !(0 != test_~tmp___0~2); 462#L464-1 test_~tmp___2~0 := test_#t~nondet43;havoc test_#t~nondet43; 468#L474 assume 0 != test_~tmp___2~0; 481#L480-1 assume !(0 != ~pumpRunning~0); 449#L230 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret21, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 450#L288 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret20, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 460#L262-1 assume !(0 == ~pumpRunning~0); 458#L237 havoc __utac_acc__Specification1_spec__1_#t~ret7, __utac_acc__Specification1_spec__1_#t~ret8, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 530#L167-3 __utac_acc__Specification1_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret7;havoc __utac_acc__Specification1_spec__1_#t~ret7; 494#L53 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 470#L53-1 [2021-07-06 20:13:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:13:55,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:55,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157930651] [2021-07-06 20:13:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:55,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:55,999 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,048 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,058 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1966055757, now seen corresponding path program 1 times [2021-07-06 20:13:56,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118044848] [2021-07-06 20:13:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:13:56,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:56,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,073 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:13:56,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:13:56,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118044848] [2021-07-06 20:13:56,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118044848] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:13:56,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:13:56,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:13:56,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856453644] [2021-07-06 20:13:56,076 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:13:56,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:13:56,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:13:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:13:56,078 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:13:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:13:56,184 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2021-07-06 20:13:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:13:56,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 274 transitions. [2021-07-06 20:13:56,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2021-07-06 20:13:56,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 274 transitions. [2021-07-06 20:13:56,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2021-07-06 20:13:56,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2021-07-06 20:13:56,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 274 transitions. [2021-07-06 20:13:56,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:13:56,190 INFO L681 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2021-07-06 20:13:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 274 transitions. [2021-07-06 20:13:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-07-06 20:13:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.36318407960199) internal successors, (274), 200 states have internal predecessors, (274), 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:13:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2021-07-06 20:13:56,218 INFO L704 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2021-07-06 20:13:56,218 INFO L587 BuchiCegarLoop]: Abstraction has 201 states and 274 transitions. [2021-07-06 20:13:56,218 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:13:56,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 274 transitions. [2021-07-06 20:13:56,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2021-07-06 20:13:56,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:56,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:56,221 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,221 INFO L791 eck$LassoCheckResult]: Stem: 919#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 819#L-1 havoc main_#res;havoc main_#t~ret80, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 820#L105 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 860#L113 main_#t~ret80 := valid_product_#res;main_~tmp~9 := main_#t~ret80;havoc main_#t~ret80; 888#L949 assume 0 != main_~tmp~9; 835#L926 havoc test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 836#L53-1 [2021-07-06 20:13:56,222 INFO L793 eck$LassoCheckResult]: Loop: 836#L53-1 assume !false; 852#L445 assume test_~splverifierCounter~0 < 4; 894#L446 test_~tmp~5 := test_#t~nondet41;havoc test_#t~nondet41; 895#L454 assume !(0 != test_~tmp~5); 833#L454-1 test_~tmp___0~2 := test_#t~nondet42;havoc test_#t~nondet42; 827#L464 assume !(0 != test_~tmp___0~2); 828#L464-1 test_~tmp___2~0 := test_#t~nondet43;havoc test_#t~nondet43; 834#L474 assume 0 != test_~tmp___2~0; 848#L480-1 assume !(0 != ~pumpRunning~0); 817#L230 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret21, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 818#L288 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret20, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 826#L262-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret40, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 857#L207-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 878#L212-1 isHighWaterLevel_#t~ret40 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret40;havoc isHighWaterLevel_#t~ret40; 891#L407-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 918#L407-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 902#L413-1 processEnvironment__wrappee__methaneQuery_#t~ret20 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret20;havoc processEnvironment__wrappee__methaneQuery_#t~ret20; 903#L266-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 825#L237 havoc __utac_acc__Specification1_spec__1_#t~ret7, __utac_acc__Specification1_spec__1_#t~ret8, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 905#L167-3 __utac_acc__Specification1_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret7;havoc __utac_acc__Specification1_spec__1_#t~ret7; 865#L53 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 836#L53-1 [2021-07-06 20:13:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:13:56,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557057833] [2021-07-06 20:13:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,247 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,272 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1687938725, now seen corresponding path program 1 times [2021-07-06 20:13:56,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596504159] [2021-07-06 20:13:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:13:56,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:56,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:13:56,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,298 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:13:56,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:13:56,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596504159] [2021-07-06 20:13:56,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596504159] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:13:56,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:13:56,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-06 20:13:56,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78298531] [2021-07-06 20:13:56,299 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:13:56,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:13:56,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-06 20:13:56,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-06 20:13:56,301 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. cyclomatic complexity: 76 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:13:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:13:56,415 INFO L93 Difference]: Finished difference Result 567 states and 762 transitions. [2021-07-06 20:13:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 20:13:56,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 762 transitions. [2021-07-06 20:13:56,424 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 410 [2021-07-06 20:13:56,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 567 states and 762 transitions. [2021-07-06 20:13:56,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2021-07-06 20:13:56,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 567 [2021-07-06 20:13:56,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 567 states and 762 transitions. [2021-07-06 20:13:56,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:13:56,434 INFO L681 BuchiCegarLoop]: Abstraction has 567 states and 762 transitions. [2021-07-06 20:13:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states and 762 transitions. [2021-07-06 20:13:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 213. [2021-07-06 20:13:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 212 states have internal predecessors, (286), 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:13:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2021-07-06 20:13:56,466 INFO L704 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2021-07-06 20:13:56,466 INFO L587 BuchiCegarLoop]: Abstraction has 213 states and 286 transitions. [2021-07-06 20:13:56,466 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:13:56,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 286 transitions. [2021-07-06 20:13:56,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 150 [2021-07-06 20:13:56,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:56,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:56,470 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,470 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,470 INFO L791 eck$LassoCheckResult]: Stem: 1707#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 1597#L-1 havoc main_#res;havoc main_#t~ret80, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 1598#L105 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1639#L113 main_#t~ret80 := valid_product_#res;main_~tmp~9 := main_#t~ret80;havoc main_#t~ret80; 1672#L949 assume 0 != main_~tmp~9; 1613#L926 havoc test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1614#L53-1 [2021-07-06 20:13:56,471 INFO L793 eck$LassoCheckResult]: Loop: 1614#L53-1 assume !false; 1630#L445 assume test_~splverifierCounter~0 < 4; 1678#L446 test_~tmp~5 := test_#t~nondet41;havoc test_#t~nondet41; 1679#L454 assume !(0 != test_~tmp~5); 1611#L454-1 test_~tmp___0~2 := test_#t~nondet42;havoc test_#t~nondet42; 1779#L464 assume !(0 != test_~tmp___0~2); 1777#L464-1 test_~tmp___2~0 := test_#t~nondet43;havoc test_#t~nondet43; 1775#L474 assume 0 != test_~tmp___2~0; 1774#L480-1 assume !(0 != ~pumpRunning~0); 1595#L230 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret21, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1596#L288 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret20, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 1604#L262-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret40, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 1636#L207-1 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~4 := 0;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 1661#L212-1 isHighWaterLevel_#t~ret40 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret40;havoc isHighWaterLevel_#t~ret40; 1705#L407-3 assume !(0 != isHighWaterLevel_~tmp~4);isHighWaterLevel_~tmp___0~1 := 1; 1706#L407-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 1687#L413-1 processEnvironment__wrappee__methaneQuery_#t~ret20 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret20;havoc processEnvironment__wrappee__methaneQuery_#t~ret20; 1688#L266-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 1603#L237 havoc __utac_acc__Specification1_spec__1_#t~ret7, __utac_acc__Specification1_spec__1_#t~ret8, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 1691#L167-3 __utac_acc__Specification1_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret7;havoc __utac_acc__Specification1_spec__1_#t~ret7; 1645#L53 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 1614#L53-1 [2021-07-06 20:13:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:13:56,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420973162] [2021-07-06 20:13:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,533 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,579 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash 87068637, now seen corresponding path program 1 times [2021-07-06 20:13:56,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294468199] [2021-07-06 20:13:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:13:56,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,627 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-07-06 20:13:56,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:13:56,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:13:56,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:13:56,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:56,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:13:56,644 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:13:56,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:13:56,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294468199] [2021-07-06 20:13:56,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294468199] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:13:56,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:13:56,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:13:56,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235986483] [2021-07-06 20:13:56,646 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:13:56,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:13:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:13:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:13:56,647 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:13:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:13:56,758 INFO L93 Difference]: Finished difference Result 660 states and 880 transitions. [2021-07-06 20:13:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:13:56,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 880 transitions. [2021-07-06 20:13:56,762 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 484 [2021-07-06 20:13:56,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 880 transitions. [2021-07-06 20:13:56,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2021-07-06 20:13:56,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2021-07-06 20:13:56,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 880 transitions. [2021-07-06 20:13:56,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:13:56,767 INFO L681 BuchiCegarLoop]: Abstraction has 660 states and 880 transitions. [2021-07-06 20:13:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 880 transitions. [2021-07-06 20:13:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 231. [2021-07-06 20:13:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 231 states have (on average 1.316017316017316) internal successors, (304), 230 states have internal predecessors, (304), 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:13:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2021-07-06 20:13:56,784 INFO L704 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2021-07-06 20:13:56,790 INFO L587 BuchiCegarLoop]: Abstraction has 231 states and 304 transitions. [2021-07-06 20:13:56,790 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-07-06 20:13:56,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 304 transitions. [2021-07-06 20:13:56,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 162 [2021-07-06 20:13:56,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:13:56,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:13:56,793 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,793 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:13:56,793 INFO L791 eck$LassoCheckResult]: Stem: 2604#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 2486#L-1 havoc main_#res;havoc main_#t~ret80, main_~retValue_acc~11, main_~tmp~9;havoc main_~retValue_acc~11;havoc main_~tmp~9; 2487#L105 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 2528#L113 main_#t~ret80 := valid_product_#res;main_~tmp~9 := main_#t~ret80;havoc main_#t~ret80; 2563#L949 assume 0 != main_~tmp~9; 2502#L926 havoc test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2503#L53-1 [2021-07-06 20:13:56,794 INFO L793 eck$LassoCheckResult]: Loop: 2503#L53-1 assume !false; 2520#L445 assume test_~splverifierCounter~0 < 4; 2570#L446 test_~tmp~5 := test_#t~nondet41;havoc test_#t~nondet41; 2571#L454 assume !(0 != test_~tmp~5); 2497#L454-1 test_~tmp___0~2 := test_#t~nondet42;havoc test_#t~nondet42; 2609#L464 assume !(0 != test_~tmp___0~2); 2500#L464-1 test_~tmp___2~0 := test_#t~nondet43;havoc test_#t~nondet43; 2501#L474 assume 0 != test_~tmp___2~0; 2519#L480-1 assume !(0 != ~pumpRunning~0); 2482#L230 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret21, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 2483#L288 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret20, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 2490#L262-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret40, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 2525#L207-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 2550#L212-1 isHighWaterLevel_#t~ret40 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret40;havoc isHighWaterLevel_#t~ret40; 2566#L407-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 2605#L407-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 2580#L413-1 processEnvironment__wrappee__methaneQuery_#t~ret20 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret20;havoc processEnvironment__wrappee__methaneQuery_#t~ret20; 2581#L266-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 2595#L237 havoc __utac_acc__Specification1_spec__1_#t~ret7, __utac_acc__Specification1_spec__1_#t~ret8, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 2702#L167-3 __utac_acc__Specification1_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret7;havoc __utac_acc__Specification1_spec__1_#t~ret7; 2533#L53 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 2503#L53-1 [2021-07-06 20:13:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 5 times [2021-07-06 20:13:56,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100554878] [2021-07-06 20:13:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,832 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,862 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,871 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1926970201, now seen corresponding path program 1 times [2021-07-06 20:13:56,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69679855] [2021-07-06 20:13:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,877 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,879 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,882 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:13:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1911925901, now seen corresponding path program 1 times [2021-07-06 20:13:56,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:13:56,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341594310] [2021-07-06 20:13:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:13:56,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:13:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,918 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:13:56,953 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:13:56,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:13:57,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:13:57,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-06 20:14:37,003 WARN L205 SmtUtils]: Spent 39.88 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:14:37,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:14:37,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:14:56,658 WARN L205 SmtUtils]: Spent 19.57 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:14:56,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:14:56 BoogieIcfgContainer [2021-07-06 20:14:56,770 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:14:56,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:14:56,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:14:56,771 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:14:56,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:13:55" (3/4) ... [2021-07-06 20:14:56,773 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:14:56,820 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:14:56,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:14:56,821 INFO L168 Benchmark]: Toolchain (without parser) took 63241.62 ms. Allocated memory was 62.9 MB in the beginning and 113.2 MB in the end (delta: 50.3 MB). Free memory was 41.9 MB in the beginning and 23.7 MB in the end (delta: 18.1 MB). Peak memory consumption was 68.3 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,821 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 62.9 MB. Free memory is still 43.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:14:56,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.45 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 35.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.48 ms. Allocated memory is still 62.9 MB. Free memory was 35.7 MB in the beginning and 32.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,822 INFO L168 Benchmark]: Boogie Preprocessor took 66.03 ms. Allocated memory is still 62.9 MB. Free memory was 31.8 MB in the beginning and 29.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,823 INFO L168 Benchmark]: RCFGBuilder took 865.52 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 44.2 MB in the end (delta: -15.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,823 INFO L168 Benchmark]: BuchiAutomizer took 61663.88 ms. Allocated memory was 77.6 MB in the beginning and 113.2 MB in the end (delta: 35.7 MB). Free memory was 44.2 MB in the beginning and 25.8 MB in the end (delta: 18.4 MB). Peak memory consumption was 61.3 MB. Max. memory is 16.1 GB. [2021-07-06 20:14:56,823 INFO L168 Benchmark]: Witness Printer took 50.02 ms. Allocated memory is still 113.2 MB. Free memory was 25.8 MB in the beginning and 23.7 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:14:56,825 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.13 ms. Allocated memory is still 62.9 MB. Free memory is still 43.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 513.45 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 35.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.48 ms. Allocated memory is still 62.9 MB. Free memory was 35.7 MB in the beginning and 32.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.03 ms. Allocated memory is still 62.9 MB. Free memory was 31.8 MB in the beginning and 29.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 865.52 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 44.2 MB in the end (delta: -15.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 61663.88 ms. Allocated memory was 77.6 MB in the beginning and 113.2 MB in the end (delta: 35.7 MB). Free memory was 44.2 MB in the beginning and 25.8 MB in the end (delta: 18.4 MB). Peak memory consumption was 61.3 MB. Max. memory is 16.1 GB. * Witness Printer took 50.02 ms. Allocated memory is still 113.2 MB. Free memory was 25.8 MB in the beginning and 23.7 MB in the end (delta: 2.1 MB). There was no memory consumed. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 231 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 60.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 96.7ms AutomataMinimizationTime, 4 MinimizatonAttempts, 900 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 231 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 957 SDtfs, 1733 SDslu, 1855 SDs, 0 SdLazy, 224 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 298.5ms Time LassoAnalysisResults: nont1 unkn0 SFLI3 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: 444]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=20820} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=20820, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@308f595a=0, NULL=20823, NULL=20843, NULL=20829, methaneLevelCritical=0, tmp=0, NULL=0, NULL=20834, NULL=20821, NULL=0, retValue_acc=0, tmp___1=0, NULL=20832, NULL=0, NULL=20837, cleanupTimeShifts=4, NULL=20847, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9edf6c7=63, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e0d217d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1619a5ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74547e61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5627ef4d=0, waterLevel=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f45f536=0, \result=1, head=0, pumpRunning=0, NULL=20836, retValue_acc=1, NULL=0, NULL=0, tmp=0, \result=1, NULL=0, tmp=1, NULL=0, NULL=20826, NULL=0, NULL=0, NULL=0, NULL=0, tmp___0=0, NULL=20838, NULL=20825, tmp=0, head=0, tmp=0, tmp=1, NULL=20841, NULL=0, NULL=0, NULL=0, NULL=20842, NULL=20848, NULL=20828, NULL=20827, NULL=20835, tmp___0=0, NULL=0, NULL=0, NULL=0, tmp___0=0, NULL=20845, NULL=20839, NULL=0, NULL=0, NULL=0, systemActive=1, \result=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@551ed4c3=0, retValue_acc=0, NULL=20846, \result=0, NULL=0, NULL=20831, NULL=0, NULL=20824, NULL=0, NULL=20833, NULL=20822, retValue_acc=1, tmp___2=63, splverifierCounter=0, NULL=0, \result=0, NULL=20844, NULL=20840, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@628f5602=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bfd7435=0, NULL=0, NULL=0, NULL=20830} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L124] int waterLevel = 1; [L125] int methaneLevelCritical = 0; [L223] int pumpRunning = 0; [L224] int systemActive = 1; [L670] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L867] int cleanupTimeShifts = 4; [L940] int retValue_acc ; [L941] int tmp ; [L109] int retValue_acc ; [L112] retValue_acc = 1 [L113] return (retValue_acc); [L947] tmp = valid_product() [L949] COND TRUE \read(tmp) [L435] int splverifierCounter ; [L436] int tmp ; [L437] int tmp___0 ; [L438] int tmp___1 ; [L439] int tmp___2 ; [L442] splverifierCounter = 0 Loop: [L444] COND TRUE 1 [L446] COND TRUE splverifierCounter < 4 [L452] tmp = __VERIFIER_nondet_int() [L454] COND FALSE !(\read(tmp)) [L462] tmp___0 = __VERIFIER_nondet_int() [L464] COND FALSE !(\read(tmp___0)) [L472] tmp___2 = __VERIFIER_nondet_int() [L474] COND TRUE \read(tmp___2) [L230] COND FALSE !(\read(pumpRunning)) [L237] COND TRUE \read(systemActive) [L285] int tmp ; [L288] COND FALSE !(\read(pumpRunning)) [L259] int tmp ; [L262] COND TRUE ! pumpRunning [L399] int retValue_acc ; [L400] int tmp ; [L401] int tmp___0 ; [L204] int retValue_acc ; [L207] COND TRUE waterLevel < 2 [L208] retValue_acc = 1 [L209] return (retValue_acc); [L405] tmp = isHighWaterSensorDry() [L407] COND TRUE \read(tmp) [L408] tmp___0 = 0 [L412] retValue_acc = tmp___0 [L413] return (retValue_acc); [L264] tmp = isHighWaterLevel() [L266] COND FALSE !(\read(tmp)) [L46] int tmp ; [L47] int tmp___0 ; [L163] int retValue_acc ; [L166] retValue_acc = methaneLevelCritical [L167] return (retValue_acc); [L51] tmp = isMethaneLevelCritical() [L53] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:14:56,888 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...