./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product11.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_product11.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 c534e2971bdf18360cf74a44c61943e42e7f6f94 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:22:28,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:22:28,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:22:28,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:22:28,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:22:28,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:22:28,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:22:28,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:22:28,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:22:28,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:22:28,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:22:28,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:22:28,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:22:28,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:22:28,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:22:28,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:22:28,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:22:28,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:22:28,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:22:28,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:22:28,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:22:28,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:22:28,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:22:28,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:22:28,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:22:28,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:22:28,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:22:28,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:22:28,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:22:28,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:22:28,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:22:28,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:22:28,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:22:28,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:22:28,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:22:28,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:22:28,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:22:28,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:22:28,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:22:28,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:22:28,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:22:28,920 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:22:28,953 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:22:28,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:22:28,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:22:28,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:22:28,955 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:22:28,955 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:22:28,955 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:22:28,955 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:22:28,955 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:22:28,956 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:22:28,956 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:22:28,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:22:28,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:22:28,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:22:28,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:22:28,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:22:28,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:22:28,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:22:28,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:22:28,960 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:22:28,960 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 -> c534e2971bdf18360cf74a44c61943e42e7f6f94 [2021-07-06 20:22:29,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:22:29,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:22:29,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:22:29,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:22:29,224 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:22:29,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product11.cil.c [2021-07-06 20:22:29,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d578c84/3927f93621b54b9e9ca6a1d17108f9ab/FLAG9c138a294 [2021-07-06 20:22:29,617 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:22:29,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product11.cil.c [2021-07-06 20:22:29,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d578c84/3927f93621b54b9e9ca6a1d17108f9ab/FLAG9c138a294 [2021-07-06 20:22:30,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d578c84/3927f93621b54b9e9ca6a1d17108f9ab [2021-07-06 20:22:30,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:22:30,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:22:30,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:22:30,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:22:30,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:22:30,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3ea324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30, skipping insertion in model container [2021-07-06 20:22:30,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:22:30,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:22:30,245 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_product11.cil.c[15878,15891] [2021-07-06 20:22:30,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:22:30,257 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:22:30,325 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_product11.cil.c[15878,15891] [2021-07-06 20:22:30,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:22:30,357 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:22:30,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30 WrapperNode [2021-07-06 20:22:30,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:22:30,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:22:30,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:22:30,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:22:30,364 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:22:30" (1/1) ... [2021-07-06 20:22:30,388 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:22:30" (1/1) ... [2021-07-06 20:22:30,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:22:30,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:22:30,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:22:30,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:22:30,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:22:30,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:22:30,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:22:30,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:22:30,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (1/1) ... [2021-07-06 20:22:30,469 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:22:30,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:22:30,482 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:22:30,504 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:22:30,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:22:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:22:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:22:30,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:22:31,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:22:31,113 INFO L299 CfgBuilder]: Removed 76 assume(true) statements. [2021-07-06 20:22:31,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:22:31 BoogieIcfgContainer [2021-07-06 20:22:31,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:22:31,114 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:22:31,114 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:22:31,116 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:22:31,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:22:31,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:22:30" (1/3) ... [2021-07-06 20:22:31,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38030a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:22:31, skipping insertion in model container [2021-07-06 20:22:31,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:22:31,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:22:30" (2/3) ... [2021-07-06 20:22:31,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38030a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:22:31, skipping insertion in model container [2021-07-06 20:22:31,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:22:31,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:22:31" (3/3) ... [2021-07-06 20:22:31,119 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product11.cil.c [2021-07-06 20:22:31,143 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:22:31,143 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:22:31,144 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:22:31,144 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:22:31,144 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:22:31,144 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:22:31,144 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:22:31,144 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:22:31,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 61 states have internal predecessors, (93), 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:22:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-07-06 20:22:31,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:22:31,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:22:31,169 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,169 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,169 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:22:31,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 61 states have internal predecessors, (93), 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:22:31,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-07-06 20:22:31,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:22:31,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:22:31,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,173 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,176 INFO L791 eck$LassoCheckResult]: Stem: 28#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~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(13);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string56.base, #t~string56.offset, 1);call write~init~int(80, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(117, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(109, #t~string56.base, 3 + #t~string56.offset, 1);call write~init~int(112, #t~string56.base, 4 + #t~string56.offset, 1);call write~init~int(58, #t~string56.base, 5 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 6 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string62.base, #t~string62.offset, 1);call write~init~int(32, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string64.base, #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 1 + #t~string64.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(13);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string72.base, #t~string72.offset, 1);call write~init~int(77, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(101, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(116, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(104, #t~string72.base, 4 + #t~string72.offset, 1);call write~init~int(58, #t~string72.base, 5 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 6 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string74.base, #t~string74.offset, 1);call write~init~int(82, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(73, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(84, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 4 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string76.base, #t~string76.offset, 1);call write~init~int(75, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string78.base, #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 1 + #t~string78.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 7#L-1true havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 52#L206true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 61#L214true main_#t~ret10 := valid_product_#res;main_~tmp~1 := main_#t~ret10;havoc main_#t~ret10; 60#L170true assume 0 != main_~tmp~1; 18#L143true havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 57#L61-1true [2021-07-06 20:22:31,176 INFO L793 eck$LassoCheckResult]: Loop: 57#L61-1true assume !false; 63#L741true assume test_~splverifierCounter~0 < 4; 13#L742true test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 20#L750true assume !(0 != test_~tmp~6); 21#L750-1true test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 3#L760true assume !(0 != test_~tmp___0~1); 4#L760-1true test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 56#L770true assume 0 != test_~tmp___2~0; 32#L776-1true assume !(0 != ~pumpRunning~0); 47#L597true assume !(0 != ~systemActive~0); 33#L604true havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~8;havoc isMethaneLevelCritical_~retValue_acc~8;isMethaneLevelCritical_~retValue_acc~8 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~8; 35#L849true __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 34#L55true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 57#L61-1true [2021-07-06 20:22:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,179 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:22:31,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338291718] [2021-07-06 20:22:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,311 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,366 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,387 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1673895426, now seen corresponding path program 1 times [2021-07-06 20:22:31,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173242125] [2021-07-06 20:22:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,393 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,396 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,399 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 40383512, now seen corresponding path program 1 times [2021-07-06 20:22:31,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474715106] [2021-07-06 20:22:31,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:22:31,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:22:31,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:22:31,485 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:22:31,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:22:31,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474715106] [2021-07-06 20:22:31,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474715106] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:22:31,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:22:31,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:22:31,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787594117] [2021-07-06 20:22:31,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:22:31,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:22:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:22:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:22:31,556 INFO L87 Difference]: Start difference. First operand has 62 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 61 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:22:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:22:31,709 INFO L93 Difference]: Finished difference Result 174 states and 237 transitions. [2021-07-06 20:22:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:22:31,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 237 transitions. [2021-07-06 20:22:31,715 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 109 [2021-07-06 20:22:31,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 153 states and 216 transitions. [2021-07-06 20:22:31,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2021-07-06 20:22:31,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2021-07-06 20:22:31,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 216 transitions. [2021-07-06 20:22:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:22:31,721 INFO L681 BuchiCegarLoop]: Abstraction has 153 states and 216 transitions. [2021-07-06 20:22:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 216 transitions. [2021-07-06 20:22:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2021-07-06 20:22:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.411764705882353) internal successors, (144), 101 states have internal predecessors, (144), 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:22:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2021-07-06 20:22:31,742 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2021-07-06 20:22:31,742 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2021-07-06 20:22:31,742 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:22:31,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 144 transitions. [2021-07-06 20:22:31,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 72 [2021-07-06 20:22:31,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:22:31,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:22:31,744 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,745 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:22:31,745 INFO L791 eck$LassoCheckResult]: Stem: 287#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~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(13);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string56.base, #t~string56.offset, 1);call write~init~int(80, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(117, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(109, #t~string56.base, 3 + #t~string56.offset, 1);call write~init~int(112, #t~string56.base, 4 + #t~string56.offset, 1);call write~init~int(58, #t~string56.base, 5 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 6 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string62.base, #t~string62.offset, 1);call write~init~int(32, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string64.base, #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 1 + #t~string64.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(13);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string72.base, #t~string72.offset, 1);call write~init~int(77, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(101, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(116, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(104, #t~string72.base, 4 + #t~string72.offset, 1);call write~init~int(58, #t~string72.base, 5 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 6 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string74.base, #t~string74.offset, 1);call write~init~int(82, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(73, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(84, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 4 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string76.base, #t~string76.offset, 1);call write~init~int(75, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string78.base, #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 1 + #t~string78.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 261#L-1 havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 262#L206 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 307#L214 main_#t~ret10 := valid_product_#res;main_~tmp~1 := main_#t~ret10;havoc main_#t~ret10; 309#L170 assume 0 != main_~tmp~1; 278#L143 havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 268#L61-1 [2021-07-06 20:22:31,745 INFO L793 eck$LassoCheckResult]: Loop: 268#L61-1 assume !false; 308#L741 assume test_~splverifierCounter~0 < 4; 271#L742 test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 272#L750 assume !(0 != test_~tmp~6); 282#L750-1 test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 254#L760 assume !(0 != test_~tmp___0~1); 255#L760-1 test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 257#L770 assume 0 != test_~tmp___2~0; 291#L776-1 assume !(0 != ~pumpRunning~0); 284#L597 assume 0 != ~systemActive~0; 293#L604 havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~8;havoc isMethaneLevelCritical_~retValue_acc~8;isMethaneLevelCritical_~retValue_acc~8 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~8; 294#L849 __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 295#L55 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 268#L61-1 [2021-07-06 20:22:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:22:31,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978077172] [2021-07-06 20:22:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,782 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,818 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,826 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1673984799, now seen corresponding path program 1 times [2021-07-06 20:22:31,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122619237] [2021-07-06 20:22:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,830 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:31,832 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:31,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 40294139, now seen corresponding path program 1 times [2021-07-06 20:22:31,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:31,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883715596] [2021-07-06 20:22:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:31,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:22:31,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:22:31,868 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:22:31,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:22:31,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883715596] [2021-07-06 20:22:31,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883715596] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:22:31,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:22:31,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:22:31,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406102252] [2021-07-06 20:22:31,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:31,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-07-06 20:22:31,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:22:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:22:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:22:31,912 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. cyclomatic complexity: 45 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:22:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:22:31,990 INFO L93 Difference]: Finished difference Result 319 states and 461 transitions. [2021-07-06 20:22:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:22:31,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319 states and 461 transitions. [2021-07-06 20:22:31,994 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 240 [2021-07-06 20:22:31,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319 states to 319 states and 461 transitions. [2021-07-06 20:22:31,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2021-07-06 20:22:31,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2021-07-06 20:22:31,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 461 transitions. [2021-07-06 20:22:31,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:22:31,998 INFO L681 BuchiCegarLoop]: Abstraction has 319 states and 461 transitions. [2021-07-06 20:22:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 461 transitions. [2021-07-06 20:22:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 198. [2021-07-06 20:22:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.3838383838383839) internal successors, (274), 197 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:22:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2021-07-06 20:22:32,008 INFO L704 BuchiCegarLoop]: Abstraction has 198 states and 274 transitions. [2021-07-06 20:22:32,008 INFO L587 BuchiCegarLoop]: Abstraction has 198 states and 274 transitions. [2021-07-06 20:22:32,008 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:22:32,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 274 transitions. [2021-07-06 20:22:32,010 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 144 [2021-07-06 20:22:32,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:22:32,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:22:32,011 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:22:32,011 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:22:32,011 INFO L791 eck$LassoCheckResult]: Stem: 730#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~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(21);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(30);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(9);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(30);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(9);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(25);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(13);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string52.base, #t~string52.offset, 1);call write~init~int(110, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 2 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(102, #t~string54.base, 2 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 3 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string56.base, #t~string56.offset, 1);call write~init~int(80, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(117, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(109, #t~string56.base, 3 + #t~string56.offset, 1);call write~init~int(112, #t~string56.base, 4 + #t~string56.offset, 1);call write~init~int(58, #t~string56.base, 5 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 6 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string62.base, #t~string62.offset, 1);call write~init~int(32, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string64.base, #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 1 + #t~string64.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(13);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string72.base, #t~string72.offset, 1);call write~init~int(77, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(101, #t~string72.base, 2 + #t~string72.offset, 1);call write~init~int(116, #t~string72.base, 3 + #t~string72.offset, 1);call write~init~int(104, #t~string72.base, 4 + #t~string72.offset, 1);call write~init~int(58, #t~string72.base, 5 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 6 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string74.base, #t~string74.offset, 1);call write~init~int(82, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(73, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(84, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 4 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string76.base, #t~string76.offset, 1);call write~init~int(75, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string78.base, #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 1 + #t~string78.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 701#L-1 havoc main_#res;havoc main_#t~ret10, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 702#L206 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 764#L214 main_#t~ret10 := valid_product_#res;main_~tmp~1 := main_#t~ret10;havoc main_#t~ret10; 774#L170 assume 0 != main_~tmp~1; 717#L143 havoc test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~1, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~1;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 706#L61-1 [2021-07-06 20:22:32,011 INFO L793 eck$LassoCheckResult]: Loop: 706#L61-1 assume !false; 769#L741 assume test_~splverifierCounter~0 < 4; 709#L742 test_~tmp~6 := test_#t~nondet65;havoc test_#t~nondet65; 710#L750 assume !(0 != test_~tmp~6); 721#L750-1 test_~tmp___0~1 := test_#t~nondet66;havoc test_#t~nondet66; 693#L760 assume !(0 != test_~tmp___0~1); 694#L760-1 test_~tmp___2~0 := test_#t~nondet67;havoc test_#t~nondet67; 696#L770 assume 0 != test_~tmp___2~0; 733#L776-1 assume !(0 != ~pumpRunning~0); 839#L597 assume 0 != ~systemActive~0; 737#L604 havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~8;havoc isMethaneLevelCritical_~retValue_acc~8;isMethaneLevelCritical_~retValue_acc~8 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~8; 738#L849 __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 739#L55 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 740#L881 __utac_acc__Specification3_spec__1_#t~ret8 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 772#L61 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 706#L61-1 [2021-07-06 20:22:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:22:32,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:32,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803132509] [2021-07-06 20:22:32,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:32,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,034 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,053 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1913349523, now seen corresponding path program 1 times [2021-07-06 20:22:32,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:32,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112640624] [2021-07-06 20:22:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:32,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,063 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,065 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:22:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash 67967277, now seen corresponding path program 1 times [2021-07-06 20:22:32,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:22:32,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704304127] [2021-07-06 20:22:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:22:32,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:22:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,088 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:22:32,127 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:22:32,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:22:32,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:22:32,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-07-06 20:23:13,901 WARN L205 SmtUtils]: Spent 41.70 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:23:13,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:23:14,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:23:34,885 WARN L205 SmtUtils]: Spent 20.86 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:23:35,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:23:35 BoogieIcfgContainer [2021-07-06 20:23:35,013 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:23:35,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:23:35,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:23:35,013 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:23:35,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:22:31" (3/4) ... [2021-07-06 20:23:35,015 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:23:35,082 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:23:35,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:23:35,083 INFO L168 Benchmark]: Toolchain (without parser) took 65076.24 ms. Allocated memory was 56.6 MB in the beginning and 113.2 MB in the end (delta: 56.6 MB). Free memory was 33.0 MB in the beginning and 47.8 MB in the end (delta: -14.8 MB). Peak memory consumption was 42.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,083 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:23:35,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.94 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.8 MB in the beginning and 44.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 69.2 MB. Free memory was 44.8 MB in the beginning and 42.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,084 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 ms. Allocated memory is still 69.2 MB. Free memory was 42.0 MB in the beginning and 40.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,084 INFO L168 Benchmark]: RCFGBuilder took 650.07 ms. Allocated memory is still 69.2 MB. Free memory was 40.2 MB in the beginning and 36.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,084 INFO L168 Benchmark]: BuchiAutomizer took 63898.38 ms. Allocated memory was 69.2 MB in the beginning and 113.2 MB in the end (delta: 44.0 MB). Free memory was 36.1 MB in the beginning and 49.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 61.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,085 INFO L168 Benchmark]: Witness Printer took 69.60 ms. Allocated memory is still 113.2 MB. Free memory was 49.8 MB in the beginning and 47.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:23:35,086 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.14 ms. Allocated memory is still 56.6 MB. Free memory was 37.6 MB in the beginning and 37.5 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 350.94 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 32.8 MB in the beginning and 44.8 MB in the end (delta: -12.0 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.08 ms. Allocated memory is still 69.2 MB. Free memory was 44.8 MB in the beginning and 42.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.83 ms. Allocated memory is still 69.2 MB. Free memory was 42.0 MB in the beginning and 40.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 650.07 ms. Allocated memory is still 69.2 MB. Free memory was 40.2 MB in the beginning and 36.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 63898.38 ms. Allocated memory was 69.2 MB in the beginning and 113.2 MB in the end (delta: 44.0 MB). Free memory was 36.1 MB in the beginning and 49.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 61.1 MB. Max. memory is 16.1 GB. * Witness Printer took 69.60 ms. Allocated memory is still 113.2 MB. Free memory was 49.8 MB in the beginning and 47.8 MB in the end (delta: 2.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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 198 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 63.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 23.0ms AutomataMinimizationTime, 2 MinimizatonAttempts, 172 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 198 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 183 SDtfs, 567 SDslu, 697 SDs, 0 SdLazy, 82 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 131.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 740]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=3797} State at position 1 is {NULL=0, NULL=0, NULL=0, retValue_acc=0, NULL=3797, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a2e3963=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19a58d07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@319cd89d=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=3814, NULL=3818, NULL=3806, methaneLevelCritical=0, NULL=3819, NULL=3809, NULL=3823, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7312ccb1=0, tmp___1=0, NULL=0, NULL=0, tmp___0=1, NULL=3804, tmp=0, cleanupTimeShifts=4, NULL=3812, NULL=3822, NULL=3800, NULL=3815, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=3807, retValue_acc=0, NULL=3824, NULL=0, NULL=0, NULL=0, NULL=3799, NULL=0, NULL=0, NULL=3813, \result=1, head=0, pumpRunning=0, \result=0, NULL=3802, NULL=3816, tmp=1, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c14bb9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@764db86e=64, NULL=0, NULL=3826, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5aadef74=0, NULL=0, NULL=0, NULL=0, retValue_acc=1, NULL=3821, NULL=0, retValue_acc=1, tmp___2=64, NULL=3820, tmp___0=0, splverifierCounter=0, NULL=0, \result=0, NULL=3798, NULL=3803, NULL=3810, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@506f04cb=0, head=0, NULL=3827, NULL=0, NULL=0, NULL=3811, NULL=3808, NULL=3817, NULL=3805} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L80] int cleanupTimeShifts = 4; [L388] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L590] int pumpRunning = 0; [L591] int systemActive = 1; [L806] int waterLevel = 1; [L807] int methaneLevelCritical = 0; [L161] int retValue_acc ; [L162] int tmp ; [L210] int retValue_acc ; [L213] retValue_acc = 1 [L214] return (retValue_acc); [L168] tmp = valid_product() [L170] COND TRUE \read(tmp) [L731] int splverifierCounter ; [L732] int tmp ; [L733] int tmp___0 ; [L734] int tmp___1 ; [L735] int tmp___2 ; [L738] splverifierCounter = 0 Loop: [L740] COND TRUE 1 [L742] COND TRUE splverifierCounter < 4 [L748] tmp = __VERIFIER_nondet_int() [L750] COND FALSE !(\read(tmp)) [L758] tmp___0 = __VERIFIER_nondet_int() [L760] COND FALSE !(\read(tmp___0)) [L768] tmp___2 = __VERIFIER_nondet_int() [L770] COND TRUE \read(tmp___2) [L597] COND FALSE !(\read(pumpRunning)) [L604] COND TRUE \read(systemActive) [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L845] int retValue_acc ; [L848] retValue_acc = methaneLevelCritical [L849] return (retValue_acc); [L53] tmp = isMethaneLevelCritical() [L55] COND FALSE !(\read(tmp)) [L877] int retValue_acc ; [L880] retValue_acc = waterLevel [L881] return (retValue_acc); [L59] tmp___0 = getWaterLevel() [L61] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:23:35,169 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...