./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product42.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 7e359c3e690bc34b8e145f12f51e57f299b8b0bc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:55,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:24:55,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:24:55,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:24:55,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:24:55,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:24:55,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:24:55,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:24:55,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:24:55,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:24:55,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:24:55,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:24:55,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:24:55,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:24:55,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:24:55,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:24:55,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:24:55,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:24:55,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:24:55,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:24:55,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:24:55,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:24:55,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:24:55,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:24:55,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:24:55,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:24:55,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:24:55,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:24:55,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:24:55,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:24:55,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:24:55,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:24:55,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:24:55,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:24:55,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:24:55,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:24:55,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:24:55,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:24:55,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:24:55,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:24:55,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:24:55,847 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:24:55,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:24:55,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:24:55,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:24:55,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:24:55,887 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:24:55,888 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:24:55,888 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:24:55,888 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:24:55,889 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:24:55,889 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:24:55,890 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:24:55,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:24:55,890 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:24:55,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:24:55,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:24:55,891 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:24:55,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:24:55,892 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:24:55,892 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:24:55,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:24:55,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:24:55,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:24:55,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:24:55,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:24:55,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:24:55,894 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:24:55,895 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 -> 7e359c3e690bc34b8e145f12f51e57f299b8b0bc [2021-07-06 20:24:56,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:24:56,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:24:56,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:24:56,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:24:56,211 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:24:56,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2021-07-06 20:24:56,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746c25c57/088ac67e24104eeca62340be41a41812/FLAGb39838d2f [2021-07-06 20:24:56,794 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:24:56,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2021-07-06 20:24:56,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746c25c57/088ac67e24104eeca62340be41a41812/FLAGb39838d2f [2021-07-06 20:24:57,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746c25c57/088ac67e24104eeca62340be41a41812 [2021-07-06 20:24:57,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:24:57,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:24:57,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:57,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:24:57,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:24:57,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ff0cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57, skipping insertion in model container [2021-07-06 20:24:57,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:24:57,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:24:57,536 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c[7153,7166] [2021-07-06 20:24:57,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:57,632 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:24:57,677 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c[7153,7166] [2021-07-06 20:24:57,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:57,746 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:24:57,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57 WrapperNode [2021-07-06 20:24:57,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:57,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:57,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:24:57,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:24:57,756 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:24:57" (1/1) ... [2021-07-06 20:24:57,778 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:24:57" (1/1) ... [2021-07-06 20:24:57,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:57,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:24:57,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:24:57,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:24:57,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:24:57,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:24:57,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:24:57,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:24:57,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (1/1) ... [2021-07-06 20:24:57,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:24:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:24:57,954 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:24:57,964 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:24:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:24:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:24:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:24:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:24:58,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:24:58,766 INFO L299 CfgBuilder]: Removed 122 assume(true) statements. [2021-07-06 20:24:58,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:58 BoogieIcfgContainer [2021-07-06 20:24:58,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:24:58,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:24:58,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:24:58,771 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:24:58,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:58,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:24:57" (1/3) ... [2021-07-06 20:24:58,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63c24d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:58, skipping insertion in model container [2021-07-06 20:24:58,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:58,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:57" (2/3) ... [2021-07-06 20:24:58,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63c24d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:58, skipping insertion in model container [2021-07-06 20:24:58,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:58,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:58" (3/3) ... [2021-07-06 20:24:58,775 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product42.cil.c [2021-07-06 20:24:58,803 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:24:58,803 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:24:58,803 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:24:58,804 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:24:58,804 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:24:58,804 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:24:58,804 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:24:58,804 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:24:58,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 90 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 89 states have internal predecessors, (135), 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:24:58,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-07-06 20:24:58,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:58,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:58,841 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:58,842 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:58,842 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:24:58,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 90 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 89 states have internal predecessors, (135), 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:24:58,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2021-07-06 20:24:58,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:58,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:58,852 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:58,852 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:58,862 INFO L791 eck$LassoCheckResult]: Stem: 26#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~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(13);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string35.base, #t~string35.offset, 1);call write~init~int(77, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(101, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(116, #t~string35.base, 3 + #t~string35.offset, 1);call write~init~int(104, #t~string35.base, 4 + #t~string35.offset, 1);call write~init~int(58, #t~string35.base, 5 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 6 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string37.base, #t~string37.offset, 1);call write~init~int(82, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(73, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(84, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 4 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string39.base, #t~string39.offset, 1);call write~init~int(75, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 2 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string41.base, #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 1 + #t~string41.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 12#L-1true havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 4#L526true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 22#L534true main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 37#L132true assume 0 != main_~tmp~0; 77#L105true havoc test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 73#L920-1true [2021-07-06 20:24:58,862 INFO L793 eck$LassoCheckResult]: Loop: 73#L920-1true assume !false; 23#L158true assume test_~splverifierCounter~0 < 4; 79#L159true test_~tmp~1 := test_#t~nondet8;havoc test_#t~nondet8; 74#L167true assume !(0 != test_~tmp~1); 72#L167-1true test_~tmp___0~0 := test_#t~nondet9;havoc test_#t~nondet9; 46#L177true assume !(0 != test_~tmp___0~0); 42#L177-1true test_~tmp___2~0 := test_#t~nondet10;havoc test_#t~nondet10; 19#L187true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 59#L195-2true assume !(0 != ~pumpRunning~0); 68#L229true assume !(0 != ~systemActive~0); 85#L236true havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 63#L444-1true __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 13#L914true assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 73#L920-1true [2021-07-06 20:24:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:24:58,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:58,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309760549] [2021-07-06 20:24:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:58,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,106 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,216 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,253 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1680236938, now seen corresponding path program 1 times [2021-07-06 20:24:59,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676255970] [2021-07-06 20:24:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:59,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:59,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:59,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:59,320 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:24:59,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:59,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676255970] [2021-07-06 20:24:59,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676255970] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:59,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:59,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:59,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691237055] [2021-07-06 20:24:59,326 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:24:59,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:24:59,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:24:59,337 INFO L87 Difference]: Start difference. First operand has 90 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 89 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:24:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:59,375 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2021-07-06 20:24:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:24:59,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 125 transitions. [2021-07-06 20:24:59,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2021-07-06 20:24:59,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 83 states and 117 transitions. [2021-07-06 20:24:59,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-07-06 20:24:59,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-07-06 20:24:59,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 117 transitions. [2021-07-06 20:24:59,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:59,394 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 117 transitions. [2021-07-06 20:24:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 117 transitions. [2021-07-06 20:24:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-07-06 20:24:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 82 states have internal predecessors, (117), 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:24:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2021-07-06 20:24:59,414 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 117 transitions. [2021-07-06 20:24:59,414 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 117 transitions. [2021-07-06 20:24:59,414 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:24:59,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 117 transitions. [2021-07-06 20:24:59,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2021-07-06 20:24:59,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:59,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:59,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:59,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:59,417 INFO L791 eck$LassoCheckResult]: Stem: 231#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~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(13);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string35.base, #t~string35.offset, 1);call write~init~int(77, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(101, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(116, #t~string35.base, 3 + #t~string35.offset, 1);call write~init~int(104, #t~string35.base, 4 + #t~string35.offset, 1);call write~init~int(58, #t~string35.base, 5 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 6 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string37.base, #t~string37.offset, 1);call write~init~int(82, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(73, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(84, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 4 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string39.base, #t~string39.offset, 1);call write~init~int(75, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 2 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string41.base, #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 1 + #t~string41.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 208#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 194#L526 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 195#L534 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 225#L132 assume 0 != main_~tmp~0; 240#L105 havoc test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 210#L920-1 [2021-07-06 20:24:59,418 INFO L793 eck$LassoCheckResult]: Loop: 210#L920-1 assume !false; 226#L158 assume test_~splverifierCounter~0 < 4; 227#L159 test_~tmp~1 := test_#t~nondet8;havoc test_#t~nondet8; 271#L167 assume !(0 != test_~tmp~1); 270#L167-1 test_~tmp___0~0 := test_#t~nondet9;havoc test_#t~nondet9; 258#L177 assume !(0 != test_~tmp___0~0); 218#L177-1 test_~tmp___2~0 := test_#t~nondet10;havoc test_#t~nondet10; 220#L187 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 221#L195-2 assume !(0 != ~pumpRunning~0); 260#L229 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret12, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 244#L261 assume !(0 == ~pumpRunning~0); 245#L236 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 266#L444-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 209#L914 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 210#L920-1 [2021-07-06 20:24:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:24:59,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148603575] [2021-07-06 20:24:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,452 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,510 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,520 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash -589506386, now seen corresponding path program 1 times [2021-07-06 20:24:59,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470491792] [2021-07-06 20:24:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:59,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:59,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:59,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:59,542 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:24:59,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:59,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470491792] [2021-07-06 20:24:59,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470491792] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:59,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:59,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:59,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966534134] [2021-07-06 20:24:59,544 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:24:59,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:24:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:24:59,545 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:24:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:59,613 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2021-07-06 20:24:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:24:59,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 177 transitions. [2021-07-06 20:24:59,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2021-07-06 20:24:59,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 177 transitions. [2021-07-06 20:24:59,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2021-07-06 20:24:59,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2021-07-06 20:24:59,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 177 transitions. [2021-07-06 20:24:59,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:59,619 INFO L681 BuchiCegarLoop]: Abstraction has 130 states and 177 transitions. [2021-07-06 20:24:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 177 transitions. [2021-07-06 20:24:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-07-06 20:24:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 129 states have internal predecessors, (177), 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:24:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2021-07-06 20:24:59,626 INFO L704 BuchiCegarLoop]: Abstraction has 130 states and 177 transitions. [2021-07-06 20:24:59,627 INFO L587 BuchiCegarLoop]: Abstraction has 130 states and 177 transitions. [2021-07-06 20:24:59,627 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:24:59,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 177 transitions. [2021-07-06 20:24:59,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2021-07-06 20:24:59,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:59,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:59,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:59,629 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:59,629 INFO L791 eck$LassoCheckResult]: Stem: 450#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~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(13);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string35.base, #t~string35.offset, 1);call write~init~int(77, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(101, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(116, #t~string35.base, 3 + #t~string35.offset, 1);call write~init~int(104, #t~string35.base, 4 + #t~string35.offset, 1);call write~init~int(58, #t~string35.base, 5 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 6 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string37.base, #t~string37.offset, 1);call write~init~int(82, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(73, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(84, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 4 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string39.base, #t~string39.offset, 1);call write~init~int(75, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 2 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string41.base, #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 1 + #t~string41.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 427#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 410#L526 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 411#L534 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 444#L132 assume 0 != main_~tmp~0; 464#L105 havoc test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 503#L920-1 [2021-07-06 20:24:59,630 INFO L793 eck$LassoCheckResult]: Loop: 503#L920-1 assume !false; 507#L158 assume test_~splverifierCounter~0 < 4; 508#L159 test_~tmp~1 := test_#t~nondet8;havoc test_#t~nondet8; 526#L167 assume !(0 != test_~tmp~1); 524#L167-1 test_~tmp___0~0 := test_#t~nondet9;havoc test_#t~nondet9; 522#L177 assume !(0 != test_~tmp___0~0); 520#L177-1 test_~tmp___2~0 := test_#t~nondet10;havoc test_#t~nondet10; 511#L187 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 494#L195-2 assume !(0 != ~pumpRunning~0); 495#L229 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret12, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 468#L261 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret31, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 465#L484 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 466#L489 isHighWaterLevel_#t~ret31 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret31;havoc isHighWaterLevel_#t~ret31; 451#L381 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 452#L381-2 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 415#L387 processEnvironment_#t~ret12 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret12;havoc processEnvironment_#t~ret12; 416#L265 assume !(0 != processEnvironment_~tmp~2); 489#L236 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 519#L444-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 514#L914 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 503#L920-1 [2021-07-06 20:24:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:24:59,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102832217] [2021-07-06 20:24:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,659 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,683 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,692 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1033634406, now seen corresponding path program 1 times [2021-07-06 20:24:59,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949009262] [2021-07-06 20:24:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,699 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:59,710 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:59,713 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1018922432, now seen corresponding path program 1 times [2021-07-06 20:24:59,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:59,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817404586] [2021-07-06 20:24:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:59,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:59,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:59,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:59,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:59,798 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:24:59,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:59,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817404586] [2021-07-06 20:24:59,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817404586] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:59,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:59,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:59,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681178076] [2021-07-06 20:24:59,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:59,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-06 20:24:59,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:24:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:24:59,968 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. cyclomatic complexity: 49 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:25:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:00,090 INFO L93 Difference]: Finished difference Result 434 states and 594 transitions. [2021-07-06 20:25:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:25:00,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 594 transitions. [2021-07-06 20:25:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 314 [2021-07-06 20:25:00,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 594 transitions. [2021-07-06 20:25:00,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2021-07-06 20:25:00,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2021-07-06 20:25:00,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 594 transitions. [2021-07-06 20:25:00,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:00,102 INFO L681 BuchiCegarLoop]: Abstraction has 434 states and 594 transitions. [2021-07-06 20:25:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 594 transitions. [2021-07-06 20:25:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 254. [2021-07-06 20:25:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 1.3385826771653544) internal successors, (340), 253 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:25:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 340 transitions. [2021-07-06 20:25:00,118 INFO L704 BuchiCegarLoop]: Abstraction has 254 states and 340 transitions. [2021-07-06 20:25:00,118 INFO L587 BuchiCegarLoop]: Abstraction has 254 states and 340 transitions. [2021-07-06 20:25:00,118 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:25:00,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 340 transitions. [2021-07-06 20:25:00,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 180 [2021-07-06 20:25:00,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:00,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:00,121 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:00,121 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:00,121 INFO L791 eck$LassoCheckResult]: Stem: 1029#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~string16.base, #t~string16.offset := #Ultimate.allocOnStack(13);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(110, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 2 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(102, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string22.base, #t~string22.offset, 1);call write~init~int(80, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(117, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(109, #t~string22.base, 3 + #t~string22.offset, 1);call write~init~int(112, #t~string22.base, 4 + #t~string22.offset, 1);call write~init~int(58, #t~string22.base, 5 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 6 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string28.base, #t~string28.offset, 1);call write~init~int(32, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string30.base, #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 1 + #t~string30.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(13);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string35.base, #t~string35.offset, 1);call write~init~int(77, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(101, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(116, #t~string35.base, 3 + #t~string35.offset, 1);call write~init~int(104, #t~string35.base, 4 + #t~string35.offset, 1);call write~init~int(58, #t~string35.base, 5 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 6 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string37.base, #t~string37.offset, 1);call write~init~int(82, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(73, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(84, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 4 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string39.base, #t~string39.offset, 1);call write~init~int(75, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 2 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string41.base, #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 1 + #t~string41.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(30);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(25);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 1008#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 992#L526 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 993#L534 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 1023#L132 assume 0 != main_~tmp~0; 1041#L105 havoc test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1084#L920-1 [2021-07-06 20:25:00,121 INFO L793 eck$LassoCheckResult]: Loop: 1084#L920-1 assume !false; 1024#L158 assume test_~splverifierCounter~0 < 4; 1025#L159 test_~tmp~1 := test_#t~nondet8;havoc test_#t~nondet8; 1089#L167 assume !(0 != test_~tmp~1); 1085#L167-1 test_~tmp___0~0 := test_#t~nondet9;havoc test_#t~nondet9; 1057#L177 assume !(0 != test_~tmp___0~0); 1047#L177-1 test_~tmp___2~0 := test_#t~nondet10;havoc test_#t~nondet10; 1017#L187 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1018#L195-2 assume !(0 != ~pumpRunning~0); 1075#L229 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret12, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1080#L261 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret31, isHighWaterLevel_~retValue_acc~3, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~3;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1233#L484 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1090#L489 isHighWaterLevel_#t~ret31 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret31;havoc isHighWaterLevel_#t~ret31; 1030#L381 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 1031#L381-2 isHighWaterLevel_~retValue_acc~3 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~3; 996#L387 processEnvironment_#t~ret12 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret12;havoc processEnvironment_#t~ret12; 997#L265 assume !(0 != processEnvironment_~tmp~2); 1070#L236 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 1095#L444-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 1009#L914 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~8);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1010#L476 __utac_acc__Specification3_spec__1_#t~ret79 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret79;havoc __utac_acc__Specification3_spec__1_#t~ret79; 1033#L920 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1084#L920-1 [2021-07-06 20:25:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:25:00,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:00,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070119174] [2021-07-06 20:25:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:00,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,158 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,181 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1185212340, now seen corresponding path program 1 times [2021-07-06 20:25:00,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:00,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271305576] [2021-07-06 20:25:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:00,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,193 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,196 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,199 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 68092786, now seen corresponding path program 1 times [2021-07-06 20:25:00,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:00,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034826122] [2021-07-06 20:25:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:00,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,222 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:00,240 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:00,251 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:00,376 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-07-06 20:25:00,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:00,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-06 20:25:44,942 WARN L205 SmtUtils]: Spent 44.49 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:25:44,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:45,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:26:06,335 WARN L205 SmtUtils]: Spent 21.32 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:26:06,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:26:06 BoogieIcfgContainer [2021-07-06 20:26:06,467 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:26:06,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:26:06,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:26:06,468 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:26:06,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:58" (3/4) ... [2021-07-06 20:26:06,470 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:26:06,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:26:06,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:26:06,524 INFO L168 Benchmark]: Toolchain (without parser) took 69234.99 ms. Allocated memory was 54.5 MB in the beginning and 111.1 MB in the end (delta: 56.6 MB). Free memory was 30.7 MB in the beginning and 26.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,525 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 35.3 MB in the beginning and 35.2 MB in the end (delta: 33.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:26:06,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.70 ms. Allocated memory was 54.5 MB in the beginning and 75.5 MB in the end (delta: 21.0 MB). Free memory was 30.5 MB in the beginning and 47.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 75.5 MB. Free memory was 47.6 MB in the beginning and 44.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,528 INFO L168 Benchmark]: Boogie Preprocessor took 52.94 ms. Allocated memory is still 75.5 MB. Free memory was 44.4 MB in the beginning and 42.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,528 INFO L168 Benchmark]: RCFGBuilder took 882.39 ms. Allocated memory is still 75.5 MB. Free memory was 42.1 MB in the beginning and 48.3 MB in the end (delta: -6.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,530 INFO L168 Benchmark]: BuchiAutomizer took 67698.74 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 48.0 MB in the beginning and 29.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,531 INFO L168 Benchmark]: Witness Printer took 55.66 ms. Allocated memory is still 111.1 MB. Free memory was 29.4 MB in the beginning and 26.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:06,533 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 35.3 MB in the beginning and 35.2 MB in the end (delta: 33.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 458.70 ms. Allocated memory was 54.5 MB in the beginning and 75.5 MB in the end (delta: 21.0 MB). Free memory was 30.5 MB in the beginning and 47.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 75.5 MB. Free memory was 47.6 MB in the beginning and 44.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.94 ms. Allocated memory is still 75.5 MB. Free memory was 44.4 MB in the beginning and 42.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 882.39 ms. Allocated memory is still 75.5 MB. Free memory was 42.1 MB in the beginning and 48.3 MB in the end (delta: -6.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 67698.74 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 48.0 MB in the beginning and 29.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. * Witness Printer took 55.66 ms. Allocated memory is still 111.1 MB. Free memory was 29.4 MB in the beginning and 26.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 254 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 67.2s. 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 34.1ms AutomataMinimizationTime, 3 MinimizatonAttempts, 180 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 254 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 395 SDtfs, 649 SDslu, 534 SDs, 0 SdLazy, 103 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 157]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=11073} State at position 1 is {NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d4e676b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e8b63e6=0, NULL=11073, NULL=11081, NULL=0, NULL=11100, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11de32b=0, retValue_acc=0, NULL=11076, tmp___1=0, NULL=0, NULL=11094, NULL=11087, cleanupTimeShifts=4, tmp=0, tmp=0, waterLevel=1, NULL=0, tmp___0=0, \result=1, head=0, pumpRunning=0, tmp=1, retValue_acc=1, NULL=11080, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74e13ef8=0, \result=1, NULL=11097, NULL=0, NULL=0, tmp=1, NULL=11098, NULL=0, NULL=0, NULL=0, NULL=11084, NULL=11082, retValue_acc=1, NULL=11075, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a567b0f=0, head=0, NULL=0, NULL=0, NULL=11083, NULL=0, NULL=0, NULL=11085, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@691f323b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fd5c977=0, NULL=0, NULL=11079, NULL=11099, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@578b6dec=66, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73633245=0, NULL=11078, tmp___0=0, NULL=0, NULL=11101, NULL=0, NULL=0, NULL=11089, tmp___0=1, NULL=0, systemActive=1, \result=1, \result=0, retValue_acc=0, NULL=11090, NULL=11093, \result=0, NULL=11074, NULL=0, NULL=0, NULL=11095, NULL=11092, retValue_acc=1, NULL=11077, tmp___2=66, splverifierCounter=0, NULL=0, \result=0, NULL=11088, NULL=11096, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f1104a2=0, NULL=0, NULL=0, NULL=11091, NULL=0, NULL=11086} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L42] int cleanupTimeShifts = 4; [L221] int pumpRunning = 0; [L222] int systemActive = 1; [L401] int waterLevel = 1; [L402] int methaneLevelCritical = 0; [L708] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L123] int retValue_acc ; [L124] int tmp ; [L530] int retValue_acc ; [L533] retValue_acc = 1 [L534] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L148] int splverifierCounter ; [L149] int tmp ; [L150] int tmp___0 ; [L151] int tmp___1 ; [L152] int tmp___2 ; [L155] splverifierCounter = 0 Loop: [L157] COND TRUE 1 [L159] COND TRUE splverifierCounter < 4 [L165] tmp = __VERIFIER_nondet_int() [L167] COND FALSE !(\read(tmp)) [L175] tmp___0 = __VERIFIER_nondet_int() [L177] COND FALSE !(\read(tmp___0)) [L185] tmp___2 = __VERIFIER_nondet_int() [L187] COND TRUE \read(tmp___2) [L395] systemActive = 1 [L229] COND FALSE !(\read(pumpRunning)) [L236] COND TRUE \read(systemActive) [L258] int tmp ; [L261] COND TRUE ! pumpRunning [L373] int retValue_acc ; [L374] int tmp ; [L375] int tmp___0 ; [L481] int retValue_acc ; [L484] COND TRUE waterLevel < 2 [L485] retValue_acc = 1 [L486] return (retValue_acc); [L379] tmp = isHighWaterSensorDry() [L381] COND TRUE \read(tmp) [L382] tmp___0 = 0 [L386] retValue_acc = tmp___0 [L387] return (retValue_acc); [L263] tmp = isHighWaterLevel() [L265] COND FALSE !(\read(tmp)) [L906] int tmp ; [L907] int tmp___0 ; [L908] int tmp___1 ; [L440] int retValue_acc ; [L443] retValue_acc = methaneLevelCritical [L444] return (retValue_acc); [L912] tmp = isMethaneLevelCritical() [L914] COND FALSE !(\read(tmp)) [L472] int retValue_acc ; [L475] retValue_acc = waterLevel [L476] return (retValue_acc); [L918] tmp___0 = getWaterLevel() [L920] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:26:06,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...