./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product36.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_spec5_product36.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 b71d0221e52ad3170b58f60abcb38413b01772c1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:34:58,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:34:58,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:34:58,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:34:58,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:34:58,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:34:58,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:34:58,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:34:58,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:34:58,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:34:58,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:34:58,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:34:58,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:34:58,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:34:58,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:34:58,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:34:58,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:34:58,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:34:58,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:34:58,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:34:58,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:34:58,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:34:58,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:34:58,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:34:58,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:34:58,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:34:58,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:34:58,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:34:58,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:34:58,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:34:58,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:34:58,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:34:58,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:34:58,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:34:58,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:34:58,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:34:58,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:34:58,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:34:58,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:34:58,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:34:58,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:34:58,625 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:34:58,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:34:58,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:34:58,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:34:58,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:34:58,658 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:34:58,658 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:34:58,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:34:58,659 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:34:58,659 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:34:58,659 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:34:58,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:34:58,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:34:58,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:34:58,660 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:34:58,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:34:58,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:34:58,661 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:34:58,662 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:34:58,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:34:58,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:34:58,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:34:58,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:34:58,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:34:58,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:34:58,663 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:34:58,663 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 -> b71d0221e52ad3170b58f60abcb38413b01772c1 [2021-07-06 20:34:58,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:34:58,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:34:58,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:34:58,925 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:34:58,925 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:34:58,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product36.cil.c [2021-07-06 20:34:58,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ba7732/9669a9f7b70a4bc79b9076a129fc0e4b/FLAG62f29644f [2021-07-06 20:34:59,375 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:34:59,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product36.cil.c [2021-07-06 20:34:59,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ba7732/9669a9f7b70a4bc79b9076a129fc0e4b/FLAG62f29644f [2021-07-06 20:34:59,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ba7732/9669a9f7b70a4bc79b9076a129fc0e4b [2021-07-06 20:34:59,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:34:59,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:34:59,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:34:59,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:34:59,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:34:59,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39107e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59, skipping insertion in model container [2021-07-06 20:34:59,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:34:59,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:34:59,600 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_spec5_product36.cil.c[1817,1830] [2021-07-06 20:34:59,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:34:59,702 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:34:59,711 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_spec5_product36.cil.c[1817,1830] [2021-07-06 20:34:59,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:34:59,767 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:34:59,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59 WrapperNode [2021-07-06 20:34:59,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:34:59,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:34:59,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:34:59,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:34:59,774 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:34:59" (1/1) ... [2021-07-06 20:34:59,797 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:34:59" (1/1) ... [2021-07-06 20:34:59,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:34:59,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:34:59,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:34:59,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:34:59,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:34:59,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:34:59,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:34:59,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:34:59,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (1/1) ... [2021-07-06 20:34:59,864 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:34:59,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:34:59,889 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:34:59,912 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:34:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:34:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:34:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:34:59,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:35:00,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:35:00,480 INFO L299 CfgBuilder]: Removed 116 assume(true) statements. [2021-07-06 20:35:00,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:35:00 BoogieIcfgContainer [2021-07-06 20:35:00,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:35:00,482 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:35:00,482 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:35:00,484 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:35:00,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:35:00,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:34:59" (1/3) ... [2021-07-06 20:35:00,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6eac19e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:35:00, skipping insertion in model container [2021-07-06 20:35:00,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:35:00,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:34:59" (2/3) ... [2021-07-06 20:35:00,486 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6eac19e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:35:00, skipping insertion in model container [2021-07-06 20:35:00,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:35:00,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:35:00" (3/3) ... [2021-07-06 20:35:00,486 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product36.cil.c [2021-07-06 20:35:00,516 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:35:00,517 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:35:00,517 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:35:00,517 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:35:00,517 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:35:00,517 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:35:00,517 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:35:00,517 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:35:00,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 86 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 85 states have internal predecessors, (129), 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:35:00,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2021-07-06 20:35:00,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:35:00,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:35:00,554 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:00,555 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:35:00,555 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:35:00,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 86 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 85 states have internal predecessors, (129), 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:35:00,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2021-07-06 20:35:00,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:35:00,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:35:00,569 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:00,569 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:35:00,576 INFO L791 eck$LassoCheckResult]: Stem: 42#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(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(13);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string73.base, #t~string73.offset, 1);call write~init~int(77, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(101, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(116, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(104, #t~string73.base, 4 + #t~string73.offset, 1);call write~init~int(58, #t~string73.base, 5 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 6 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string75.base, #t~string75.offset, 1);call write~init~int(82, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(84, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string77.base, #t~string77.offset, 1);call write~init~int(75, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string79.base, #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 1 + #t~string79.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 22#L-1true havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 69#L67true 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; 80#L75true main_#t~ret66 := valid_product_#res;main_~tmp~6 := main_#t~ret66;havoc main_#t~ret66; 51#L802true assume 0 != main_~tmp~6; 62#L777true ~switchedOnBeforeTS~0 := 0; 38#L823true havoc test_#t~nondet62, test_#t~nondet63, test_#t~nondet64, test_#t~nondet65, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 15#L844-1true [2021-07-06 20:35:00,577 INFO L793 eck$LassoCheckResult]: Loop: 15#L844-1true assume !false; 60#L660true assume test_~splverifierCounter~0 < 4; 18#L661true test_~tmp~5 := test_#t~nondet62;havoc test_#t~nondet62; 24#L669true assume !(0 != test_~tmp~5); 27#L669-1true test_~tmp___0~1 := test_#t~nondet63;havoc test_#t~nondet63; 83#L679true assume !(0 != test_~tmp___0~1); 86#L679-1true test_~tmp___2~0 := test_#t~nondet64;havoc test_#t~nondet64; 68#L689true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 75#L697-1true havoc __utac_acc__Specification5_spec__2_#t~ret67;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 6#L197true __utac_acc__Specification5_spec__2_#t~ret67 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret67;havoc __utac_acc__Specification5_spec__2_#t~ret67; 12#L833true assume !(0 != ~pumpRunning~0); 74#L112true assume !(0 != ~systemActive~0); 85#L119true havoc __utac_acc__Specification5_spec__3_#t~ret68, __utac_acc__Specification5_spec__3_#t~ret69, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 50#L941true __utac_acc__Specification5_spec__3_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret68;havoc __utac_acc__Specification5_spec__3_#t~ret68; 10#L844true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 15#L844-1true [2021-07-06 20:35:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2021-07-06 20:35:00,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:00,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753271249] [2021-07-06 20:35:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:00,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:00,740 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:00,790 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:00,811 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 675287606, now seen corresponding path program 1 times [2021-07-06 20:35:00,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:00,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503404129] [2021-07-06 20:35:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:00,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:35:00,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:00,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:35:00,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:00,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:35:00,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:00,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:35:00,853 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:35:00,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:35:00,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503404129] [2021-07-06 20:35:00,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503404129] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:35:00,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:35:00,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:35:00,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209336917] [2021-07-06 20:35:00,859 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:35:00,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:35:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:35:00,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:35:00,877 INFO L87 Difference]: Start difference. First operand has 86 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 85 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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:35:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:35:00,945 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2021-07-06 20:35:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:35:00,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 233 transitions. [2021-07-06 20:35:00,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 106 [2021-07-06 20:35:00,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 151 states and 218 transitions. [2021-07-06 20:35:00,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2021-07-06 20:35:00,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2021-07-06 20:35:00,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 218 transitions. [2021-07-06 20:35:00,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:35:00,962 INFO L681 BuchiCegarLoop]: Abstraction has 151 states and 218 transitions. [2021-07-06 20:35:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 218 transitions. [2021-07-06 20:35:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2021-07-06 20:35:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.4429530201342282) internal successors, (215), 148 states have internal predecessors, (215), 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:35:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 215 transitions. [2021-07-06 20:35:00,992 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 215 transitions. [2021-07-06 20:35:00,992 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 215 transitions. [2021-07-06 20:35:00,992 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:35:00,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 215 transitions. [2021-07-06 20:35:00,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2021-07-06 20:35:00,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:35:00,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:35:00,995 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:00,996 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:00,996 INFO L791 eck$LassoCheckResult]: Stem: 314#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(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(13);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string73.base, #t~string73.offset, 1);call write~init~int(77, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(101, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(116, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(104, #t~string73.base, 4 + #t~string73.offset, 1);call write~init~int(58, #t~string73.base, 5 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 6 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string75.base, #t~string75.offset, 1);call write~init~int(82, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(84, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string77.base, #t~string77.offset, 1);call write~init~int(75, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string79.base, #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 1 + #t~string79.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 294#L-1 havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 295#L67 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; 339#L75 main_#t~ret66 := valid_product_#res;main_~tmp~6 := main_#t~ret66;havoc main_#t~ret66; 325#L802 assume 0 != main_~tmp~6; 326#L777 ~switchedOnBeforeTS~0 := 0; 310#L823 havoc test_#t~nondet62, test_#t~nondet63, test_#t~nondet64, test_#t~nondet65, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 276#L844-1 [2021-07-06 20:35:00,996 INFO L793 eck$LassoCheckResult]: Loop: 276#L844-1 assume !false; 283#L660 assume test_~splverifierCounter~0 < 4; 287#L661 test_~tmp~5 := test_#t~nondet62;havoc test_#t~nondet62; 288#L669 assume !(0 != test_~tmp~5); 298#L669-1 test_~tmp___0~1 := test_#t~nondet63;havoc test_#t~nondet63; 301#L679 assume !(0 != test_~tmp___0~1); 312#L679-1 test_~tmp___2~0 := test_#t~nondet64;havoc test_#t~nondet64; 336#L689 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 338#L697-1 havoc __utac_acc__Specification5_spec__2_#t~ret67;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 264#L197 __utac_acc__Specification5_spec__2_#t~ret67 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret67;havoc __utac_acc__Specification5_spec__2_#t~ret67; 265#L833 assume !(0 != ~pumpRunning~0); 281#L112 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 321#L144 assume !(0 == ~pumpRunning~0); 322#L119 havoc __utac_acc__Specification5_spec__3_#t~ret68, __utac_acc__Specification5_spec__3_#t~ret69, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 324#L941 __utac_acc__Specification5_spec__3_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret68;havoc __utac_acc__Specification5_spec__3_#t~ret68; 275#L844 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 276#L844-1 [2021-07-06 20:35:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2021-07-06 20:35:00,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:00,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299475273] [2021-07-06 20:35:00,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:00,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,050 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,097 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,118 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash -572531389, now seen corresponding path program 1 times [2021-07-06 20:35:01,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768467169] [2021-07-06 20:35:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:35:01,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:35:01,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:35:01,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:35:01,149 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:35:01,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:35:01,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768467169] [2021-07-06 20:35:01,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768467169] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:35:01,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:35:01,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:35:01,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824181402] [2021-07-06 20:35:01,150 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:35:01,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:35:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:35:01,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:35:01,150 INFO L87 Difference]: Start difference. First operand 149 states and 215 transitions. cyclomatic complexity: 69 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:35:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:35:01,213 INFO L93 Difference]: Finished difference Result 248 states and 343 transitions. [2021-07-06 20:35:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:35:01,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 343 transitions. [2021-07-06 20:35:01,215 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 179 [2021-07-06 20:35:01,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 248 states and 343 transitions. [2021-07-06 20:35:01,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2021-07-06 20:35:01,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2021-07-06 20:35:01,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 343 transitions. [2021-07-06 20:35:01,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:35:01,221 INFO L681 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2021-07-06 20:35:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 343 transitions. [2021-07-06 20:35:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-07-06 20:35:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 248 states have (on average 1.3830645161290323) internal successors, (343), 247 states have internal predecessors, (343), 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:35:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 343 transitions. [2021-07-06 20:35:01,228 INFO L704 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2021-07-06 20:35:01,228 INFO L587 BuchiCegarLoop]: Abstraction has 248 states and 343 transitions. [2021-07-06 20:35:01,229 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:35:01,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 343 transitions. [2021-07-06 20:35:01,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 179 [2021-07-06 20:35:01,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:35:01,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:35:01,233 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:01,233 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:01,233 INFO L791 eck$LassoCheckResult]: Stem: 714#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(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(13);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string73.base, #t~string73.offset, 1);call write~init~int(77, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(101, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(116, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(104, #t~string73.base, 4 + #t~string73.offset, 1);call write~init~int(58, #t~string73.base, 5 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 6 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string75.base, #t~string75.offset, 1);call write~init~int(82, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(84, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string77.base, #t~string77.offset, 1);call write~init~int(75, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string79.base, #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 1 + #t~string79.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 694#L-1 havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 695#L67 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; 752#L75 main_#t~ret66 := valid_product_#res;main_~tmp~6 := main_#t~ret66;havoc main_#t~ret66; 727#L802 assume 0 != main_~tmp~6; 728#L777 ~switchedOnBeforeTS~0 := 0; 709#L823 havoc test_#t~nondet62, test_#t~nondet63, test_#t~nondet64, test_#t~nondet65, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 710#L844-1 [2021-07-06 20:35:01,233 INFO L793 eck$LassoCheckResult]: Loop: 710#L844-1 assume !false; 862#L660 assume test_~splverifierCounter~0 < 4; 775#L661 test_~tmp~5 := test_#t~nondet62;havoc test_#t~nondet62; 774#L669 assume !(0 != test_~tmp~5); 772#L669-1 test_~tmp___0~1 := test_#t~nondet63;havoc test_#t~nondet63; 769#L679 assume !(0 != test_~tmp___0~1); 765#L679-1 test_~tmp___2~0 := test_#t~nondet64;havoc test_#t~nondet64; 762#L689 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 757#L697-1 havoc __utac_acc__Specification5_spec__2_#t~ret67;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 670#L197 __utac_acc__Specification5_spec__2_#t~ret67 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret67;havoc __utac_acc__Specification5_spec__2_#t~ret67; 671#L833 assume !(0 != ~pumpRunning~0); 684#L112 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 721#L144 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret26, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~1, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~1;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 722#L949 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 861#L954 isHighWaterLevel_#t~ret26 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~1 := isHighWaterLevel_#t~ret26;havoc isHighWaterLevel_#t~ret26; 855#L246 assume 0 != isHighWaterLevel_~tmp~1;isHighWaterLevel_~tmp___0~0 := 0; 852#L246-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 851#L252 processEnvironment_#t~ret8 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret8;havoc processEnvironment_#t~ret8; 848#L148 assume !(0 != processEnvironment_~tmp~0); 849#L119 havoc __utac_acc__Specification5_spec__3_#t~ret68, __utac_acc__Specification5_spec__3_#t~ret69, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 895#L941 __utac_acc__Specification5_spec__3_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret68;havoc __utac_acc__Specification5_spec__3_#t~ret68; 864#L844 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~7); 710#L844-1 [2021-07-06 20:35:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2021-07-06 20:35:01,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985471430] [2021-07-06 20:35:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,260 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,284 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash -535419313, now seen corresponding path program 1 times [2021-07-06 20:35:01,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435908284] [2021-07-06 20:35:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:35:01,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:35:01,321 INFO L142 QuantifierPusher]: treesize reduction 17, result has 19.0 percent of original size [2021-07-06 20:35:01,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:35:01,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:35:01,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:35:01,333 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:35:01,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:35:01,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435908284] [2021-07-06 20:35:01,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435908284] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:35:01,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:35:01,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-06 20:35:01,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246979640] [2021-07-06 20:35:01,334 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:35:01,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:35:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:35:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:35:01,335 INFO L87 Difference]: Start difference. First operand 248 states and 343 transitions. cyclomatic complexity: 98 Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:35:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:35:01,478 INFO L93 Difference]: Finished difference Result 923 states and 1283 transitions. [2021-07-06 20:35:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:35:01,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 923 states and 1283 transitions. [2021-07-06 20:35:01,485 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 662 [2021-07-06 20:35:01,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 923 states to 923 states and 1283 transitions. [2021-07-06 20:35:01,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 923 [2021-07-06 20:35:01,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 923 [2021-07-06 20:35:01,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 923 states and 1283 transitions. [2021-07-06 20:35:01,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:35:01,493 INFO L681 BuchiCegarLoop]: Abstraction has 923 states and 1283 transitions. [2021-07-06 20:35:01,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states and 1283 transitions. [2021-07-06 20:35:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 483. [2021-07-06 20:35:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 483 states have (on average 1.3561076604554865) internal successors, (655), 482 states have internal predecessors, (655), 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:35:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 655 transitions. [2021-07-06 20:35:01,506 INFO L704 BuchiCegarLoop]: Abstraction has 483 states and 655 transitions. [2021-07-06 20:35:01,506 INFO L587 BuchiCegarLoop]: Abstraction has 483 states and 655 transitions. [2021-07-06 20:35:01,507 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:35:01,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 483 states and 655 transitions. [2021-07-06 20:35:01,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 354 [2021-07-06 20:35:01,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:35:01,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:35:01,509 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:01,509 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:35:01,509 INFO L791 eck$LassoCheckResult]: Stem: 1912#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(3);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(110, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 2 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(102, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 3 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string17.base, #t~string17.offset, 1);call write~init~int(80, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(117, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(109, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(112, #t~string17.base, 4 + #t~string17.offset, 1);call write~init~int(58, #t~string17.base, 5 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 6 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(110, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string21.base, #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(102, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string23.base, #t~string23.offset, 1);call write~init~int(32, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string25.base, #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 1 + #t~string25.offset, 1);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(30);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(9);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(21);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(25);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(13);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string73.base, #t~string73.offset, 1);call write~init~int(77, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(101, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(116, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(104, #t~string73.base, 4 + #t~string73.offset, 1);call write~init~int(58, #t~string73.base, 5 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 6 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string75.base, #t~string75.offset, 1);call write~init~int(82, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(84, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string77.base, #t~string77.offset, 1);call write~init~int(75, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string79.base, #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 1 + #t~string79.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1886#L-1 havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 1887#L67 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; 1954#L75 main_#t~ret66 := valid_product_#res;main_~tmp~6 := main_#t~ret66;havoc main_#t~ret66; 1923#L802 assume 0 != main_~tmp~6; 1924#L777 ~switchedOnBeforeTS~0 := 0; 1907#L823 havoc test_#t~nondet62, test_#t~nondet63, test_#t~nondet64, test_#t~nondet65, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1908#L844-1 [2021-07-06 20:35:01,510 INFO L793 eck$LassoCheckResult]: Loop: 1908#L844-1 assume !false; 2118#L660 assume test_~splverifierCounter~0 < 4; 2117#L661 test_~tmp~5 := test_#t~nondet62;havoc test_#t~nondet62; 2116#L669 assume !(0 != test_~tmp~5); 2114#L669-1 test_~tmp___0~1 := test_#t~nondet63;havoc test_#t~nondet63; 2113#L679 assume !(0 != test_~tmp___0~1); 2111#L679-1 test_~tmp___2~0 := test_#t~nondet64;havoc test_#t~nondet64; 2110#L689 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2080#L697-1 havoc __utac_acc__Specification5_spec__2_#t~ret67;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 2164#L197 __utac_acc__Specification5_spec__2_#t~ret67 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret67;havoc __utac_acc__Specification5_spec__2_#t~ret67; 1874#L833 assume !(0 != ~pumpRunning~0); 1875#L112 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 1919#L144 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret26, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~1, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~1;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 1920#L949 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 1902#L954 isHighWaterLevel_#t~ret26 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~1 := isHighWaterLevel_#t~ret26;havoc isHighWaterLevel_#t~ret26; 1903#L246 assume 0 != isHighWaterLevel_~tmp~1;isHighWaterLevel_~tmp___0~0 := 0; 1911#L246-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 1866#L252 processEnvironment_#t~ret8 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret8;havoc processEnvironment_#t~ret8; 1867#L148 assume !(0 != processEnvironment_~tmp~0); 1939#L119 havoc __utac_acc__Specification5_spec__3_#t~ret68, __utac_acc__Specification5_spec__3_#t~ret69, __utac_acc__Specification5_spec__3_~tmp~7, __utac_acc__Specification5_spec__3_~tmp___0~2;havoc __utac_acc__Specification5_spec__3_~tmp~7;havoc __utac_acc__Specification5_spec__3_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 2123#L941 __utac_acc__Specification5_spec__3_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~7 := __utac_acc__Specification5_spec__3_#t~ret68;havoc __utac_acc__Specification5_spec__3_#t~ret68; 2122#L844 assume 2 != __utac_acc__Specification5_spec__3_~tmp~7;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~3;havoc isPumpRunning_~retValue_acc~3;isPumpRunning_~retValue_acc~3 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~3; 2121#L197-1 __utac_acc__Specification5_spec__3_#t~ret69 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~2 := __utac_acc__Specification5_spec__3_#t~ret69;havoc __utac_acc__Specification5_spec__3_#t~ret69; 2120#L848 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~2); 1908#L844-1 [2021-07-06 20:35:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2021-07-06 20:35:01,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519658140] [2021-07-06 20:35:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,528 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,544 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,550 INFO L82 PathProgramCache]: Analyzing trace with hash 858102058, now seen corresponding path program 1 times [2021-07-06 20:35:01,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614256630] [2021-07-06 20:35:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,570 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,573 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:35:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash 717508720, now seen corresponding path program 1 times [2021-07-06 20:35:01,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:35:01,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128013358] [2021-07-06 20:35:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:35:01,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:35:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,598 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:35:01,614 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:35:01,624 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:35:01,730 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-07-06 20:35:01,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:01,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-06 20:35:40,454 WARN L205 SmtUtils]: Spent 38.64 s on a formula simplification. DAG size of input: 495 DAG size of output: 437 [2021-07-06 20:35:40,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:35:40,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2130 [2021-07-06 20:36:00,233 WARN L205 SmtUtils]: Spent 19.72 s on a formula simplification that was a NOOP. DAG size: 435 [2021-07-06 20:36:00,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:36:00 BoogieIcfgContainer [2021-07-06 20:36:00,361 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:36:00,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:36:00,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:36:00,362 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:36:00,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:35:00" (3/4) ... [2021-07-06 20:36:00,364 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:36:00,421 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:36:00,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:36:00,429 INFO L168 Benchmark]: Toolchain (without parser) took 61022.86 ms. Allocated memory was 54.5 MB in the beginning and 100.7 MB in the end (delta: 46.1 MB). Free memory was 31.3 MB in the beginning and 21.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 55.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,429 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 54.5 MB. Free memory is still 36.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:36:00,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.89 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.1 MB in the beginning and 40.2 MB in the end (delta: -9.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.00 ms. Allocated memory is still 67.1 MB. Free memory was 40.2 MB in the beginning and 37.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,431 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 67.1 MB. Free memory was 37.2 MB in the beginning and 49.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,431 INFO L168 Benchmark]: RCFGBuilder took 622.86 ms. Allocated memory is still 67.1 MB. Free memory was 49.3 MB in the beginning and 35.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,431 INFO L168 Benchmark]: BuchiAutomizer took 59879.01 ms. Allocated memory was 67.1 MB in the beginning and 100.7 MB in the end (delta: 33.6 MB). Free memory was 35.1 MB in the beginning and 24.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,431 INFO L168 Benchmark]: Witness Printer took 62.17 ms. Allocated memory is still 100.7 MB. Free memory was 24.5 MB in the beginning and 21.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:36:00,434 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.09 ms. Allocated memory is still 54.5 MB. Free memory is still 36.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 364.89 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.1 MB in the beginning and 40.2 MB in the end (delta: -9.1 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.00 ms. Allocated memory is still 67.1 MB. Free memory was 40.2 MB in the beginning and 37.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 67.1 MB. Free memory was 37.2 MB in the beginning and 49.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 622.86 ms. Allocated memory is still 67.1 MB. Free memory was 49.3 MB in the beginning and 35.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 59879.01 ms. Allocated memory was 67.1 MB in the beginning and 100.7 MB in the end (delta: 33.6 MB). Free memory was 35.1 MB in the beginning and 24.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. * Witness Printer took 62.17 ms. Allocated memory is still 100.7 MB. Free memory was 24.5 MB in the beginning and 21.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 483 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 59.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 41.4ms AutomataMinimizationTime, 3 MinimizatonAttempts, 442 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 483 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 404 SDtfs, 684 SDslu, 647 SDs, 0 SdLazy, 136 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.6ms Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 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: 659]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=29700} State at position 1 is {NULL=0, NULL=29712, NULL=0, retValue_acc=1, NULL=29700, NULL=29701, NULL=29716, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f0b5ba6=0, NULL=29722, NULL=29705, methaneLevelCritical=0, retValue_acc=0, tmp=0, tmp___1=0, NULL=29728, NULL=0, cleanupTimeShifts=4, NULL=29710, NULL=29726, NULL=0, waterLevel=1, NULL=29723, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64514e0=0, NULL=0, \result=1, head=0, pumpRunning=0, NULL=29720, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@413e1e5b=0, tmp=1, \result=1, NULL=0, NULL=0, NULL=0, NULL=29724, tmp=1, NULL=0, NULL=0, tmp___0=0, NULL=29721, tmp=0, NULL=29718, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@779fe076=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b4e509e=0, head=0, NULL=29708, NULL=29702, NULL=0, retValue_acc=0, NULL=29714, tmp=1, tmp___0=0, NULL=0, switchedOnBeforeTS=0, NULL=29713, NULL=29727, \result=0, NULL=0, NULL=0, NULL=0, systemActive=1, \result=1, \result=0, NULL=29725, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68fca8e0=0, NULL=29707, tmp___0=0, NULL=29711, \result=0, NULL=29706, NULL=0, NULL=0, NULL=0, NULL=29719, NULL=29717, NULL=29703, retValue_acc=1, tmp___2=65, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=0, NULL=29704, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df26582=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47c69799=65, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75b9f3a9=0, NULL=29709, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39d3c90f=0, NULL=0, NULL=0, NULL=29715, NULL=0, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L100] int pumpRunning = 0; [L101] int systemActive = 1; [L449] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L718] int cleanupTimeShifts = 4; [L817] int switchedOnBeforeTS ; [L866] int waterLevel = 1; [L867] int methaneLevelCritical = 0; [L793] int retValue_acc ; [L794] int tmp ; [L71] int retValue_acc ; [L74] retValue_acc = 1 [L75] return (retValue_acc); [L800] tmp = valid_product() [L802] COND TRUE \read(tmp) [L822] switchedOnBeforeTS = 0 [L650] int splverifierCounter ; [L651] int tmp ; [L652] int tmp___0 ; [L653] int tmp___1 ; [L654] int tmp___2 ; [L657] splverifierCounter = 0 Loop: [L659] COND TRUE 1 [L661] COND TRUE splverifierCounter < 4 [L667] tmp = __VERIFIER_nondet_int() [L669] COND FALSE !(\read(tmp)) [L677] tmp___0 = __VERIFIER_nondet_int() [L679] COND FALSE !(\read(tmp___0)) [L687] tmp___2 = __VERIFIER_nondet_int() [L689] COND TRUE \read(tmp___2) [L275] systemActive = 1 [L193] int retValue_acc ; [L196] retValue_acc = pumpRunning [L197] return (retValue_acc); [L831] switchedOnBeforeTS = isPumpRunning() [L112] COND FALSE !(\read(pumpRunning)) [L119] COND TRUE \read(systemActive) [L141] int tmp ; [L144] COND TRUE ! pumpRunning [L238] int retValue_acc ; [L239] int tmp ; [L240] int tmp___0 ; [L946] int retValue_acc ; [L949] COND TRUE waterLevel < 2 [L950] retValue_acc = 1 [L951] return (retValue_acc); [L244] tmp = isHighWaterSensorDry() [L246] COND TRUE \read(tmp) [L247] tmp___0 = 0 [L251] retValue_acc = tmp___0 [L252] return (retValue_acc); [L146] tmp = isHighWaterLevel() [L148] COND FALSE !(\read(tmp)) [L837] int tmp ; [L838] int tmp___0 ; [L937] int retValue_acc ; [L940] retValue_acc = waterLevel [L941] return (retValue_acc); [L842] tmp = getWaterLevel() [L844] COND TRUE tmp != 2 [L193] int retValue_acc ; [L196] retValue_acc = pumpRunning [L197] return (retValue_acc); [L846] tmp___0 = isPumpRunning() [L848] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:36:00,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...