./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product39.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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_product39.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 5381b58f81d44aa70d19c6d31d0ce960b58130fb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 03:58:27,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 03:58:27,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 03:58:27,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 03:58:27,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 03:58:27,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 03:58:27,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 03:58:27,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 03:58:27,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 03:58:27,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 03:58:27,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 03:58:27,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 03:58:27,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 03:58:27,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 03:58:27,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 03:58:27,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 03:58:27,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 03:58:27,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 03:58:27,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 03:58:27,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 03:58:27,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 03:58:27,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 03:58:27,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 03:58:27,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 03:58:27,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 03:58:27,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 03:58:27,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 03:58:27,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 03:58:27,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 03:58:27,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 03:58:27,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 03:58:27,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 03:58:27,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 03:58:27,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 03:58:27,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 03:58:27,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 03:58:27,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 03:58:27,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 03:58:27,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 03:58:27,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 03:58:27,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 03:58:27,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 03:58:27,880 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 03:58:27,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 03:58:27,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 03:58:27,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 03:58:27,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 03:58:27,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 03:58:27,882 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 03:58:27,883 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 03:58:27,883 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 03:58:27,883 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 03:58:27,883 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 03:58:27,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 03:58:27,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 03:58:27,885 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 03:58:27,886 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 03:58:27,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 03:58:27,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 03:58:27,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 03:58:27,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 03:58:27,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 03:58:27,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 03:58:27,887 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 03:58:27,887 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 -> 5381b58f81d44aa70d19c6d31d0ce960b58130fb [2021-08-31 03:58:28,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 03:58:28,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 03:58:28,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 03:58:28,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 03:58:28,261 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 03:58:28,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product39.cil.c [2021-08-31 03:58:28,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98601b32e/cc693ea65c4a4b06bcb002d5ca19bdc6/FLAG4f06d94a4 [2021-08-31 03:58:28,734 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 03:58:28,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product39.cil.c [2021-08-31 03:58:28,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98601b32e/cc693ea65c4a4b06bcb002d5ca19bdc6/FLAG4f06d94a4 [2021-08-31 03:58:28,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98601b32e/cc693ea65c4a4b06bcb002d5ca19bdc6 [2021-08-31 03:58:28,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 03:58:28,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 03:58:28,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 03:58:28,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 03:58:28,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 03:58:28,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:58:28" (1/1) ... [2021-08-31 03:58:28,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56483fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:28, skipping insertion in model container [2021-08-31 03:58:28,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:58:28" (1/1) ... [2021-08-31 03:58:28,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 03:58:28,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 03:58:28,958 WARN L228 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_product39.cil.c[6762,6775] [2021-08-31 03:58:28,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 03:58:28,993 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 03:58:29,013 WARN L228 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_product39.cil.c[6762,6775] [2021-08-31 03:58:29,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 03:58:29,046 INFO L208 MainTranslator]: Completed translation [2021-08-31 03:58:29,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29 WrapperNode [2021-08-31 03:58:29,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 03:58:29,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 03:58:29,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 03:58:29,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 03:58:29,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 03:58:29,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 03:58:29,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 03:58:29,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 03:58:29,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 03:58:29,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 03:58:29,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 03:58:29,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 03:58:29,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (1/1) ... [2021-08-31 03:58:29,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 03:58:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 03:58:29,152 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-08-31 03:58:29,177 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-08-31 03:58:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 03:58:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 03:58:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 03:58:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 03:58:29,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 03:58:29,612 INFO L299 CfgBuilder]: Removed 166 assume(true) statements. [2021-08-31 03:58:29,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:58:29 BoogieIcfgContainer [2021-08-31 03:58:29,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 03:58:29,615 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 03:58:29,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 03:58:29,618 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 03:58:29,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 03:58:29,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 03:58:28" (1/3) ... [2021-08-31 03:58:29,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@624683dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 03:58:29, skipping insertion in model container [2021-08-31 03:58:29,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 03:58:29,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:58:29" (2/3) ... [2021-08-31 03:58:29,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@624683dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 03:58:29, skipping insertion in model container [2021-08-31 03:58:29,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 03:58:29,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:58:29" (3/3) ... [2021-08-31 03:58:29,621 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product39.cil.c [2021-08-31 03:58:29,654 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 03:58:29,654 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 03:58:29,654 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 03:58:29,654 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 03:58:29,654 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 03:58:29,654 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 03:58:29,654 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 03:58:29,654 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 03:58:29,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 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-08-31 03:58:29,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-08-31 03:58:29,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 03:58:29,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 03:58:29,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 03:58:29,698 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 03:58:29,698 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 03:58:29,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 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-08-31 03:58:29,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-08-31 03:58:29,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 03:58:29,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 03:58:29,709 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 03:58:29,709 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 03:58:29,717 INFO L791 eck$LassoCheckResult]: Stem: 106#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~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(77, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(101, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(116, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(104, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string13.base, #t~string13.offset, 1);call write~init~int(82, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(73, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(84, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 4 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(75, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 1 + #t~string17.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(80, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(117, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(109, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(112, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(110, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 3 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(32, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 37#L-1true havoc main_#res;havoc main_#t~ret77, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 105#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; 56#L75true main_#t~ret77 := valid_product_#res;main_~tmp~7 := main_#t~ret77;havoc main_#t~ret77; 93#L906true assume 0 != main_~tmp~7; 32#L883true havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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; 73#L935-1true [2021-08-31 03:58:29,718 INFO L793 eck$LassoCheckResult]: Loop: 73#L935-1true assume !false; 17#L393true assume test_~splverifierCounter~0 < 4; 14#L394true test_~tmp~3 := test_#t~nondet38;havoc test_#t~nondet38; 84#L402true assume !(0 != test_~tmp~3); 6#L402-1true test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 54#L412true assume !(0 != test_~tmp___0~1); 86#L412-1true test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 15#L422true assume 0 != test_~tmp___2~0; 66#L428-1true assume !(0 != ~pumpRunning~0); 98#L195true assume !(0 != ~systemActive~0); 81#L202true havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 115#L130-1true __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 67#L929true assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 73#L935-1true [2021-08-31 03:58:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-08-31 03:58:29,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:29,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389454835] [2021-08-31 03:58:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:29,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:29,925 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:30,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1671401922, now seen corresponding path program 1 times [2021-08-31 03:58:30,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:30,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472590040] [2021-08-31 03:58:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:30,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:30,032 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:30,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:30,046 INFO L82 PathProgramCache]: Analyzing trace with hash 42877016, now seen corresponding path program 1 times [2021-08-31 03:58:30,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:30,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819740881] [2021-08-31 03:58:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:30,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 03:58:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 03:58:30,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 03:58:30,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819740881] [2021-08-31 03:58:30,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819740881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 03:58:30,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 03:58:30,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 03:58:30,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823163521] [2021-08-31 03:58:30,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 03:58:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-31 03:58:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-31 03:58:30,283 INFO L87 Difference]: Start difference. First operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 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) 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-08-31 03:58:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 03:58:31,010 INFO L93 Difference]: Finished difference Result 282 states and 405 transitions. [2021-08-31 03:58:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 03:58:31,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 405 transitions. [2021-08-31 03:58:31,018 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 181 [2021-08-31 03:58:31,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 261 states and 384 transitions. [2021-08-31 03:58:31,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2021-08-31 03:58:31,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2021-08-31 03:58:31,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 384 transitions. [2021-08-31 03:58:31,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 03:58:31,025 INFO L681 BuchiCegarLoop]: Abstraction has 261 states and 384 transitions. [2021-08-31 03:58:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 384 transitions. [2021-08-31 03:58:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 156. [2021-08-31 03:58:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.4615384615384615) internal successors, (228), 155 states have internal predecessors, (228), 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-08-31 03:58:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2021-08-31 03:58:31,047 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 228 transitions. [2021-08-31 03:58:31,047 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 228 transitions. [2021-08-31 03:58:31,047 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 03:58:31,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 228 transitions. [2021-08-31 03:58:31,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2021-08-31 03:58:31,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 03:58:31,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 03:58:31,049 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 03:58:31,049 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 03:58:31,049 INFO L791 eck$LassoCheckResult]: Stem: 524#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~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(77, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(101, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(116, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(104, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string13.base, #t~string13.offset, 1);call write~init~int(82, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(73, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(84, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 4 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(75, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 1 + #t~string17.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(80, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(117, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(109, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(112, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(110, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 3 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(32, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 473#L-1 havoc main_#res;havoc main_#t~ret77, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 474#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; 495#L75 main_#t~ret77 := valid_product_#res;main_~tmp~7 := main_#t~ret77;havoc main_#t~ret77; 496#L906 assume 0 != main_~tmp~7; 465#L883 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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; 466#L935-1 [2021-08-31 03:58:31,050 INFO L793 eck$LassoCheckResult]: Loop: 466#L935-1 assume !false; 438#L393 assume test_~splverifierCounter~0 < 4; 433#L394 test_~tmp~3 := test_#t~nondet38;havoc test_#t~nondet38; 434#L402 assume !(0 != test_~tmp~3); 420#L402-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 421#L412 assume !(0 != test_~tmp___0~1); 423#L412-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 435#L422 assume 0 != test_~tmp___2~0; 436#L428-1 assume !(0 != ~pumpRunning~0); 463#L195 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret19, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 514#L253 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret18, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 443#L227-1 assume !(0 == ~pumpRunning~0); 445#L202 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 515#L130-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 504#L929 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 466#L935-1 [2021-08-31 03:58:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-08-31 03:58:31,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:31,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593818654] [2021-08-31 03:58:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:31,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,074 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1955219765, now seen corresponding path program 1 times [2021-08-31 03:58:31,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:31,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834052708] [2021-08-31 03:58:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:31,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 03:58:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 03:58:31,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 03:58:31,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834052708] [2021-08-31 03:58:31,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834052708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 03:58:31,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 03:58:31,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 03:58:31,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804678874] [2021-08-31 03:58:31,117 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 03:58:31,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 03:58:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 03:58:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 03:58:31,118 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. cyclomatic complexity: 75 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 03:58:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 03:58:31,364 INFO L93 Difference]: Finished difference Result 201 states and 277 transitions. [2021-08-31 03:58:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 03:58:31,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 277 transitions. [2021-08-31 03:58:31,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2021-08-31 03:58:31,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 201 states and 277 transitions. [2021-08-31 03:58:31,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2021-08-31 03:58:31,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2021-08-31 03:58:31,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 277 transitions. [2021-08-31 03:58:31,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 03:58:31,368 INFO L681 BuchiCegarLoop]: Abstraction has 201 states and 277 transitions. [2021-08-31 03:58:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 277 transitions. [2021-08-31 03:58:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-08-31 03:58:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 200 states have internal predecessors, (277), 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-08-31 03:58:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 277 transitions. [2021-08-31 03:58:31,374 INFO L704 BuchiCegarLoop]: Abstraction has 201 states and 277 transitions. [2021-08-31 03:58:31,374 INFO L587 BuchiCegarLoop]: Abstraction has 201 states and 277 transitions. [2021-08-31 03:58:31,374 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 03:58:31,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 277 transitions. [2021-08-31 03:58:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2021-08-31 03:58:31,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 03:58:31,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 03:58:31,376 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 03:58:31,376 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 03:58:31,376 INFO L791 eck$LassoCheckResult]: Stem: 907#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~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(77, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(101, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(116, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(104, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string13.base, #t~string13.offset, 1);call write~init~int(82, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(73, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(84, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 4 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(75, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 1 + #t~string17.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(80, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(117, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(109, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(112, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(110, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 3 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(32, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 838#L-1 havoc main_#res;havoc main_#t~ret77, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 839#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; 863#L75 main_#t~ret77 := valid_product_#res;main_~tmp~7 := main_#t~ret77;havoc main_#t~ret77; 864#L906 assume 0 != main_~tmp~7; 829#L883 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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; 830#L935-1 [2021-08-31 03:58:31,376 INFO L793 eck$LassoCheckResult]: Loop: 830#L935-1 assume !false; 803#L393 assume test_~splverifierCounter~0 < 4; 798#L394 test_~tmp~3 := test_#t~nondet38;havoc test_#t~nondet38; 799#L402 assume !(0 != test_~tmp~3); 784#L402-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 785#L412 assume !(0 != test_~tmp___0~1); 787#L412-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 800#L422 assume 0 != test_~tmp___2~0; 801#L428-1 assume !(0 != ~pumpRunning~0); 900#L195 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret19, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 886#L253 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret18, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 808#L227-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret37, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 809#L170-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 856#L175-1 isHighWaterLevel_#t~ret37 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret37;havoc isHighWaterLevel_#t~ret37; 866#L355-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 867#L355-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 805#L361-1 processEnvironment__wrappee__highWaterSensor_#t~ret18 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret18;havoc processEnvironment__wrappee__highWaterSensor_#t~ret18; 806#L231-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 845#L202 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 973#L130-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 970#L929 assume 0 != __utac_acc__Specification3_spec__1_~tmp~8; 830#L935-1 [2021-08-31 03:58:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-08-31 03:58:31,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:31,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846243513] [2021-08-31 03:58:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:31,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,395 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1592970081, now seen corresponding path program 1 times [2021-08-31 03:58:31,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:31,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533395942] [2021-08-31 03:58:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:31,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,427 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:31,430 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2049041275, now seen corresponding path program 1 times [2021-08-31 03:58:31,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:31,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801459171] [2021-08-31 03:58:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:31,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 03:58:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 03:58:31,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 03:58:31,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801459171] [2021-08-31 03:58:31,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801459171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 03:58:31,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 03:58:31,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 03:58:31,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427503638] [2021-08-31 03:58:31,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 03:58:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 03:58:31,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 03:58:31,609 INFO L87 Difference]: Start difference. First operand 201 states and 277 transitions. cyclomatic complexity: 79 Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08-31 03:58:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 03:58:32,269 INFO L93 Difference]: Finished difference Result 663 states and 915 transitions. [2021-08-31 03:58:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-31 03:58:32,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 663 states and 915 transitions. [2021-08-31 03:58:32,273 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 495 [2021-08-31 03:58:32,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 663 states to 663 states and 915 transitions. [2021-08-31 03:58:32,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 663 [2021-08-31 03:58:32,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2021-08-31 03:58:32,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 663 states and 915 transitions. [2021-08-31 03:58:32,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 03:58:32,278 INFO L681 BuchiCegarLoop]: Abstraction has 663 states and 915 transitions. [2021-08-31 03:58:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states and 915 transitions. [2021-08-31 03:58:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 396. [2021-08-31 03:58:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 1.3535353535353536) internal successors, (536), 395 states have internal predecessors, (536), 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-08-31 03:58:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 536 transitions. [2021-08-31 03:58:32,288 INFO L704 BuchiCegarLoop]: Abstraction has 396 states and 536 transitions. [2021-08-31 03:58:32,288 INFO L587 BuchiCegarLoop]: Abstraction has 396 states and 536 transitions. [2021-08-31 03:58:32,288 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 03:58:32,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 536 transitions. [2021-08-31 03:58:32,290 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 284 [2021-08-31 03:58:32,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 03:58:32,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 03:58:32,291 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 03:58:32,291 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 03:58:32,291 INFO L791 eck$LassoCheckResult]: Stem: 1805#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~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string11.base, #t~string11.offset, 1);call write~init~int(77, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(101, #t~string11.base, 2 + #t~string11.offset, 1);call write~init~int(116, #t~string11.base, 3 + #t~string11.offset, 1);call write~init~int(104, #t~string11.base, 4 + #t~string11.offset, 1);call write~init~int(58, #t~string11.base, 5 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 6 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string13.base, #t~string13.offset, 1);call write~init~int(82, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(73, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(84, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 4 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string15.base, #t~string15.offset, 1);call write~init~int(75, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 2 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string17.base, #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 1 + #t~string17.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(110, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(102, #t~string26.base, 2 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 3 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string28.base, #t~string28.offset, 1);call write~init~int(80, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(117, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(109, #t~string28.base, 3 + #t~string28.offset, 1);call write~init~int(112, #t~string28.base, 4 + #t~string28.offset, 1);call write~init~int(58, #t~string28.base, 5 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 6 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(110, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string32.base, #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(102, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 3 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string34.base, #t~string34.offset, 1);call write~init~int(32, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string36.base, #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 1 + #t~string36.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(30);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(9);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 1720#L-1 havoc main_#res;havoc main_#t~ret77, main_~retValue_acc~11, main_~tmp~7;havoc main_~retValue_acc~11;havoc main_~tmp~7; 1721#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; 1751#L75 main_#t~ret77 := valid_product_#res;main_~tmp~7 := main_#t~ret77;havoc main_#t~ret77; 1752#L906 assume 0 != main_~tmp~7; 1712#L883 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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; 1713#L935-1 [2021-08-31 03:58:32,291 INFO L793 eck$LassoCheckResult]: Loop: 1713#L935-1 assume !false; 1996#L393 assume test_~splverifierCounter~0 < 4; 1679#L394 test_~tmp~3 := test_#t~nondet38;havoc test_#t~nondet38; 1680#L402 assume !(0 != test_~tmp~3); 2040#L402-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 2039#L412 assume !(0 != test_~tmp___0~1); 2036#L412-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 2035#L422 assume 0 != test_~tmp___2~0; 1802#L428-1 assume !(0 != ~pumpRunning~0); 2023#L195 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret19, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1973#L253 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret18, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1995#L227-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret37, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~4;havoc isHighWaterSensorDry_~retValue_acc~4; 2033#L170-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~4 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~4; 2029#L175-1 isHighWaterLevel_#t~ret37 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret37;havoc isHighWaterLevel_#t~ret37; 2021#L355-3 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~0 := 0; 1783#L355-5 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 1685#L361-1 processEnvironment__wrappee__highWaterSensor_#t~ret18 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret18;havoc processEnvironment__wrappee__highWaterSensor_#t~ret18; 1686#L231-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1729#L202 havoc __utac_acc__Specification3_spec__1_#t~ret78, __utac_acc__Specification3_spec__1_#t~ret79, __utac_acc__Specification3_spec__1_#t~ret80, __utac_acc__Specification3_spec__1_~tmp~8, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~8;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~2;havoc isMethaneLevelCritical_~retValue_acc~2;isMethaneLevelCritical_~retValue_acc~2 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~2; 2005#L130-1 __utac_acc__Specification3_spec__1_#t~ret78 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~8 := __utac_acc__Specification3_spec__1_#t~ret78;havoc __utac_acc__Specification3_spec__1_#t~ret78; 2004#L929 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~8);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~3;havoc getWaterLevel_~retValue_acc~3;getWaterLevel_~retValue_acc~3 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~3; 2003#L162 __utac_acc__Specification3_spec__1_#t~ret79 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret79;havoc __utac_acc__Specification3_spec__1_#t~ret79; 2001#L935 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1713#L935-1 [2021-08-31 03:58:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-08-31 03:58:32,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:32,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859994191] [2021-08-31 03:58:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:32,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,311 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,329 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1835898419, now seen corresponding path program 1 times [2021-08-31 03:58:32,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:32,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781926470] [2021-08-31 03:58:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:32,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,334 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,337 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:58:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 03:58:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2033651661, now seen corresponding path program 1 times [2021-08-31 03:58:32,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 03:58:32,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172633900] [2021-08-31 03:58:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 03:58:32,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 03:58:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,370 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 03:58:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 03:58:32,393 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 03:59:10,244 WARN L210 SmtUtils]: Spent 37.67s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-08-31 03:59:50,634 WARN L210 SmtUtils]: Spent 19.43s on a formula simplification that was a NOOP. DAG size: 433 [2021-08-31 03:59:50,708 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 03:59:50,710 INFO L158 Benchmark]: Toolchain (without parser) took 81946.41ms. Allocated memory was 56.6MB in the beginning and 142.6MB in the end (delta: 86.0MB). Free memory was 34.8MB in the beginning and 58.3MB in the end (delta: -23.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,710 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 03:59:50,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.51ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 56.6MB. Free memory was 31.5MB in the beginning and 28.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,711 INFO L158 Benchmark]: Boogie Preprocessor took 22.88ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 25.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,712 INFO L158 Benchmark]: RCFGBuilder took 502.35ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 25.5MB in the beginning and 48.8MB in the end (delta: -23.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,712 INFO L158 Benchmark]: BuchiAutomizer took 81094.83ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 48.8MB in the beginning and 58.3MB in the end (delta: -9.6MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2021-08-31 03:59:50,714 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.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.51ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 31.7MB in the end (delta: 2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 56.6MB. Free memory was 31.5MB in the beginning and 28.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.88ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 25.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.35ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 25.5MB in the beginning and 48.8MB in the end (delta: -23.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 81094.83ms. Allocated memory was 77.6MB in the beginning and 142.6MB in the end (delta: 65.0MB). Free memory was 48.8MB in the beginning and 58.3MB in the end (delta: -9.6MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * 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 396 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 03:59:50,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...