./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product41.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_product41.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 1fc4b6513d54dfae6e097800b1200a0f44455272
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:52,922 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-07-06 20:24:52,924 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-07-06 20:24:52,954 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-07-06 20:24:52,955 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-07-06 20:24:52,958 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-07-06 20:24:52,959 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-07-06 20:24:52,963 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-07-06 20:24:52,968 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-07-06 20:24:52,972 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-07-06 20:24:52,973 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-07-06 20:24:52,974 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-07-06 20:24:52,974 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-07-06 20:24:52,976 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-07-06 20:24:52,976 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-07-06 20:24:52,977 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-07-06 20:24:52,979 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-07-06 20:24:52,980 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-07-06 20:24:52,981 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-07-06 20:24:52,986 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-07-06 20:24:52,987 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-07-06 20:24:52,987 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-07-06 20:24:52,988 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-07-06 20:24:52,990 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-07-06 20:24:52,994 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-07-06 20:24:52,995 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-07-06 20:24:52,995 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-07-06 20:24:52,996 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-07-06 20:24:52,996 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-07-06 20:24:52,997 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-07-06 20:24:52,997 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-07-06 20:24:52,998 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-07-06 20:24:52,999 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-07-06 20:24:52,999 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-07-06 20:24:53,000 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-07-06 20:24:53,000 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-07-06 20:24:53,001 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-07-06 20:24:53,001 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-07-06 20:24:53,001 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-07-06 20:24:53,002 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-07-06 20:24:53,003 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-07-06 20:24:53,003 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:53,031 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-07-06 20:24:53,031 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-07-06 20:24:53,033 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-07-06 20:24:53,033 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-07-06 20:24:53,033 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-07-06 20:24:53,033 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-07-06 20:24:53,033 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2021-07-06 20:24:53,034 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2021-07-06 20:24:53,034 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2021-07-06 20:24:53,034 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2021-07-06 20:24:53,034 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2021-07-06 20:24:53,035 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-07-06 20:24:53,035 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-07-06 20:24:53,035 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2021-07-06 20:24:53,035 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-07-06 20:24:53,035 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-07-06 20:24:53,035 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2021-07-06 20:24:53,036 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-07-06 20:24:53,037 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2021-07-06 20:24:53,037 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-07-06 20:24:53,037 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-07-06 20:24:53,037 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-07-06 20:24:53,037 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-07-06 20:24:53,037 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-07-06 20:24:53,039 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-07-06 20:24:53,039 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 -> 1fc4b6513d54dfae6e097800b1200a0f44455272
[2021-07-06 20:24:53,297 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-07-06 20:24:53,325 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-07-06 20:24:53,327 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-07-06 20:24:53,328 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-07-06 20:24:53,328 INFO  L275        PluginConnector]: CDTParser initialized
[2021-07-06 20:24:53,329 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c
[2021-07-06 20:24:53,370 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4cb0eb/228730b171e54288af11c2656cd5a35a/FLAGde854e500
[2021-07-06 20:24:53,763 INFO  L306              CDTParser]: Found 1 translation units.
[2021-07-06 20:24:53,763 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c
[2021-07-06 20:24:53,771 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4cb0eb/228730b171e54288af11c2656cd5a35a/FLAGde854e500
[2021-07-06 20:24:53,783 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b4cb0eb/228730b171e54288af11c2656cd5a35a
[2021-07-06 20:24:53,785 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-07-06 20:24:53,786 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-07-06 20:24:53,788 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-07-06 20:24:53,788 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-07-06 20:24:53,790 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-07-06 20:24:53,791 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:53" (1/1) ...
[2021-07-06 20:24:53,792 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d89bc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:53, skipping insertion in model container
[2021-07-06 20:24:53,792 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:53" (1/1) ...
[2021-07-06 20:24:53,796 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-07-06 20:24:53,830 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-07-06 20:24:54,044 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_product41.cil.c[17654,17667]
[2021-07-06 20:24:54,051 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-07-06 20:24:54,060 INFO  L203         MainTranslator]: Completed pre-run
[2021-07-06 20:24:54,132 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_product41.cil.c[17654,17667]
[2021-07-06 20:24:54,132 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-07-06 20:24:54,153 INFO  L208         MainTranslator]: Completed translation
[2021-07-06 20:24:54,154 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:54 WrapperNode
[2021-07-06 20:24:54,155 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-07-06 20:24:54,156 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-07-06 20:24:54,156 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-07-06 20:24:54,156 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-07-06 20:24:54,160 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:54" (1/1) ...
[2021-07-06 20:24:54,172 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:54" (1/1) ...
[2021-07-06 20:24:54,198 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-07-06 20:24:54,203 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-07-06 20:24:54,204 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-07-06 20:24:54,204 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-07-06 20:24:54,209 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:54" (1/1) ...
[2021-07-06 20:24:54,209 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:54" (1/1) ...
[2021-07-06 20:24:54,220 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:54" (1/1) ...
[2021-07-06 20:24:54,221 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:54" (1/1) ...
[2021-07-06 20:24:54,226 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:54" (1/1) ...
[2021-07-06 20:24:54,234 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:54" (1/1) ...
[2021-07-06 20:24:54,237 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:54" (1/1) ...
[2021-07-06 20:24:54,239 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-07-06 20:24:54,240 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-07-06 20:24:54,240 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-07-06 20:24:54,240 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-07-06 20:24:54,240 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:54" (1/1) ...
[2021-07-06 20:24:54,245 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-07-06 20:24:54,250 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-07-06 20:24:54,272 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:54,300 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:54,322 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-07-06 20:24:54,323 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-07-06 20:24:54,323 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-07-06 20:24:54,323 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-07-06 20:24:54,876 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-07-06 20:24:54,876 INFO  L299             CfgBuilder]: Removed 120 assume(true) statements.
[2021-07-06 20:24:54,877 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:54 BoogieIcfgContainer
[2021-07-06 20:24:54,877 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-07-06 20:24:54,878 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-07-06 20:24:54,878 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2021-07-06 20:24:54,880 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2021-07-06 20:24:54,880 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-07-06 20:24:54,881 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:24:53" (1/3) ...
[2021-07-06 20:24:54,881 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21a6dbdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:54, skipping insertion in model container
[2021-07-06 20:24:54,881 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-07-06 20:24:54,881 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:54" (2/3) ...
[2021-07-06 20:24:54,882 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21a6dbdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:54, skipping insertion in model container
[2021-07-06 20:24:54,882 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-07-06 20:24:54,882 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:54" (3/3) ...
[2021-07-06 20:24:54,883 INFO  L389   chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product41.cil.c
[2021-07-06 20:24:54,906 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2021-07-06 20:24:54,907 INFO  L360         BuchiCegarLoop]: Hoare is false
[2021-07-06 20:24:54,907 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-07-06 20:24:54,907 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-07-06 20:24:54,907 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-07-06 20:24:54,907 INFO  L364         BuchiCegarLoop]: Difference is false
[2021-07-06 20:24:54,907 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-07-06 20:24:54,907 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-07-06 20:24:54,917 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:54,936 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 57
[2021-07-06 20:24:54,936 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-07-06 20:24:54,936 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-07-06 20:24:54,941 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:54,941 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:54,941 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2021-07-06 20:24:54,943 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:54,954 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 57
[2021-07-06 20:24:54,954 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-07-06 20:24:54,954 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-07-06 20:24:54,955 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:54,955 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:54,963 INFO  L791   eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);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~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);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);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 9#L-1true havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 66#L67true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 84#L75true main_#t~ret45 := valid_product_#res;main_~tmp~5 := main_#t~ret45;havoc main_#t~ret45; 86#L540true assume 0 != main_~tmp~5; 68#L517true havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 41#L345-1true 
[2021-07-06 20:24:54,963 INFO  L793   eck$LassoCheckResult]: Loop: 41#L345-1true assume !false; 5#L274true assume test_~splverifierCounter~0 < 4; 18#L275true test_~tmp~3 := test_#t~nondet28;havoc test_#t~nondet28; 42#L283true assume !(0 != test_~tmp~3); 36#L283-1true test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 13#L293true assume !(0 != test_~tmp___0~1); 35#L293-1true test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 3#L303true assume 0 != test_~tmp___2~0; 61#L309-2true assume !(0 != ~pumpRunning~0); 85#L97true assume !(0 != ~systemActive~0); 51#L104true havoc __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_#t~ret33, __utac_acc__Specification3_spec__1_#t~ret34, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~4;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~5;havoc isMethaneLevelCritical_~retValue_acc~5;isMethaneLevelCritical_~retValue_acc~5 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~5; 50#L407-1true __utac_acc__Specification3_spec__1_#t~ret32 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret32;havoc __utac_acc__Specification3_spec__1_#t~ret32; 83#L339true assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 41#L345-1true 
[2021-07-06 20:24:54,968 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:54,968 INFO  L82        PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times
[2021-07-06 20:24:54,973 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:54,974 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834658386]
[2021-07-06 20:24:54,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:54,975 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,177 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,256 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,284 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:55,288 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,288 INFO  L82        PathProgramCache]: Analyzing trace with hash -1681191243, now seen corresponding path program 1 times
[2021-07-06 20:24:55,288 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,289 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928455140]
[2021-07-06 20:24:55,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,290 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,295 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,305 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,312 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:55,314 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,314 INFO  L82        PathProgramCache]: Analyzing trace with hash 33087695, now seen corresponding path program 1 times
[2021-07-06 20:24:55,314 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,314 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843396702]
[2021-07-06 20:24:55,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,314 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-07-06 20:24:55,368 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,369 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,376 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,377 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,380 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,380 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,386 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,386 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-07-06 20:24:55,392 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,393 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-07-06 20:24:55,394 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:55,394 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-07-06 20:24:55,394 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843396702]
[2021-07-06 20:24:55,395 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843396702] provided 1 perfect and 0 imperfect interpolant sequences
[2021-07-06 20:24:55,395 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-07-06 20:24:55,395 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-07-06 20:24:55,395 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933360061]
[2021-07-06 20:24:55,446 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,449 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42
[2021-07-06 20:24:55,481 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-07-06 20:24:55,494 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-07-06 20:24:55,495 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-07-06 20:24:55,497 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 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:24:55,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-07-06 20:24:55,654 INFO  L93              Difference]: Finished difference Result 90 states and 124 transitions.
[2021-07-06 20:24:55,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-07-06 20:24:55,657 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 124 transitions.
[2021-07-06 20:24:55,658 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 55
[2021-07-06 20:24:55,661 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 83 states and 117 transitions.
[2021-07-06 20:24:55,661 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 83
[2021-07-06 20:24:55,662 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 83
[2021-07-06 20:24:55,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 83 states and 117 transitions.
[2021-07-06 20:24:55,663 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-07-06 20:24:55,663 INFO  L681         BuchiCegarLoop]: Abstraction has 83 states and 117 transitions.
[2021-07-06 20:24:55,673 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states and 117 transitions.
[2021-07-06 20:24:55,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2021-07-06 20:24:55,685 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:55,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions.
[2021-07-06 20:24:55,687 INFO  L704         BuchiCegarLoop]: Abstraction has 83 states and 117 transitions.
[2021-07-06 20:24:55,687 INFO  L587         BuchiCegarLoop]: Abstraction has 83 states and 117 transitions.
[2021-07-06 20:24:55,687 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2021-07-06 20:24:55,688 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 117 transitions.
[2021-07-06 20:24:55,690 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 55
[2021-07-06 20:24:55,691 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-07-06 20:24:55,691 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-07-06 20:24:55,692 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:55,692 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:55,693 INFO  L791   eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);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~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);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);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 213#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 214#L67 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 277#L75 main_#t~ret45 := valid_product_#res;main_~tmp~5 := main_#t~ret45;havoc main_#t~ret45; 280#L540 assume 0 != main_~tmp~5; 278#L517 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 251#L345-1 
[2021-07-06 20:24:55,695 INFO  L793   eck$LassoCheckResult]: Loop: 251#L345-1 assume !false; 203#L274 assume test_~splverifierCounter~0 < 4; 204#L275 test_~tmp~3 := test_#t~nondet28;havoc test_#t~nondet28; 224#L283 assume !(0 != test_~tmp~3); 254#L283-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 215#L293 assume !(0 != test_~tmp___0~1); 208#L293-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 198#L303 assume 0 != test_~tmp___2~0; 199#L309-2 assume !(0 != ~pumpRunning~0); 242#L97 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 274#L129 assume !(0 == ~pumpRunning~0); 255#L104 havoc __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_#t~ret33, __utac_acc__Specification3_spec__1_#t~ret34, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~4;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~5;havoc isMethaneLevelCritical_~retValue_acc~5;isMethaneLevelCritical_~retValue_acc~5 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~5; 264#L407-1 __utac_acc__Specification3_spec__1_#t~ret32 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret32;havoc __utac_acc__Specification3_spec__1_#t~ret32; 265#L339 assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 251#L345-1 
[2021-07-06 20:24:55,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,696 INFO  L82        PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times
[2021-07-06 20:24:55,696 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,697 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742636259]
[2021-07-06 20:24:55,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,697 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,737 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,759 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,779 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:55,782 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,782 INFO  L82        PathProgramCache]: Analyzing trace with hash -619089842, now seen corresponding path program 1 times
[2021-07-06 20:24:55,782 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,783 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932881184]
[2021-07-06 20:24:55,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,783 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-07-06 20:24:55,795 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,795 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-07-06 20:24:55,796 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,796 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,799 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,800 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-07-06 20:24:55,800 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:55,800 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-07-06 20:24:55,801 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932881184]
[2021-07-06 20:24:55,801 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932881184] provided 1 perfect and 0 imperfect interpolant sequences
[2021-07-06 20:24:55,801 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-07-06 20:24:55,801 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-07-06 20:24:55,802 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885603117]
[2021-07-06 20:24:55,802 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-07-06 20:24:55,802 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-07-06 20:24:55,803 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-07-06 20:24:55,803 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-07-06 20:24:55,804 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:55,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-07-06 20:24:55,841 INFO  L93              Difference]: Finished difference Result 130 states and 177 transitions.
[2021-07-06 20:24:55,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-07-06 20:24:55,842 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 177 transitions.
[2021-07-06 20:24:55,844 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 90
[2021-07-06 20:24:55,844 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 177 transitions.
[2021-07-06 20:24:55,845 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 130
[2021-07-06 20:24:55,845 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 130
[2021-07-06 20:24:55,845 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 130 states and 177 transitions.
[2021-07-06 20:24:55,846 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-07-06 20:24:55,846 INFO  L681         BuchiCegarLoop]: Abstraction has 130 states and 177 transitions.
[2021-07-06 20:24:55,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states and 177 transitions.
[2021-07-06 20:24:55,850 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130.
[2021-07-06 20:24:55,851 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:55,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions.
[2021-07-06 20:24:55,851 INFO  L704         BuchiCegarLoop]: Abstraction has 130 states and 177 transitions.
[2021-07-06 20:24:55,852 INFO  L587         BuchiCegarLoop]: Abstraction has 130 states and 177 transitions.
[2021-07-06 20:24:55,852 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2021-07-06 20:24:55,852 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 177 transitions.
[2021-07-06 20:24:55,853 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 90
[2021-07-06 20:24:55,853 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-07-06 20:24:55,853 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-07-06 20:24:55,853 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:55,853 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:55,854 INFO  L791   eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);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~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);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);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 430#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 431#L67 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 505#L75 main_#t~ret45 := valid_product_#res;main_~tmp~5 := main_#t~ret45;havoc main_#t~ret45; 512#L540 assume 0 != main_~tmp~5; 507#L517 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 508#L345-1 
[2021-07-06 20:24:55,854 INFO  L793   eck$LassoCheckResult]: Loop: 508#L345-1 assume !false; 422#L274 assume test_~splverifierCounter~0 < 4; 423#L275 test_~tmp~3 := test_#t~nondet28;havoc test_#t~nondet28; 443#L283 assume !(0 != test_~tmp~3); 470#L283-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 434#L293 assume !(0 != test_~tmp___0~1); 427#L293-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 417#L303 assume 0 != test_~tmp___2~0; 418#L309-2 assume !(0 != ~pumpRunning~0); 500#L97 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 502#L129 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~7;havoc isHighWaterSensorDry_~retValue_acc~7; 497#L447 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~7 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~7; 498#L452 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 465#L249 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 464#L249-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 432#L255 processEnvironment_#t~ret8 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret8;havoc processEnvironment_#t~ret8; 433#L133 assume !(0 != processEnvironment_~tmp~0); 476#L104 havoc __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_#t~ret33, __utac_acc__Specification3_spec__1_#t~ret34, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~4;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~5;havoc isMethaneLevelCritical_~retValue_acc~5;isMethaneLevelCritical_~retValue_acc~5 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~5; 545#L407-1 __utac_acc__Specification3_spec__1_#t~ret32 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret32;havoc __utac_acc__Specification3_spec__1_#t~ret32; 541#L339 assume 0 != __utac_acc__Specification3_spec__1_~tmp~4; 508#L345-1 
[2021-07-06 20:24:55,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,854 INFO  L82        PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times
[2021-07-06 20:24:55,855 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,855 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828254260]
[2021-07-06 20:24:55,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,855 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,873 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,890 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,896 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:55,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,897 INFO  L82        PathProgramCache]: Analyzing trace with hash -21695270, now seen corresponding path program 1 times
[2021-07-06 20:24:55,897 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,897 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669929771]
[2021-07-06 20:24:55,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,897 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,907 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:55,915 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:55,917 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:55,918 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:55,918 INFO  L82        PathProgramCache]: Analyzing trace with hash -6983296, now seen corresponding path program 1 times
[2021-07-06 20:24:55,918 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:55,918 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868882092]
[2021-07-06 20:24:55,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:55,918 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:55,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-07-06 20:24:55,950 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,950 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,952 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,953 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,955 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:55,956 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-07-06 20:24:55,959 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:55,959 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-07-06 20:24:55,960 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868882092]
[2021-07-06 20:24:55,960 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868882092] provided 1 perfect and 0 imperfect interpolant sequences
[2021-07-06 20:24:55,960 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-07-06 20:24:55,960 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-07-06 20:24:55,961 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492635749]
[2021-07-06 20:24:56,025 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:56,028 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67
[2021-07-06 20:24:56,066 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-07-06 20:24:56,067 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-07-06 20:24:56,067 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-07-06 20:24:56,067 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:24:56,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-07-06 20:24:56,175 INFO  L93              Difference]: Finished difference Result 434 states and 594 transitions.
[2021-07-06 20:24:56,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-07-06 20:24:56,176 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 594 transitions.
[2021-07-06 20:24:56,179 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 314
[2021-07-06 20:24:56,182 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 594 transitions.
[2021-07-06 20:24:56,182 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 434
[2021-07-06 20:24:56,184 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 434
[2021-07-06 20:24:56,184 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 434 states and 594 transitions.
[2021-07-06 20:24:56,188 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-07-06 20:24:56,188 INFO  L681         BuchiCegarLoop]: Abstraction has 434 states and 594 transitions.
[2021-07-06 20:24:56,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 434 states and 594 transitions.
[2021-07-06 20:24:56,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 254.
[2021-07-06 20:24:56,207 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:24:56,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 340 transitions.
[2021-07-06 20:24:56,209 INFO  L704         BuchiCegarLoop]: Abstraction has 254 states and 340 transitions.
[2021-07-06 20:24:56,211 INFO  L587         BuchiCegarLoop]: Abstraction has 254 states and 340 transitions.
[2021-07-06 20:24:56,211 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2021-07-06 20:24:56,211 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 340 transitions.
[2021-07-06 20:24:56,212 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 180
[2021-07-06 20:24:56,213 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-07-06 20:24:56,213 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-07-06 20:24:56,214 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-07-06 20:24:56,214 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:24:56,215 INFO  L791   eck$LassoCheckResult]: Stem: 1037#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #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(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);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~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);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);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 1012#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~5;havoc main_~retValue_acc~8;havoc main_~tmp~5; 1013#L67 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 1090#L75 main_#t~ret45 := valid_product_#res;main_~tmp~5 := main_#t~ret45;havoc main_#t~ret45; 1101#L540 assume 0 != main_~tmp~5; 1092#L517 havoc test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_~splverifierCounter~0, test_~tmp~3, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~3;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1055#L345-1 
[2021-07-06 20:24:56,215 INFO  L793   eck$LassoCheckResult]: Loop: 1055#L345-1 assume !false; 1004#L274 assume test_~splverifierCounter~0 < 4; 1005#L275 test_~tmp~3 := test_#t~nondet28;havoc test_#t~nondet28; 1026#L283 assume !(0 != test_~tmp~3); 1051#L283-1 test_~tmp___0~1 := test_#t~nondet29;havoc test_#t~nondet29; 1016#L293 assume !(0 != test_~tmp___0~1); 1017#L293-1 test_~tmp___2~0 := test_#t~nondet30;havoc test_#t~nondet30; 999#L303 assume 0 != test_~tmp___2~0; 1000#L309-2 assume !(0 != ~pumpRunning~0); 1083#L97 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~0;havoc processEnvironment_~tmp~0; 1229#L129 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~7;havoc isHighWaterSensorDry_~retValue_acc~7; 1226#L447 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~7 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~7; 1223#L452 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 1221#L249 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 1219#L249-2 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 1217#L255 processEnvironment_#t~ret8 := isHighWaterLevel_#res;processEnvironment_~tmp~0 := processEnvironment_#t~ret8;havoc processEnvironment_#t~ret8; 1058#L133 assume !(0 != processEnvironment_~tmp~0); 1059#L104 havoc __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_#t~ret33, __utac_acc__Specification3_spec__1_#t~ret34, __utac_acc__Specification3_spec__1_~tmp~4, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~4;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~5;havoc isMethaneLevelCritical_~retValue_acc~5;isMethaneLevelCritical_~retValue_acc~5 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~5; 1074#L407-1 __utac_acc__Specification3_spec__1_#t~ret32 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~4 := __utac_acc__Specification3_spec__1_#t~ret32;havoc __utac_acc__Specification3_spec__1_#t~ret32; 1215#L339 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~6;havoc getWaterLevel_~retValue_acc~6;getWaterLevel_~retValue_acc~6 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~6; 1214#L439 __utac_acc__Specification3_spec__1_#t~ret33 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret33;havoc __utac_acc__Specification3_spec__1_#t~ret33; 1054#L345 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1055#L345-1 
[2021-07-06 20:24:56,217 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:56,218 INFO  L82        PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times
[2021-07-06 20:24:56,218 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:56,218 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341326388]
[2021-07-06 20:24:56,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:56,218 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:56,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,252 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,273 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,280 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:56,280 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:56,280 INFO  L82        PathProgramCache]: Analyzing trace with hash 625688428, now seen corresponding path program 1 times
[2021-07-06 20:24:56,280 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:56,283 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49518572]
[2021-07-06 20:24:56,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:56,283 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:56,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,289 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,295 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,298 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:56,299 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-07-06 20:24:56,299 INFO  L82        PathProgramCache]: Analyzing trace with hash 1878993554, now seen corresponding path program 1 times
[2021-07-06 20:24:56,299 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-07-06 20:24:56,299 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839051105]
[2021-07-06 20:24:56,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-07-06 20:24:56,299 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-07-06 20:24:56,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,333 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-07-06 20:24:56,358 INFO  L224             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-07-06 20:24:56,372 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-07-06 20:24:56,476 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:24:56,478 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75
[2021-07-06 20:25:35,644 WARN  L205               SmtUtils]: Spent 39.10 s on a formula simplification. DAG size of input: 491 DAG size of output: 433
[2021-07-06 20:25:35,679 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-07-06 20:25:35,705 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127
[2021-07-06 20:25:56,063 WARN  L205               SmtUtils]: Spent 20.36 s on a formula simplification that was a NOOP. DAG size: 433
[2021-07-06 20:25:56,185 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:25:56 BoogieIcfgContainer
[2021-07-06 20:25:56,186 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2021-07-06 20:25:56,186 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-07-06 20:25:56,186 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-07-06 20:25:56,186 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-07-06 20:25:56,187 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:54" (3/4) ...
[2021-07-06 20:25:56,188 INFO  L134         WitnessPrinter]: Generating witness for non-termination counterexample
[2021-07-06 20:25:56,225 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-07-06 20:25:56,225 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-07-06 20:25:56,226 INFO  L168              Benchmark]: Toolchain (without parser) took 62439.75 ms. Allocated memory was 60.8 MB in the beginning and 121.6 MB in the end (delta: 60.8 MB). Free memory was 37.4 MB in the beginning and 46.8 MB in the end (delta: -9.4 MB). Peak memory consumption was 52.5 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,226 INFO  L168              Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 41.5 MB in the beginning and 41.5 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,227 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 366.89 ms. Allocated memory is still 60.8 MB. Free memory was 37.1 MB in the beginning and 33.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,227 INFO  L168              Benchmark]: Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 60.8 MB. Free memory was 33.9 MB in the beginning and 30.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,231 INFO  L168              Benchmark]: Boogie Preprocessor took 35.81 ms. Allocated memory is still 60.8 MB. Free memory was 30.8 MB in the beginning and 28.5 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:25:56,232 INFO  L168              Benchmark]: RCFGBuilder took 637.87 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 28.5 MB in the beginning and 45.8 MB in the end (delta: -17.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,232 INFO  L168              Benchmark]: BuchiAutomizer took 61307.76 ms. Allocated memory was 75.5 MB in the beginning and 121.6 MB in the end (delta: 46.1 MB). Free memory was 45.5 MB in the beginning and 49.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,232 INFO  L168              Benchmark]: Witness Printer took 39.09 ms. Allocated memory is still 121.6 MB. Free memory was 49.9 MB in the beginning and 46.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
[2021-07-06 20:25:56,233 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 41.5 MB in the beginning and 41.5 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 366.89 ms. Allocated memory is still 60.8 MB. Free memory was 37.1 MB in the beginning and 33.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 60.8 MB. Free memory was 33.9 MB in the beginning and 30.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 35.81 ms. Allocated memory is still 60.8 MB. Free memory was 30.8 MB in the beginning and 28.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 637.87 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 28.5 MB in the beginning and 45.8 MB in the end (delta: -17.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB.
 * BuchiAutomizer took 61307.76 ms. Allocated memory was 75.5 MB in the beginning and 121.6 MB in the end (delta: 46.1 MB). Free memory was 45.5 MB in the beginning and 49.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.1 GB.
 * Witness Printer took 39.09 ms. Allocated memory is still 121.6 MB. Free memory was 49.9 MB in the beginning and 46.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 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 6 locations. The remainder module has 254 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 61.2s and 4 iterations.  TraceHistogramMax:1. Analysis of lassos took 60.7s. 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 42.3ms 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: 392 SDtfs, 891 SDslu, 536 SDs, 0 SdLazy, 108 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 186.5ms Time	LassoAnalysisResults: nont1 unkn0 SFLI1 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: 273]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite execution
State at position 0 is
{NULL=18336}
State at position 1 is
{NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8e794d9=0, NULL=18336, NULL=0, NULL=30694, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c6444e0=0, NULL=30685, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f999cc=0, tmp=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3597a7e4=0, NULL=0, NULL=30697, NULL=0, tmp___1=0, NULL=0, NULL=30680, NULL=30704, cleanupTimeShifts=4, NULL=30684, tmp=0, NULL=30702, waterLevel=1, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@665c5023=0, NULL=30699, \result=1, head=0, pumpRunning=0, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38e78749=0, NULL=30698, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cc1e030=0, NULL=0, tmp=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b73a029=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e511764=54, NULL=0, NULL=0, NULL=30695, NULL=0, NULL=0, tmp=1, NULL=0, retValue_acc=1, NULL=0, tmp___0=0, NULL=30687, NULL=30692, NULL=30696, tmp=0, head=0, NULL=0, NULL=30705, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c08fd96=0, NULL=0, NULL=0, NULL=30682, retValue_acc=0, tmp___0=0, NULL=0, NULL=0, NULL=30693, NULL=0, NULL=0, tmp___0=1, NULL=0, systemActive=1, NULL=30688, \result=1, NULL=0, NULL=30703, \result=0, retValue_acc=0, NULL=30683, NULL=30686, \result=0, NULL=18337, NULL=0, NULL=0, NULL=30691, NULL=30681, NULL=30706, retValue_acc=1, tmp___2=54, splverifierCounter=0, NULL=0, \result=0, NULL=30701, tmp___1=0, NULL=0, NULL=0, NULL=30690, NULL=0, NULL=30700, NULL=30689}
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 1]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L89]              int pumpRunning  =    0;
[L90]              int systemActive  =    1;
[L364]             int waterLevel  =    1;
[L365]             int methaneLevelCritical  =    0;
[L458]             int cleanupTimeShifts  =    4;
[L723]             static struct __ACC__ERR *head  =    (struct __ACC__ERR *)0;
[L531]             int retValue_acc ;
[L532]             int tmp ;
[L71]              int retValue_acc ;
[L74]              retValue_acc = 1
[L75]              return (retValue_acc);
[L538]             tmp = valid_product()
[L540]  COND TRUE  \read(tmp)
[L264]             int splverifierCounter ;
[L265]             int tmp ;
[L266]             int tmp___0 ;
[L267]             int tmp___1 ;
[L268]             int tmp___2 ;
[L271]             splverifierCounter = 0
Loop:
[L273]  COND TRUE   1
[L275]  COND TRUE   splverifierCounter < 4
[L281]              tmp = __VERIFIER_nondet_int()
[L283]  COND FALSE  !(\read(tmp))
[L291]              tmp___0 = __VERIFIER_nondet_int()
[L293]  COND FALSE  !(\read(tmp___0))
[L301]              tmp___2 = __VERIFIER_nondet_int()
[L303]  COND TRUE   \read(tmp___2)
[L97]   COND FALSE  !(\read(pumpRunning))
[L104]  COND TRUE   \read(systemActive)
[L126]              int tmp ;
[L129]  COND TRUE   ! pumpRunning
[L241]              int retValue_acc ;
[L242]              int tmp ;
[L243]              int tmp___0 ;
[L444]              int retValue_acc ;
[L447]  COND TRUE   waterLevel < 2
[L448]              retValue_acc = 1
[L449]              return (retValue_acc);
[L247]              tmp = isHighWaterSensorDry()
[L249]  COND TRUE   \read(tmp)
[L250]              tmp___0 = 0
[L254]              retValue_acc = tmp___0
[L255]              return (retValue_acc);
[L131]              tmp = isHighWaterLevel()
[L133]  COND FALSE  !(\read(tmp))
[L331]              int tmp ;
[L332]              int tmp___0 ;
[L333]              int tmp___1 ;
[L403]              int retValue_acc ;
[L406]              retValue_acc = methaneLevelCritical
[L407]              return (retValue_acc);
[L337]              tmp = isMethaneLevelCritical()
[L339]  COND FALSE  !(\read(tmp))
[L435]              int retValue_acc ;
[L438]              retValue_acc = waterLevel
[L439]              return (retValue_acc);
[L343]              tmp___0 = getWaterLevel()
[L345]  COND FALSE  !(tmp___0 == 2)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2021-07-06 20:25:56,275 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...