./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d126ee18ecb92c3c690e8a34ad047b6b98e7a02d578302f03541b84dbf3857a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:20,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:20,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:20,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:20,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:20,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:20,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:20,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:20,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:20,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:20,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:20,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:20,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:20,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:20,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:20,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:20,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:20,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:20,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:20,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:20,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:20,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:20,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:20,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:20,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:20,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:20,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:20,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:20,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:20,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:20,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:20,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:20,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:20,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:20,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:20,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:20,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:20,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:20,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:20,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:20,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:20,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:08:20,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:20,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:20,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:20,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:20,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:20,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:20,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:20,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:20,818 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:20,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:20,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:20,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:08:20,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:20,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:20,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:20,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:20,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:20,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:20,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:20,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:20,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:20,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:20,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:20,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:08:20,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:08:20,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:20,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:20,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:20,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 5d126ee18ecb92c3c690e8a34ad047b6b98e7a02d578302f03541b84dbf3857a [2022-02-20 18:08:21,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:21,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:21,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:21,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:21,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:21,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c [2022-02-20 18:08:21,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed9c1e3/eebfee0768154fa4b281257ff3eb9fdd/FLAG49f3a1a00 [2022-02-20 18:08:21,645 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:21,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c [2022-02-20 18:08:21,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed9c1e3/eebfee0768154fa4b281257ff3eb9fdd/FLAG49f3a1a00 [2022-02-20 18:08:21,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9ed9c1e3/eebfee0768154fa4b281257ff3eb9fdd [2022-02-20 18:08:21,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:21,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:21,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:21,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:21,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:21,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:21" (1/1) ... [2022-02-20 18:08:21,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbe365f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:21, skipping insertion in model container [2022-02-20 18:08:21,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:21" (1/1) ... [2022-02-20 18:08:21,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:22,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:22,174 WARN L230 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_product02.cil.c[2141,2154] [2022-02-20 18:08:22,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:22,278 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:22,312 WARN L230 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_product02.cil.c[2141,2154] [2022-02-20 18:08:22,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:22,416 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:22,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22 WrapperNode [2022-02-20 18:08:22,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:22,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:22,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:22,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:22,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,470 INFO L137 Inliner]: procedures = 50, calls = 146, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 195 [2022-02-20 18:08:22,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:22,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:22,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:22,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:22,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:22,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:22,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:22,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:22,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (1/1) ... [2022-02-20 18:08:22,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:22,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:08:22,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:08:22,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:22,582 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:22,583 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:22,583 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:22,586 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:08:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:22,587 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:22,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:22,643 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:22,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:22,964 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:22,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:22,975 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:22,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:22 BoogieIcfgContainer [2022-02-20 18:08:22,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:22,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:22,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:22,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:22,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:21" (1/3) ... [2022-02-20 18:08:22,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:22, skipping insertion in model container [2022-02-20 18:08:22,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:22" (2/3) ... [2022-02-20 18:08:22,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7786f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:22, skipping insertion in model container [2022-02-20 18:08:22,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:22" (3/3) ... [2022-02-20 18:08:22,984 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product02.cil.c [2022-02-20 18:08:22,989 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:22,989 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:23,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:23,051 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:08:23,051 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 55 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:08:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:23,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:23,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:23,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2124368460, now seen corresponding path program 1 times [2022-02-20 18:08:23,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:23,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334101128] [2022-02-20 18:08:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:08:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:23,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {68#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {68#true} is VALID [2022-02-20 18:08:23,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2022-02-20 18:08:23,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {69#false} #177#return; {69#false} is VALID [2022-02-20 18:08:23,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {68#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {68#true} is VALID [2022-02-20 18:08:23,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {68#true} is VALID [2022-02-20 18:08:23,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {68#true} is VALID [2022-02-20 18:08:23,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {68#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {68#true} is VALID [2022-02-20 18:08:23,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#true} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret44#1 && main_#t~ret44#1 <= 2147483647;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {68#true} is VALID [2022-02-20 18:08:23,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} assume 0 != main_~tmp~5#1;assume { :begin_inline_setup } true; {68#true} is VALID [2022-02-20 18:08:23,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {68#true} is VALID [2022-02-20 18:08:23,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2022-02-20 18:08:23,397 INFO L272 TraceCheckUtils]: 8: Hoare triple {69#false} call cleanup(); {69#false} is VALID [2022-02-20 18:08:23,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {69#false} havoc ~i~0;havoc ~__cil_tmp2~0; {69#false} is VALID [2022-02-20 18:08:23,398 INFO L272 TraceCheckUtils]: 10: Hoare triple {69#false} call timeShift(); {69#false} is VALID [2022-02-20 18:08:23,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {69#false} assume !(0 != ~pumpRunning~0); {69#false} is VALID [2022-02-20 18:08:23,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} assume !(0 != ~systemActive~0); {69#false} is VALID [2022-02-20 18:08:23,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {69#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {69#false} is VALID [2022-02-20 18:08:23,399 INFO L272 TraceCheckUtils]: 14: Hoare triple {69#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {68#true} is VALID [2022-02-20 18:08:23,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {68#true} is VALID [2022-02-20 18:08:23,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#true} assume true; {68#true} is VALID [2022-02-20 18:08:23,400 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {68#true} {69#false} #177#return; {69#false} is VALID [2022-02-20 18:08:23,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {69#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret37#1 && __utac_acc__Specification3_spec__1_#t~ret37#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {69#false} is VALID [2022-02-20 18:08:23,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {69#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {69#false} is VALID [2022-02-20 18:08:23,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {69#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret38#1 && __utac_acc__Specification3_spec__1_#t~ret38#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {69#false} is VALID [2022-02-20 18:08:23,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {69#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {69#false} is VALID [2022-02-20 18:08:23,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {69#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret39#1 && __utac_acc__Specification3_spec__1_#t~ret39#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {69#false} is VALID [2022-02-20 18:08:23,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {69#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {69#false} is VALID [2022-02-20 18:08:23,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {69#false} assume !false; {69#false} is VALID [2022-02-20 18:08:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:23,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:23,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334101128] [2022-02-20 18:08:23,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334101128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:23,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:23,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:23,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108239379] [2022-02-20 18:08:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:23,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:23,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:23,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:23,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:23,503 INFO L87 Difference]: Start difference. First operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 55 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:23,604 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-02-20 18:08:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:23,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 165 transitions. [2022-02-20 18:08:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 165 transitions. [2022-02-20 18:08:23,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 165 transitions. [2022-02-20 18:08:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:23,795 INFO L225 Difference]: With dead ends: 122 [2022-02-20 18:08:23,796 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 18:08:23,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:23,803 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:23,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 18:08:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 18:08:23,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:23,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:23,842 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:23,845 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:23,856 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-02-20 18:08:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:23,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:23,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:23,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 56 states. [2022-02-20 18:08:23,862 INFO L87 Difference]: Start difference. First operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 56 states. [2022-02-20 18:08:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:23,871 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-02-20 18:08:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:23,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:23,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:23,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:23,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-02-20 18:08:23,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2022-02-20 18:08:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:23,876 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-02-20 18:08:23,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:23,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:23,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:23,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:08:23,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 333753737, now seen corresponding path program 1 times [2022-02-20 18:08:23,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:23,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099130513] [2022-02-20 18:08:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:08:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:23,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {442#true} is VALID [2022-02-20 18:08:23,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume true; {442#true} is VALID [2022-02-20 18:08:23,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {442#true} {443#false} #177#return; {443#false} is VALID [2022-02-20 18:08:23,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {442#true} is VALID [2022-02-20 18:08:23,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {442#true} is VALID [2022-02-20 18:08:23,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {442#true} is VALID [2022-02-20 18:08:23,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {442#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {442#true} is VALID [2022-02-20 18:08:23,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {442#true} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret44#1 && main_#t~ret44#1 <= 2147483647;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {442#true} is VALID [2022-02-20 18:08:23,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#true} assume 0 != main_~tmp~5#1;assume { :begin_inline_setup } true; {442#true} is VALID [2022-02-20 18:08:23,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {444#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:23,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {444#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:23,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {443#false} is VALID [2022-02-20 18:08:23,946 INFO L272 TraceCheckUtils]: 9: Hoare triple {443#false} call cleanup(); {443#false} is VALID [2022-02-20 18:08:23,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {443#false} havoc ~i~0;havoc ~__cil_tmp2~0; {443#false} is VALID [2022-02-20 18:08:23,946 INFO L272 TraceCheckUtils]: 11: Hoare triple {443#false} call timeShift(); {443#false} is VALID [2022-02-20 18:08:23,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#false} assume !(0 != ~pumpRunning~0); {443#false} is VALID [2022-02-20 18:08:23,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#false} assume !(0 != ~systemActive~0); {443#false} is VALID [2022-02-20 18:08:23,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {443#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {443#false} is VALID [2022-02-20 18:08:23,947 INFO L272 TraceCheckUtils]: 15: Hoare triple {443#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {442#true} is VALID [2022-02-20 18:08:23,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {442#true} is VALID [2022-02-20 18:08:23,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {442#true} assume true; {442#true} is VALID [2022-02-20 18:08:23,948 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {442#true} {443#false} #177#return; {443#false} is VALID [2022-02-20 18:08:23,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {443#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret37#1 && __utac_acc__Specification3_spec__1_#t~ret37#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {443#false} is VALID [2022-02-20 18:08:23,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {443#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {443#false} is VALID [2022-02-20 18:08:23,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {443#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret38#1 && __utac_acc__Specification3_spec__1_#t~ret38#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {443#false} is VALID [2022-02-20 18:08:23,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {443#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {443#false} is VALID [2022-02-20 18:08:23,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {443#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret39#1 && __utac_acc__Specification3_spec__1_#t~ret39#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {443#false} is VALID [2022-02-20 18:08:23,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {443#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {443#false} is VALID [2022-02-20 18:08:23,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {443#false} assume !false; {443#false} is VALID [2022-02-20 18:08:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:23,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:23,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099130513] [2022-02-20 18:08:23,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099130513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:23,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:23,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:23,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009704941] [2022-02-20 18:08:23,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:23,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:23,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:23,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:23,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:23,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:23,977 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,051 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-02-20 18:08:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 18:08:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 18:08:24,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 18:08:24,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:24,160 INFO L225 Difference]: With dead ends: 77 [2022-02-20 18:08:24,160 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 18:08:24,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:24,167 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:24,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 18:08:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 18:08:24,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:24,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,183 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,185 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,196 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 18:08:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:24,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:24,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:24,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:24,199 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,203 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 18:08:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:24,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:24,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:24,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:24,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-02-20 18:08:24,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 26 [2022-02-20 18:08:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:24,212 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-02-20 18:08:24,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:08:24,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:24,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:24,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:08:24,216 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1606304171, now seen corresponding path program 1 times [2022-02-20 18:08:24,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:24,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850881369] [2022-02-20 18:08:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 18:08:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:24,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {719#true} is VALID [2022-02-20 18:08:24,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume true; {719#true} is VALID [2022-02-20 18:08:24,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {719#true} {720#false} #177#return; {720#false} is VALID [2022-02-20 18:08:24,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {719#true} is VALID [2022-02-20 18:08:24,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {719#true} is VALID [2022-02-20 18:08:24,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {719#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {719#true} is VALID [2022-02-20 18:08:24,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {721#(= |ULTIMATE.start_valid_product_#res#1| 1)} is VALID [2022-02-20 18:08:24,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {721#(= |ULTIMATE.start_valid_product_#res#1| 1)} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret44#1 && main_#t~ret44#1 <= 2147483647;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {722#(= |ULTIMATE.start_main_~tmp~5#1| 1)} is VALID [2022-02-20 18:08:24,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#(= |ULTIMATE.start_main_~tmp~5#1| 1)} assume 0 != main_~tmp~5#1;assume { :begin_inline_setup } true; {719#true} is VALID [2022-02-20 18:08:24,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {719#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {719#true} is VALID [2022-02-20 18:08:24,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#true} assume !false; {719#true} is VALID [2022-02-20 18:08:24,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#true} assume test_~splverifierCounter~0#1 < 4; {719#true} is VALID [2022-02-20 18:08:24,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#true} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~4#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {719#true} is VALID [2022-02-20 18:08:24,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#true} assume !(0 != test_~tmp~4#1); {719#true} is VALID [2022-02-20 18:08:24,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {719#true} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {719#true} is VALID [2022-02-20 18:08:24,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {719#true} assume !(0 != test_~tmp___0~1#1); {719#true} is VALID [2022-02-20 18:08:24,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {719#true} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {719#true} is VALID [2022-02-20 18:08:24,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {719#true} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {723#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:24,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {723#(not (= 0 ~systemActive~0))} assume { :end_inline_startSystem } true; {723#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:24,339 INFO L272 TraceCheckUtils]: 16: Hoare triple {723#(not (= 0 ~systemActive~0))} call timeShift(); {723#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:24,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {723#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {723#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:24,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {720#false} is VALID [2022-02-20 18:08:24,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {720#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {720#false} is VALID [2022-02-20 18:08:24,340 INFO L272 TraceCheckUtils]: 20: Hoare triple {720#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {719#true} is VALID [2022-02-20 18:08:24,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {719#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {719#true} is VALID [2022-02-20 18:08:24,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {719#true} assume true; {719#true} is VALID [2022-02-20 18:08:24,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {719#true} {720#false} #177#return; {720#false} is VALID [2022-02-20 18:08:24,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {720#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret37#1 && __utac_acc__Specification3_spec__1_#t~ret37#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {720#false} is VALID [2022-02-20 18:08:24,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {720#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {720#false} is VALID [2022-02-20 18:08:24,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {720#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret38#1 && __utac_acc__Specification3_spec__1_#t~ret38#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {720#false} is VALID [2022-02-20 18:08:24,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {720#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {720#false} is VALID [2022-02-20 18:08:24,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {720#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret39#1 && __utac_acc__Specification3_spec__1_#t~ret39#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {720#false} is VALID [2022-02-20 18:08:24,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {720#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {720#false} is VALID [2022-02-20 18:08:24,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 18:08:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:24,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:24,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850881369] [2022-02-20 18:08:24,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850881369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:24,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:24,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:08:24,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478550163] [2022-02-20 18:08:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 18:08:24,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:24,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:24,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:24,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:24,375 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,562 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-02-20 18:08:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 18:08:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 18:08:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-02-20 18:08:24,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-02-20 18:08:24,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:24,682 INFO L225 Difference]: With dead ends: 87 [2022-02-20 18:08:24,682 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 18:08:24,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:08:24,684 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:24,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 121 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 18:08:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 18:08:24,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:24,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,689 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,689 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,691 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 18:08:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:24,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:24,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:24,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:24,692 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,694 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 18:08:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:24,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:24,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:24,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:24,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-02-20 18:08:24,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2022-02-20 18:08:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:24,697 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-02-20 18:08:24,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 18:08:24,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:24,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:24,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:08:24,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash -35271042, now seen corresponding path program 1 times [2022-02-20 18:08:24,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:24,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668697904] [2022-02-20 18:08:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 18:08:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:24,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1015#true} is VALID [2022-02-20 18:08:24,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#true} assume true; {1015#true} is VALID [2022-02-20 18:08:24,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1015#true} {1017#(= ~waterLevel~0 1)} #177#return; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {1017#(= ~waterLevel~0 1)} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret44#1 && main_#t~ret44#1 <= 2147483647;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1017#(= ~waterLevel~0 1)} assume 0 != main_~tmp~5#1;assume { :begin_inline_setup } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(= ~waterLevel~0 1)} assume !false; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1017#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~4#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {1017#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~4#1); {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1017#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1017#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~1#1); {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {1017#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1017#(= ~waterLevel~0 1)} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_startSystem } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,784 INFO L272 TraceCheckUtils]: 16: Hoare triple {1017#(= ~waterLevel~0 1)} call timeShift(); {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {1017#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {1017#(= ~waterLevel~0 1)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :end_inline_processEnvironment } true; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,786 INFO L272 TraceCheckUtils]: 21: Hoare triple {1017#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {1015#true} is VALID [2022-02-20 18:08:24,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1015#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1015#true} is VALID [2022-02-20 18:08:24,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {1015#true} assume true; {1015#true} is VALID [2022-02-20 18:08:24,787 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1015#true} {1017#(= ~waterLevel~0 1)} #177#return; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {1017#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret37#1 && __utac_acc__Specification3_spec__1_#t~ret37#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {1017#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:24,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {1017#(= ~waterLevel~0 1)} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {1021#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:08:24,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {1021#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret38#1 && __utac_acc__Specification3_spec__1_#t~ret38#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {1022#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1|) 0)} is VALID [2022-02-20 18:08:24,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {1022#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1|) 0)} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {1016#false} is VALID [2022-02-20 18:08:24,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {1016#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret39#1 && __utac_acc__Specification3_spec__1_#t~ret39#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {1016#false} is VALID [2022-02-20 18:08:24,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {1016#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1016#false} is VALID [2022-02-20 18:08:24,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {1016#false} assume !false; {1016#false} is VALID [2022-02-20 18:08:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:24,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:24,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668697904] [2022-02-20 18:08:24,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668697904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:24,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:24,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:08:24,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222121226] [2022-02-20 18:08:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 18:08:24,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:24,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:24,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:24,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:24,819 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:24,990 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2022-02-20 18:08:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:24,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 18:08:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 18:08:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 18:08:24,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2022-02-20 18:08:25,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:25,126 INFO L225 Difference]: With dead ends: 123 [2022-02-20 18:08:25,126 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 18:08:25,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:08:25,128 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:25,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 219 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 18:08:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-02-20 18:08:25,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:25,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:25,138 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:25,138 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:25,142 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-02-20 18:08:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-02-20 18:08:25,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:25,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:25,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Second operand 83 states. [2022-02-20 18:08:25,144 INFO L87 Difference]: Start difference. First operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Second operand 83 states. [2022-02-20 18:08:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:25,147 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-02-20 18:08:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-02-20 18:08:25,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:25,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:25,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:25,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-02-20 18:08:25,152 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 32 [2022-02-20 18:08:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:25,152 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-02-20 18:08:25,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-02-20 18:08:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:08:25,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:25,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:25,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:08:25,160 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1660554524, now seen corresponding path program 1 times [2022-02-20 18:08:25,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:25,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537350549] [2022-02-20 18:08:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:25,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:25,238 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:08:25,238 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:25,239 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:25,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:08:25,244 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:08:25,246 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:25,267 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:25,268 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-02-20 18:08:25,272 INFO L158 Benchmark]: Toolchain (without parser) took 3292.88ms. Allocated memory was 88.1MB in the beginning and 142.6MB in the end (delta: 54.5MB). Free memory was 54.5MB in the beginning and 105.8MB in the end (delta: -51.3MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2022-02-20 18:08:25,273 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:25,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.75ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 54.3MB in the beginning and 82.1MB in the end (delta: -27.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:08:25,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.84ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 79.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:08:25,274 INFO L158 Benchmark]: Boogie Preprocessor took 36.97ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:25,274 INFO L158 Benchmark]: RCFGBuilder took 468.31ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 91.7MB in the end (delta: -13.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-02-20 18:08:25,274 INFO L158 Benchmark]: TraceAbstraction took 2292.95ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.7MB in the beginning and 105.8MB in the end (delta: -14.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 18:08:25,276 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 43.2MB in the beginning and 43.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.75ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 54.3MB in the beginning and 82.1MB in the end (delta: -27.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.84ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 79.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.97ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 468.31ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 91.7MB in the end (delta: -13.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2292.95ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.7MB in the beginning and 105.8MB in the end (delta: -14.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:08:25,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d126ee18ecb92c3c690e8a34ad047b6b98e7a02d578302f03541b84dbf3857a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:27,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:27,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:27,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:27,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:27,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:27,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:27,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:27,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:27,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:27,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:27,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:27,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:27,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:27,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:27,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:27,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:27,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:27,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:27,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:27,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:27,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:27,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:27,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:27,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:27,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:27,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:27,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:27,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:27,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:27,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:27,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:27,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:27,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:27,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:27,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:27,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:27,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:27,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:27,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:27,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:27,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 18:08:27,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:27,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:27,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:27,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:27,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:27,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:27,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:27,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:27,461 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:27,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:27,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:27,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:08:27,463 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:08:27,464 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:08:27,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:27,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:27,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:27,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:27,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:27,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:27,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:27,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:27,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:27,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:27,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:27,466 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:08:27,466 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:08:27,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:27,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:27,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:27,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:08:27,467 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(G ! call(reach_error())) ) 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 -> 5d126ee18ecb92c3c690e8a34ad047b6b98e7a02d578302f03541b84dbf3857a [2022-02-20 18:08:27,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:27,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:27,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:27,857 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:27,857 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:27,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c [2022-02-20 18:08:27,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41b46c45/4f315f19cece4e43aec5982cd2980a0b/FLAG48e906f64 [2022-02-20 18:08:28,396 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:28,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product02.cil.c [2022-02-20 18:08:28,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41b46c45/4f315f19cece4e43aec5982cd2980a0b/FLAG48e906f64 [2022-02-20 18:08:28,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41b46c45/4f315f19cece4e43aec5982cd2980a0b [2022-02-20 18:08:28,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:28,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:28,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:28,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:28,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:28,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:28" (1/1) ... [2022-02-20 18:08:28,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2c0248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:28, skipping insertion in model container [2022-02-20 18:08:28,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:28" (1/1) ... [2022-02-20 18:08:28,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:28,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:28,929 WARN L230 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_product02.cil.c[2141,2154] [2022-02-20 18:08:29,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:29,093 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:08:29,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:29,112 WARN L230 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_product02.cil.c[2141,2154] [2022-02-20 18:08:29,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:29,221 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:29,244 WARN L230 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_product02.cil.c[2141,2154] [2022-02-20 18:08:29,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:29,335 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:29,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29 WrapperNode [2022-02-20 18:08:29,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:29,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:29,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:29,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:29,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,397 INFO L137 Inliner]: procedures = 52, calls = 146, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 187 [2022-02-20 18:08:29,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:29,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:29,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:29,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:29,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:29,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:29,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:29,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:29,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (1/1) ... [2022-02-20 18:08:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:29,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:08:29,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:08:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:29,514 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:29,515 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:08:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:29,516 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:29,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:29,616 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:29,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:29,933 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:29,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:29,943 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:29,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:29 BoogieIcfgContainer [2022-02-20 18:08:29,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:29,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:29,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:29,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:29,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:28" (1/3) ... [2022-02-20 18:08:29,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e0937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:29, skipping insertion in model container [2022-02-20 18:08:29,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:29" (2/3) ... [2022-02-20 18:08:29,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e0937a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:29, skipping insertion in model container [2022-02-20 18:08:29,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:29" (3/3) ... [2022-02-20 18:08:29,956 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product02.cil.c [2022-02-20 18:08:29,962 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:29,963 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:30,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:30,027 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:08:30,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 55 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:08:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:30,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:30,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:30,056 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2124368460, now seen corresponding path program 1 times [2022-02-20 18:08:30,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:30,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287863020] [2022-02-20 18:08:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:30,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 18:08:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:30,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:08:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:30,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:30,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {68#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(3bv32, 17bv32);call write~init~intINTTYPE1(79bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(79bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 19bv32);call write~init~intINTTYPE1(44bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 19bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 19bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 19bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 19bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 20bv32);call write~init~intINTTYPE1(79bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 20bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 21bv32);call write~init~intINTTYPE1(79bv8, 21bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 21bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(41bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 23bv32);call write~init~intINTTYPE1(10bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 24bv32);call #Ultimate.allocInit(7bv32, 25bv32);call write~init~intINTTYPE1(44bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 25bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 25bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 25bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 25bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 26bv32);call write~init~intINTTYPE1(67bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 26bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(79bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(41bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {68#true} is VALID [2022-02-20 18:08:30,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {68#true} is VALID [2022-02-20 18:08:30,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {68#true} is VALID [2022-02-20 18:08:30,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {68#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {68#true} is VALID [2022-02-20 18:08:30,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#true} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {68#true} is VALID [2022-02-20 18:08:30,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} assume 0bv32 != main_~tmp~5#1;assume { :begin_inline_setup } true; {68#true} is VALID [2022-02-20 18:08:30,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {68#true} is VALID [2022-02-20 18:08:30,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} assume !true; {69#false} is VALID [2022-02-20 18:08:30,362 INFO L272 TraceCheckUtils]: 8: Hoare triple {69#false} call cleanup(); {69#false} is VALID [2022-02-20 18:08:30,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {69#false} havoc ~i~0;havoc ~__cil_tmp2~0; {69#false} is VALID [2022-02-20 18:08:30,363 INFO L272 TraceCheckUtils]: 10: Hoare triple {69#false} call timeShift(); {69#false} is VALID [2022-02-20 18:08:30,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {69#false} assume !(0bv32 != ~pumpRunning~0); {69#false} is VALID [2022-02-20 18:08:30,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} assume !(0bv32 != ~systemActive~0); {69#false} is VALID [2022-02-20 18:08:30,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {69#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {69#false} is VALID [2022-02-20 18:08:30,364 INFO L272 TraceCheckUtils]: 14: Hoare triple {69#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {69#false} is VALID [2022-02-20 18:08:30,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {69#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {69#false} is VALID [2022-02-20 18:08:30,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {69#false} assume true; {69#false} is VALID [2022-02-20 18:08:30,365 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {69#false} {69#false} #177#return; {69#false} is VALID [2022-02-20 18:08:30,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {69#false} __utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {69#false} is VALID [2022-02-20 18:08:30,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {69#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {69#false} is VALID [2022-02-20 18:08:30,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {69#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {69#false} is VALID [2022-02-20 18:08:30,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {69#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {69#false} is VALID [2022-02-20 18:08:30,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {69#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {69#false} is VALID [2022-02-20 18:08:30,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {69#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {69#false} is VALID [2022-02-20 18:08:30,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {69#false} assume !false; {69#false} is VALID [2022-02-20 18:08:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:30,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:30,369 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:30,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287863020] [2022-02-20 18:08:30,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287863020] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:30,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:30,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:30,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355713484] [2022-02-20 18:08:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:30,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:30,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:30,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:30,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:30,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:30,448 INFO L87 Difference]: Start difference. First operand has 65 states, 51 states have (on average 1.392156862745098) internal successors, (71), 55 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:30,564 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-02-20 18:08:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 165 transitions. [2022-02-20 18:08:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 165 transitions. [2022-02-20 18:08:30,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 165 transitions. [2022-02-20 18:08:30,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:30,743 INFO L225 Difference]: With dead ends: 122 [2022-02-20 18:08:30,743 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 18:08:30,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:30,749 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:30,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 18:08:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 18:08:30,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:30,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:30,801 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:30,802 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:30,824 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-02-20 18:08:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:30,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:30,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:30,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 56 states. [2022-02-20 18:08:30,826 INFO L87 Difference]: Start difference. First operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 56 states. [2022-02-20 18:08:30,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:30,839 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-02-20 18:08:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:30,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:30,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:30,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:30,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-02-20 18:08:30,847 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2022-02-20 18:08:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:30,847 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-02-20 18:08:30,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-02-20 18:08:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:30,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:30,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:30,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:31,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:31,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 333753737, now seen corresponding path program 1 times [2022-02-20 18:08:31,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:31,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645162287] [2022-02-20 18:08:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:31,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:31,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:31,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:31,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 18:08:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:31,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:31,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:31,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(3bv32, 17bv32);call write~init~intINTTYPE1(79bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(79bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 19bv32);call write~init~intINTTYPE1(44bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 19bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 19bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 19bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 19bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 20bv32);call write~init~intINTTYPE1(79bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 20bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 21bv32);call write~init~intINTTYPE1(79bv8, 21bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 21bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(41bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 23bv32);call write~init~intINTTYPE1(10bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 24bv32);call #Ultimate.allocInit(7bv32, 25bv32);call write~init~intINTTYPE1(44bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 25bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 25bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 25bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 25bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 26bv32);call write~init~intINTTYPE1(67bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 26bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(79bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(41bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {511#true} is VALID [2022-02-20 18:08:31,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {511#true} is VALID [2022-02-20 18:08:31,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {511#true} is VALID [2022-02-20 18:08:31,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {511#true} is VALID [2022-02-20 18:08:31,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#true} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {511#true} is VALID [2022-02-20 18:08:31,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {511#true} assume 0bv32 != main_~tmp~5#1;assume { :begin_inline_setup } true; {511#true} is VALID [2022-02-20 18:08:31,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {511#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {534#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:31,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {534#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:31,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {512#false} is VALID [2022-02-20 18:08:31,262 INFO L272 TraceCheckUtils]: 9: Hoare triple {512#false} call cleanup(); {512#false} is VALID [2022-02-20 18:08:31,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} havoc ~i~0;havoc ~__cil_tmp2~0; {512#false} is VALID [2022-02-20 18:08:31,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#false} call timeShift(); {512#false} is VALID [2022-02-20 18:08:31,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(0bv32 != ~pumpRunning~0); {512#false} is VALID [2022-02-20 18:08:31,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} assume !(0bv32 != ~systemActive~0); {512#false} is VALID [2022-02-20 18:08:31,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {512#false} is VALID [2022-02-20 18:08:31,263 INFO L272 TraceCheckUtils]: 15: Hoare triple {512#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {512#false} is VALID [2022-02-20 18:08:31,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {512#false} is VALID [2022-02-20 18:08:31,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} assume true; {512#false} is VALID [2022-02-20 18:08:31,264 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {512#false} {512#false} #177#return; {512#false} is VALID [2022-02-20 18:08:31,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#false} __utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {512#false} is VALID [2022-02-20 18:08:31,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {512#false} is VALID [2022-02-20 18:08:31,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {512#false} is VALID [2022-02-20 18:08:31,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {512#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {512#false} is VALID [2022-02-20 18:08:31,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {512#false} is VALID [2022-02-20 18:08:31,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {512#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {512#false} is VALID [2022-02-20 18:08:31,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 18:08:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:31,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:31,270 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:31,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645162287] [2022-02-20 18:08:31,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645162287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:31,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:31,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:31,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565336738] [2022-02-20 18:08:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:31,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:31,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:31,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:31,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:31,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:31,307 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:31,392 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-02-20 18:08:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:31,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 18:08:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 18:08:31,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 18:08:31,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:31,513 INFO L225 Difference]: With dead ends: 77 [2022-02-20 18:08:31,513 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 18:08:31,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:31,516 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:31,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 18:08:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 18:08:31,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:31,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:31,529 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:31,532 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:31,538 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 18:08:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:31,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:31,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:31,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:31,539 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:31,544 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 18:08:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:31,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:31,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:31,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:31,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-02-20 18:08:31,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 26 [2022-02-20 18:08:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:31,548 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-02-20 18:08:31,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-20 18:08:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:08:31,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:31,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:31,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 18:08:31,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:31,761 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1606304171, now seen corresponding path program 1 times [2022-02-20 18:08:31,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:31,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651252959] [2022-02-20 18:08:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:31,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:31,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:31,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 18:08:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:31,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:31,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:31,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(3bv32, 17bv32);call write~init~intINTTYPE1(79bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(79bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 19bv32);call write~init~intINTTYPE1(44bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 19bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 19bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 19bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 19bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 20bv32);call write~init~intINTTYPE1(79bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 20bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 21bv32);call write~init~intINTTYPE1(79bv8, 21bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 21bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(41bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 23bv32);call write~init~intINTTYPE1(10bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 24bv32);call #Ultimate.allocInit(7bv32, 25bv32);call write~init~intINTTYPE1(44bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 25bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 25bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 25bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 25bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 26bv32);call write~init~intINTTYPE1(67bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 26bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(79bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(41bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {860#true} is VALID [2022-02-20 18:08:31,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {860#true} is VALID [2022-02-20 18:08:31,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {860#true} is VALID [2022-02-20 18:08:31,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {860#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {860#true} is VALID [2022-02-20 18:08:31,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {860#true} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {860#true} is VALID [2022-02-20 18:08:31,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#true} assume 0bv32 != main_~tmp~5#1;assume { :begin_inline_setup } true; {860#true} is VALID [2022-02-20 18:08:31,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {860#true} is VALID [2022-02-20 18:08:31,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#true} assume !false; {860#true} is VALID [2022-02-20 18:08:31,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#true} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {860#true} is VALID [2022-02-20 18:08:31,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#true} test_~tmp~4#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {860#true} is VALID [2022-02-20 18:08:31,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#true} assume !(0bv32 != test_~tmp~4#1); {860#true} is VALID [2022-02-20 18:08:31,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#true} test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {860#true} is VALID [2022-02-20 18:08:31,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#true} assume !(0bv32 != test_~tmp___0~1#1); {860#true} is VALID [2022-02-20 18:08:31,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#true} test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {860#true} is VALID [2022-02-20 18:08:31,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#true} assume 0bv32 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1bv32; {907#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:31,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_startSystem } true; {907#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:31,928 INFO L272 TraceCheckUtils]: 16: Hoare triple {907#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {907#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:31,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {907#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {907#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:31,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {907#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {861#false} is VALID [2022-02-20 18:08:31,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {861#false} is VALID [2022-02-20 18:08:31,930 INFO L272 TraceCheckUtils]: 20: Hoare triple {861#false} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {861#false} is VALID [2022-02-20 18:08:31,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {861#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {861#false} is VALID [2022-02-20 18:08:31,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {861#false} assume true; {861#false} is VALID [2022-02-20 18:08:31,930 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {861#false} {861#false} #177#return; {861#false} is VALID [2022-02-20 18:08:31,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {861#false} __utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {861#false} is VALID [2022-02-20 18:08:31,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {861#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {861#false} is VALID [2022-02-20 18:08:31,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {861#false} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {861#false} is VALID [2022-02-20 18:08:31,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {861#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {861#false} is VALID [2022-02-20 18:08:31,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {861#false} is VALID [2022-02-20 18:08:31,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {861#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {861#false} is VALID [2022-02-20 18:08:31,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-02-20 18:08:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:31,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:31,932 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:31,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651252959] [2022-02-20 18:08:31,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651252959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:31,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:31,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:31,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772786034] [2022-02-20 18:08:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 18:08:31,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:31,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:31,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:31,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:31,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:31,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:31,966 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:32,060 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-02-20 18:08:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 18:08:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 18:08:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 18:08:32,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 18:08:32,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:32,164 INFO L225 Difference]: With dead ends: 87 [2022-02-20 18:08:32,164 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 18:08:32,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:32,165 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:32,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 18:08:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 18:08:32,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:32,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:32,171 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:32,171 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:32,173 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 18:08:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:32,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:32,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:32,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:32,174 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 18:08:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:32,176 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 18:08:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:32,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:32,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:32,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:32,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 18:08:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-02-20 18:08:32,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 31 [2022-02-20 18:08:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:32,179 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-02-20 18:08:32,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-20 18:08:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 18:08:32,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:32,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:32,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:32,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:32,389 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash -35271042, now seen corresponding path program 1 times [2022-02-20 18:08:32,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:32,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172341937] [2022-02-20 18:08:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:32,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:32,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:32,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 18:08:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:32,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:08:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:32,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:32,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(3bv32, 17bv32);call write~init~intINTTYPE1(79bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 18bv32);call write~init~intINTTYPE1(79bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 19bv32);call write~init~intINTTYPE1(44bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 19bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 19bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 19bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 19bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 20bv32);call write~init~intINTTYPE1(79bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 20bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 21bv32);call write~init~intINTTYPE1(79bv8, 21bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 21bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 21bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(41bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 23bv32);call write~init~intINTTYPE1(10bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 24bv32);call #Ultimate.allocInit(7bv32, 25bv32);call write~init~intINTTYPE1(44bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 25bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 25bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 25bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 25bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 26bv32);call write~init~intINTTYPE1(67bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 26bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(79bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(41bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret44#1, main_~retValue_acc~7#1, main_~tmp~5#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~5#1;assume { :begin_inline_select_helpers } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret44#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~5#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~5#1;assume { :begin_inline_setup } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume !false; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~4#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~4#1); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~1#1); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1bv32; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_startSystem } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,586 INFO L272 TraceCheckUtils]: 16: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != ~systemActive~0;assume { :begin_inline_processEnvironment } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_processEnvironment } true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret37#1, __utac_acc__Specification3_spec__1_#t~ret38#1, __utac_acc__Specification3_spec__1_#t~ret39#1, __utac_acc__Specification3_spec__1_~tmp~3#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,588 INFO L272 TraceCheckUtils]: 21: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret37#1 := isMethaneLevelCritical(); {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume true; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,590 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1241#(= ~waterLevel~0 (_ bv1 32))} {1241#(= ~waterLevel~0 (_ bv1 32))} #177#return; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~3#1 := __utac_acc__Specification3_spec__1_#t~ret37#1;havoc __utac_acc__Specification3_spec__1_#t~ret37#1; {1241#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:32,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1241#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~3#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~9#1;havoc getWaterLevel_~retValue_acc~9#1;getWaterLevel_~retValue_acc~9#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; {1320#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:08:32,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret38#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret38#1;havoc __utac_acc__Specification3_spec__1_#t~ret38#1; {1324#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} is VALID [2022-02-20 18:08:32,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {1324#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~6#1;havoc isPumpRunning_~retValue_acc~6#1;isPumpRunning_~retValue_acc~6#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; {1237#false} is VALID [2022-02-20 18:08:32,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {1237#false} __utac_acc__Specification3_spec__1_#t~ret39#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret39#1;havoc __utac_acc__Specification3_spec__1_#t~ret39#1; {1237#false} is VALID [2022-02-20 18:08:32,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1237#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1237#false} is VALID [2022-02-20 18:08:32,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-02-20 18:08:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:32,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:32,594 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:32,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172341937] [2022-02-20 18:08:32,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172341937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:32,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:32,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:08:32,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836687334] [2022-02-20 18:08:32,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 18:08:32,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:32,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:32,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:32,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:32,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:32,632 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:32,850 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2022-02-20 18:08:32,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:32,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 18:08:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 18:08:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 18:08:32,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2022-02-20 18:08:33,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:33,003 INFO L225 Difference]: With dead ends: 123 [2022-02-20 18:08:33,003 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 18:08:33,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:08:33,005 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:33,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 18:08:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-02-20 18:08:33,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:33,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:33,014 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:33,015 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:33,018 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-02-20 18:08:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-02-20 18:08:33,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:33,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:33,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Second operand 83 states. [2022-02-20 18:08:33,020 INFO L87 Difference]: Start difference. First operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Second operand 83 states. [2022-02-20 18:08:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:33,024 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-02-20 18:08:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-02-20 18:08:33,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:33,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:33,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:33,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 68 states have internal predecessors, (82), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 18:08:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-02-20 18:08:33,028 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 32 [2022-02-20 18:08:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:33,029 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-02-20 18:08:33,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-02-20 18:08:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:08:33,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:33,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:08:33,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 18:08:33,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:33,242 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1660554524, now seen corresponding path program 1 times [2022-02-20 18:08:33,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:33,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060175411] [2022-02-20 18:08:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:33,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 18:08:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:33,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:33,348 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:08:33,349 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:33,349 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:33,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:33,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:33,554 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:08:33,556 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:33,577 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:33,577 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2022-02-20 18:08:33,580 INFO L158 Benchmark]: Toolchain (without parser) took 4833.61ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 33.9MB in the beginning and 51.9MB in the end (delta: -18.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2022-02-20 18:08:33,580 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 36.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:33,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.41ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.6MB in the beginning and 49.3MB in the end (delta: -15.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-20 18:08:33,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.89ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 46.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:08:33,582 INFO L158 Benchmark]: Boogie Preprocessor took 47.26ms. Allocated memory is still 69.2MB. Free memory was 46.6MB in the beginning and 45.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:33,582 INFO L158 Benchmark]: RCFGBuilder took 500.59ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 49.6MB in the end (delta: -4.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-02-20 18:08:33,583 INFO L158 Benchmark]: TraceAbstraction took 3631.08ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 49.2MB in the beginning and 51.9MB in the end (delta: -2.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-02-20 18:08:33,584 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory was 37.7MB in the beginning and 37.7MB in the end (delta: 36.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.41ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.6MB in the beginning and 49.3MB in the end (delta: -15.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.89ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 46.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.26ms. Allocated memory is still 69.2MB. Free memory was 46.6MB in the beginning and 45.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 500.59ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 49.6MB in the end (delta: -4.5MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3631.08ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 49.2MB in the beginning and 51.9MB in the end (delta: -2.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:08:33,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator