./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product16.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_product16.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 4fdaba9a943be1a84417ec0186b85075ad2a6a54eeb9563391984670e62b2cee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:46,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:46,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:46,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:46,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:46,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:46,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:46,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:46,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:46,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:46,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:46,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:46,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:46,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:46,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:46,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:46,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:46,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:46,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:46,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:46,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:46,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:46,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:46,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:46,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:46,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:46,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:46,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:46,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:46,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:46,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:46,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:46,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:46,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:46,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:46,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:46,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:46,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:46,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:46,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:46,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:46,332 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:46,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:46,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:46,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:46,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:46,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:46,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:46,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:46,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:46,357 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:46,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:46,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:46,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:46,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:46,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:46,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:46,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:46,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:46,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:46,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:46,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:46,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:46,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:08:46,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:08:46,362 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:46,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:46,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:46,362 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 -> 4fdaba9a943be1a84417ec0186b85075ad2a6a54eeb9563391984670e62b2cee [2022-02-20 18:08:46,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:46,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:46,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:46,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:46,617 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:46,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product16.cil.c [2022-02-20 18:08:46,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003f91000/d18d746d3b2647e89f313a5762693c03/FLAG15746f8b5 [2022-02-20 18:08:47,159 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:47,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product16.cil.c [2022-02-20 18:08:47,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003f91000/d18d746d3b2647e89f313a5762693c03/FLAG15746f8b5 [2022-02-20 18:08:47,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003f91000/d18d746d3b2647e89f313a5762693c03 [2022-02-20 18:08:47,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:47,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:47,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:47,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:47,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:47,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:47" (1/1) ... [2022-02-20 18:08:47,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c145a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:47, skipping insertion in model container [2022-02-20 18:08:47,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:47" (1/1) ... [2022-02-20 18:08:47,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:47,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:47,743 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_product16.cil.c[1605,1618] [2022-02-20 18:08:47,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:47,921 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:47,930 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_product16.cil.c[1605,1618] [2022-02-20 18:08:47,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:47,981 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:47,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:47 WrapperNode [2022-02-20 18:08:47,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:47,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:47,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:47,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:47,991 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:47" (1/1) ... [2022-02-20 18:08:48,010 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:47" (1/1) ... [2022-02-20 18:08:48,079 INFO L137 Inliner]: procedures = 53, calls = 154, calls flagged for inlining = 20, calls inlined = 16, statements flattened = 210 [2022-02-20 18:08:48,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:48,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:48,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:48,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:48,086 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:47" (1/1) ... [2022-02-20 18:08:48,091 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:47" (1/1) ... [2022-02-20 18:08:48,103 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:47" (1/1) ... [2022-02-20 18:08:48,106 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:47" (1/1) ... [2022-02-20 18:08:48,112 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:47" (1/1) ... [2022-02-20 18:08:48,118 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:47" (1/1) ... [2022-02-20 18:08:48,119 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:47" (1/1) ... [2022-02-20 18:08:48,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:48,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:48,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:48,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:48,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:47" (1/1) ... [2022-02-20 18:08:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:48,173 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:48,201 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:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:08:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:08:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2022-02-20 18:08:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2022-02-20 18:08:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:08:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:08:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:08:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:48,316 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:48,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:48,711 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:48,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:48,717 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:48 BoogieIcfgContainer [2022-02-20 18:08:48,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:48,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:48,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:48,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:48,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:47" (1/3) ... [2022-02-20 18:08:48,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd86b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:48, skipping insertion in model container [2022-02-20 18:08:48,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:47" (2/3) ... [2022-02-20 18:08:48,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd86b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:48, skipping insertion in model container [2022-02-20 18:08:48,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:48" (3/3) ... [2022-02-20 18:08:48,761 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product16.cil.c [2022-02-20 18:08:48,770 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:48,770 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:48,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:48,820 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:48,821 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 70 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:08:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:48,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:48,853 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:48,854 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -210904548, now seen corresponding path program 1 times [2022-02-20 18:08:48,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:48,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637766792] [2022-02-20 18:08:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:08:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {89#true} is VALID [2022-02-20 18:08:49,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume true; {89#true} is VALID [2022-02-20 18:08:49,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89#true} {90#false} #215#return; {90#false} is VALID [2022-02-20 18:08:49,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#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);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {89#true} is VALID [2022-02-20 18:08:49,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {89#true} is VALID [2022-02-20 18:08:49,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {89#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {89#true} is VALID [2022-02-20 18:08:49,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {89#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {89#true} is VALID [2022-02-20 18:08:49,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {89#true} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret4#1 && main_#t~ret4#1 <= 2147483647;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {89#true} is VALID [2022-02-20 18:08:49,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {89#true} assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true; {89#true} is VALID [2022-02-20 18:08:49,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {89#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {89#true} is VALID [2022-02-20 18:08:49,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {89#true} assume false; {90#false} is VALID [2022-02-20 18:08:49,082 INFO L272 TraceCheckUtils]: 8: Hoare triple {90#false} call cleanup(); {90#false} is VALID [2022-02-20 18:08:49,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#false} havoc ~i~0;havoc ~__cil_tmp2~0; {90#false} is VALID [2022-02-20 18:08:49,083 INFO L272 TraceCheckUtils]: 10: Hoare triple {90#false} call timeShift(); {90#false} is VALID [2022-02-20 18:08:49,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#false} assume !(0 != ~pumpRunning~0); {90#false} is VALID [2022-02-20 18:08:49,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#false} assume !(0 != ~systemActive~0); {90#false} is VALID [2022-02-20 18:08:49,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {90#false} is VALID [2022-02-20 18:08:49,084 INFO L272 TraceCheckUtils]: 14: Hoare triple {90#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {89#true} is VALID [2022-02-20 18:08:49,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {89#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {89#true} is VALID [2022-02-20 18:08:49,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {89#true} assume true; {89#true} is VALID [2022-02-20 18:08:49,084 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {89#true} {90#false} #215#return; {90#false} is VALID [2022-02-20 18:08:49,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {90#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret49#1 && __utac_acc__Specification3_spec__1_#t~ret49#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {90#false} is VALID [2022-02-20 18:08:49,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {90#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~7#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; {90#false} is VALID [2022-02-20 18:08:49,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {90#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret50#1 && __utac_acc__Specification3_spec__1_#t~ret50#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {90#false} is VALID [2022-02-20 18:08:49,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {90#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {90#false} is VALID [2022-02-20 18:08:49,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {90#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret51#1 && __utac_acc__Specification3_spec__1_#t~ret51#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {90#false} is VALID [2022-02-20 18:08:49,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {90#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {90#false} is VALID [2022-02-20 18:08:49,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {90#false} assume !false; {90#false} is VALID [2022-02-20 18:08:49,088 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:49,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:49,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637766792] [2022-02-20 18:08:49,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637766792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:49,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:49,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:49,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880687318] [2022-02-20 18:08:49,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:49,096 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:49,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:49,100 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:49,149 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:49,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:49,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:49,170 INFO L87 Difference]: Start difference. First operand has 86 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 70 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) 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:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,275 INFO L93 Difference]: Finished difference Result 164 states and 219 transitions. [2022-02-20 18:08:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:49,276 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:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:49,277 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:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2022-02-20 18:08:49,290 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:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2022-02-20 18:08:49,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 219 transitions. [2022-02-20 18:08:49,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:49,510 INFO L225 Difference]: With dead ends: 164 [2022-02-20 18:08:49,510 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 18:08:49,513 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:49,515 INFO L933 BasicCegarLoop]: 106 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, 106 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:49,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 106 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:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 18:08:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-20 18:08:49,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:49,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:49,543 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:49,544 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,549 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-02-20 18:08:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:49,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:49,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:49,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-02-20 18:08:49,552 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-02-20 18:08:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,557 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-02-20 18:08:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:49,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:49,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:49,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:49,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-02-20 18:08:49,564 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 25 [2022-02-20 18:08:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:49,564 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-02-20 18:08:49,565 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:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:49,566 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:49,566 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:49,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:08:49,567 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:49,568 INFO L85 PathProgramCache]: Analyzing trace with hash -385739180, now seen corresponding path program 1 times [2022-02-20 18:08:49,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:49,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859820920] [2022-02-20 18:08:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:49,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:08:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {598#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {598#true} is VALID [2022-02-20 18:08:49,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} assume true; {598#true} is VALID [2022-02-20 18:08:49,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {598#true} {599#false} #215#return; {599#false} is VALID [2022-02-20 18:08:49,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {598#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);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {598#true} is VALID [2022-02-20 18:08:49,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {598#true} is VALID [2022-02-20 18:08:49,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {598#true} is VALID [2022-02-20 18:08:49,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {598#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {598#true} is VALID [2022-02-20 18:08:49,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {598#true} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret4#1 && main_#t~ret4#1 <= 2147483647;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {598#true} is VALID [2022-02-20 18:08:49,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true; {598#true} is VALID [2022-02-20 18:08:49,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {600#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:49,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {600#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:49,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {600#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {599#false} is VALID [2022-02-20 18:08:49,629 INFO L272 TraceCheckUtils]: 9: Hoare triple {599#false} call cleanup(); {599#false} is VALID [2022-02-20 18:08:49,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#false} havoc ~i~0;havoc ~__cil_tmp2~0; {599#false} is VALID [2022-02-20 18:08:49,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {599#false} call timeShift(); {599#false} is VALID [2022-02-20 18:08:49,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#false} assume !(0 != ~pumpRunning~0); {599#false} is VALID [2022-02-20 18:08:49,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#false} assume !(0 != ~systemActive~0); {599#false} is VALID [2022-02-20 18:08:49,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {599#false} is VALID [2022-02-20 18:08:49,631 INFO L272 TraceCheckUtils]: 15: Hoare triple {599#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {598#true} is VALID [2022-02-20 18:08:49,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {598#true} is VALID [2022-02-20 18:08:49,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {598#true} assume true; {598#true} is VALID [2022-02-20 18:08:49,631 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {598#true} {599#false} #215#return; {599#false} is VALID [2022-02-20 18:08:49,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {599#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret49#1 && __utac_acc__Specification3_spec__1_#t~ret49#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {599#false} is VALID [2022-02-20 18:08:49,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {599#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~7#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; {599#false} is VALID [2022-02-20 18:08:49,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {599#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret50#1 && __utac_acc__Specification3_spec__1_#t~ret50#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {599#false} is VALID [2022-02-20 18:08:49,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {599#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {599#false} is VALID [2022-02-20 18:08:49,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {599#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret51#1 && __utac_acc__Specification3_spec__1_#t~ret51#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {599#false} is VALID [2022-02-20 18:08:49,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {599#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {599#false} is VALID [2022-02-20 18:08:49,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {599#false} assume !false; {599#false} is VALID [2022-02-20 18:08:49,633 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:49,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:49,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859820920] [2022-02-20 18:08:49,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859820920] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:49,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:49,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:49,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367631858] [2022-02-20 18:08:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:49,636 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:49,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:49,637 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:49,656 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:49,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:49,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:49,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:49,658 INFO L87 Difference]: Start difference. First operand 77 states and 97 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:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,731 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-02-20 18:08:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:49,731 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:49,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:49,732 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:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 18:08:49,735 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:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 18:08:49,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2022-02-20 18:08:49,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:49,830 INFO L225 Difference]: With dead ends: 115 [2022-02-20 18:08:49,830 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 18:08:49,831 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:49,832 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 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:49,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 146 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:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 18:08:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-20 18:08:49,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:49,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:49,838 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:49,838 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,841 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:08:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:49,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:49,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 68 states. [2022-02-20 18:08:49,842 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 68 states. [2022-02-20 18:08:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:49,844 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:08:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:49,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:49,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:49,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:49,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2022-02-20 18:08:49,848 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 26 [2022-02-20 18:08:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:49,848 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2022-02-20 18:08:49,848 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:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:08:49,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:49,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, 1, 1, 1, 1, 1] [2022-02-20 18:08:49,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:08:49,850 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 88146171, now seen corresponding path program 1 times [2022-02-20 18:08:49,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:49,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957030882] [2022-02-20 18:08:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 18:08:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:49,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1004#true} is VALID [2022-02-20 18:08:49,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 18:08:49,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1004#true} {1005#false} #215#return; {1005#false} is VALID [2022-02-20 18:08:49,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#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);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {1006#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:49,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1006#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {1006#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:49,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1006#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1006#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:49,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {1006#(= 1 ~systemActive~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1007#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-20 18:08:49,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {1007#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret4#1 && main_#t~ret4#1 <= 2147483647;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1008#(= |ULTIMATE.start_main_~tmp~0#1| ~systemActive~0)} is VALID [2022-02-20 18:08:49,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#(= |ULTIMATE.start_main_~tmp~0#1| ~systemActive~0)} assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !false; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet28#1 && test_#t~nondet28#1 <= 2147483647;test_~tmp~4#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~4#1); {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet29#1 && test_#t~nondet29#1 <= 2147483647;test_~tmp___0~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~0#1); {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet30#1 && test_#t~nondet30#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___2~0#1);assume -2147483648 <= test_#t~nondet31#1 && test_#t~nondet31#1 <= 2147483647;test_~tmp___1~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___1~0#1); {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,961 INFO L272 TraceCheckUtils]: 16: Hoare triple {1009#(not (= 0 ~systemActive~0))} call timeShift(); {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {1009#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:49,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1009#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {1005#false} is VALID [2022-02-20 18:08:49,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1005#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1005#false} is VALID [2022-02-20 18:08:49,962 INFO L272 TraceCheckUtils]: 20: Hoare triple {1005#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {1004#true} is VALID [2022-02-20 18:08:49,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {1004#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1004#true} is VALID [2022-02-20 18:08:49,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 18:08:49,963 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1004#true} {1005#false} #215#return; {1005#false} is VALID [2022-02-20 18:08:49,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1005#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret49#1 && __utac_acc__Specification3_spec__1_#t~ret49#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {1005#false} is VALID [2022-02-20 18:08:49,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {1005#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~7#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; {1005#false} is VALID [2022-02-20 18:08:49,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {1005#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret50#1 && __utac_acc__Specification3_spec__1_#t~ret50#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {1005#false} is VALID [2022-02-20 18:08:49,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1005#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1005#false} is VALID [2022-02-20 18:08:49,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {1005#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret51#1 && __utac_acc__Specification3_spec__1_#t~ret51#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {1005#false} is VALID [2022-02-20 18:08:49,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {1005#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1005#false} is VALID [2022-02-20 18:08:49,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2022-02-20 18:08:49,966 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:49,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:49,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957030882] [2022-02-20 18:08:49,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957030882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:49,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:49,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:08:49,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748776139] [2022-02-20 18:08:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:49,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:49,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:49,990 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:49,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:08:49,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:08:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:08:49,992 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:50,448 INFO L93 Difference]: Finished difference Result 248 states and 324 transitions. [2022-02-20 18:08:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:08:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 324 transitions. [2022-02-20 18:08:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 324 transitions. [2022-02-20 18:08:50,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 324 transitions. [2022-02-20 18:08:50,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:50,718 INFO L225 Difference]: With dead ends: 248 [2022-02-20 18:08:50,718 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 18:08:50,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:08:50,720 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 243 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:50,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 423 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:08:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 18:08:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2022-02-20 18:08:50,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:50,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) [2022-02-20 18:08:50,734 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) [2022-02-20 18:08:50,734 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) [2022-02-20 18:08:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:50,740 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2022-02-20 18:08:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 241 transitions. [2022-02-20 18:08:50,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:50,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:50,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) Second operand 187 states. [2022-02-20 18:08:50,743 INFO L87 Difference]: Start difference. First operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) Second operand 187 states. [2022-02-20 18:08:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:50,749 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2022-02-20 18:08:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 241 transitions. [2022-02-20 18:08:50,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:50,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:50,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:50,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 134 states have internal predecessors, (161), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 19 states have call predecessors, (26), 25 states have call successors, (26) [2022-02-20 18:08:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2022-02-20 18:08:50,759 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 31 [2022-02-20 18:08:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:50,759 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2022-02-20 18:08:50,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2022-02-20 18:08:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:08:50,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:50,761 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] [2022-02-20 18:08:50,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:08:50,762 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash -497555309, now seen corresponding path program 1 times [2022-02-20 18:08:50,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:50,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386892421] [2022-02-20 18:08:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:08:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:50,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1971#true} is VALID [2022-02-20 18:08:50,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-02-20 18:08:50,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1971#true} {1973#(= ~waterLevel~0 1)} #215#return; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#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);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1973#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1973#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {1973#(= ~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {1973#(= ~waterLevel~0 1)} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret4#1 && main_#t~ret4#1 <= 2147483647;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {1973#(= ~waterLevel~0 1)} assume 0 != main_~tmp~0#1;assume { :begin_inline_setup } true; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {1973#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {1973#(= ~waterLevel~0 1)} assume !false; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {1973#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {1973#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet28#1 && test_#t~nondet28#1 <= 2147483647;test_~tmp~4#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~4#1); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {1973#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet29#1 && test_#t~nondet29#1 <= 2147483647;test_~tmp___0~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~0#1); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {1973#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet30#1 && test_#t~nondet30#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___2~0#1);assume -2147483648 <= test_#t~nondet31#1 && test_#t~nondet31#1 <= 2147483647;test_~tmp___1~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1973#(= ~waterLevel~0 1)} assume 0 != test_~tmp___1~0#1;assume { :begin_inline_stopSystem } true; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {1973#(= ~waterLevel~0 1)} ~systemActive~0 := 0; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {1973#(= ~waterLevel~0 1)} assume { :end_inline_stopSystem } true; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {1973#(= ~waterLevel~0 1)} call timeShift(); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != ~systemActive~0); {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {1973#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,854 INFO L272 TraceCheckUtils]: 23: Hoare triple {1973#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {1971#true} is VALID [2022-02-20 18:08:50,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {1971#true} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1971#true} is VALID [2022-02-20 18:08:50,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {1971#true} assume true; {1971#true} is VALID [2022-02-20 18:08:50,855 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1971#true} {1973#(= ~waterLevel~0 1)} #215#return; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {1973#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret49#1 && __utac_acc__Specification3_spec__1_#t~ret49#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {1973#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:50,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {1973#(= ~waterLevel~0 1)} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~7#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; {1977#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:08:50,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {1977#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret50#1 && __utac_acc__Specification3_spec__1_#t~ret50#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {1978#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~1#1| 1)} is VALID [2022-02-20 18:08:50,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {1978#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~1#1| 1)} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1972#false} is VALID [2022-02-20 18:08:50,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {1972#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret51#1 && __utac_acc__Specification3_spec__1_#t~ret51#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {1972#false} is VALID [2022-02-20 18:08:50,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {1972#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1972#false} is VALID [2022-02-20 18:08:50,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {1972#false} assume !false; {1972#false} is VALID [2022-02-20 18:08:50,857 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:50,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:50,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386892421] [2022-02-20 18:08:50,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386892421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:50,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:50,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:08:50,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496788316] [2022-02-20 18:08:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2022-02-20 18:08:50,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:50,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:50,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:50,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:50,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:50,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:50,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:50,881 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,091 INFO L93 Difference]: Finished difference Result 473 states and 627 transitions. [2022-02-20 18:08:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2022-02-20 18:08:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2022-02-20 18:08:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2022-02-20 18:08:51,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 241 transitions. [2022-02-20 18:08:51,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:51,305 INFO L225 Difference]: With dead ends: 473 [2022-02-20 18:08:51,305 INFO L226 Difference]: Without dead ends: 315 [2022-02-20 18:08:51,306 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:51,307 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 55 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 349 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:51,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 349 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:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-02-20 18:08:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 306. [2022-02-20 18:08:51,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:51,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 18:08:51,329 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 18:08:51,330 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 18:08:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,343 INFO L93 Difference]: Finished difference Result 315 states and 406 transitions. [2022-02-20 18:08:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 406 transitions. [2022-02-20 18:08:51,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) Second operand 315 states. [2022-02-20 18:08:51,347 INFO L87 Difference]: Start difference. First operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) Second operand 315 states. [2022-02-20 18:08:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,360 INFO L93 Difference]: Finished difference Result 315 states and 406 transitions. [2022-02-20 18:08:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 406 transitions. [2022-02-20 18:08:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:51,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 220 states have (on average 1.3181818181818181) internal successors, (290), 244 states have internal predecessors, (290), 50 states have call successors, (50), 38 states have call predecessors, (50), 35 states have return successors, (56), 35 states have call predecessors, (56), 50 states have call successors, (56) [2022-02-20 18:08:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2022-02-20 18:08:51,372 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 34 [2022-02-20 18:08:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:51,372 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2022-02-20 18:08:51,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2022-02-20 18:08:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:08:51,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:51,374 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, 1, 1] [2022-02-20 18:08:51,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:08:51,374 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 841670873, now seen corresponding path program 1 times [2022-02-20 18:08:51,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:51,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75005308] [2022-02-20 18:08:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:51,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:51,424 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:08:51,425 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:51,425 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:51,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:08:51,428 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:08:51,430 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:51,445 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:51,446 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:51,448 INFO L158 Benchmark]: Toolchain (without parser) took 3876.35ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 55.5MB in the beginning and 76.3MB in the end (delta: -20.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-02-20 18:08:51,448 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:51,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.62ms. Allocated memory is still 94.4MB. Free memory was 55.4MB in the beginning and 59.9MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 18:08:51,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.91ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 57.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:51,449 INFO L158 Benchmark]: Boogie Preprocessor took 41.24ms. Allocated memory is still 94.4MB. Free memory was 57.2MB in the beginning and 55.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:51,449 INFO L158 Benchmark]: RCFGBuilder took 589.91ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 36.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:08:51,450 INFO L158 Benchmark]: TraceAbstraction took 2725.90ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 36.4MB in the beginning and 76.3MB in the end (delta: -39.9MB). Peak memory consumption was 761.2kB. Max. memory is 16.1GB. [2022-02-20 18:08:51,451 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.16ms. Allocated memory is still 94.4MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.62ms. Allocated memory is still 94.4MB. Free memory was 55.4MB in the beginning and 59.9MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.91ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 57.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.24ms. Allocated memory is still 94.4MB. Free memory was 57.2MB in the beginning and 55.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.91ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 36.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2725.90ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 36.4MB in the beginning and 76.3MB in the end (delta: -39.9MB). Peak memory consumption was 761.2kB. 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:51,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_product16.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 4fdaba9a943be1a84417ec0186b85075ad2a6a54eeb9563391984670e62b2cee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:53,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:53,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:53,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:53,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:53,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:53,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:53,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:53,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:53,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:53,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:53,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:53,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:53,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:53,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:53,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:53,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:53,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:53,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:53,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:53,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:53,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:53,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:53,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:53,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:53,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:53,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:53,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:53,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:53,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:53,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:53,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:53,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:53,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:53,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:53,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:53,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:53,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:53,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:53,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:53,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:53,882 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:53,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:53,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:53,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:53,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:53,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:53,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:53,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:53,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:53,911 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:53,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:53,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:53,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:53,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:08:53,913 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:08:53,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:53,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:53,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:53,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:53,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:53,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:53,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:53,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:53,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:53,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:53,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:53,915 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:08:53,916 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:08:53,916 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:53,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:53,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:53,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:08:53,917 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 -> 4fdaba9a943be1a84417ec0186b85075ad2a6a54eeb9563391984670e62b2cee [2022-02-20 18:08:54,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:54,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:54,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:54,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:54,248 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:54,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product16.cil.c [2022-02-20 18:08:54,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b0cae59/5acaa36caf674649814cbde90caca5d1/FLAGce17c0ebc [2022-02-20 18:08:54,758 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:54,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product16.cil.c [2022-02-20 18:08:54,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b0cae59/5acaa36caf674649814cbde90caca5d1/FLAGce17c0ebc [2022-02-20 18:08:54,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b0cae59/5acaa36caf674649814cbde90caca5d1 [2022-02-20 18:08:54,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:54,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:54,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:54,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:54,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:54,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:54" (1/1) ... [2022-02-20 18:08:54,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522e2468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:54, skipping insertion in model container [2022-02-20 18:08:54,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:54" (1/1) ... [2022-02-20 18:08:54,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:54,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:54,941 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_product16.cil.c[1605,1618] [2022-02-20 18:08:55,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:55,082 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:08:55,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:55,106 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_product16.cil.c[1605,1618] [2022-02-20 18:08:55,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:55,166 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:55,190 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_product16.cil.c[1605,1618] [2022-02-20 18:08:55,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:55,256 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:55,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:55 WrapperNode [2022-02-20 18:08:55,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:55,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:55,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:55,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:55,264 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:55" (1/1) ... [2022-02-20 18:08:55,280 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:55" (1/1) ... [2022-02-20 18:08:55,309 INFO L137 Inliner]: procedures = 55, calls = 154, calls flagged for inlining = 20, calls inlined = 16, statements flattened = 201 [2022-02-20 18:08:55,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:55,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:55,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:55,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:55,317 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:55" (1/1) ... [2022-02-20 18:08:55,318 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:55" (1/1) ... [2022-02-20 18:08:55,320 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:55" (1/1) ... [2022-02-20 18:08:55,320 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:55" (1/1) ... [2022-02-20 18:08:55,326 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:55" (1/1) ... [2022-02-20 18:08:55,339 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:55" (1/1) ... [2022-02-20 18:08:55,340 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:55" (1/1) ... [2022-02-20 18:08:55,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:55,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:55,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:55,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:55,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:55" (1/1) ... [2022-02-20 18:08:55,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:55,437 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:55,453 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:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:55,481 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:08:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:08:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:08:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2022-02-20 18:08:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2022-02-20 18:08:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:08:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:08:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:55,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:55,561 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:55,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:55,778 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:55,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:55,784 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:55,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:55 BoogieIcfgContainer [2022-02-20 18:08:55,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:55,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:55,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:55,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:55,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:54" (1/3) ... [2022-02-20 18:08:55,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c23227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:55, skipping insertion in model container [2022-02-20 18:08:55,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:55" (2/3) ... [2022-02-20 18:08:55,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c23227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:55, skipping insertion in model container [2022-02-20 18:08:55,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:55" (3/3) ... [2022-02-20 18:08:55,810 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product16.cil.c [2022-02-20 18:08:55,816 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:55,816 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:55,862 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:55,869 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:55,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 70 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:08:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:55,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:55,898 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:55,898 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -210904548, now seen corresponding path program 1 times [2022-02-20 18:08:55,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:55,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295611318] [2022-02-20 18:08:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:55,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:55,933 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:55,934 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:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:56,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:08:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:56,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:56,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#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);~cleanupTimeShifts~0 := 4bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {89#true} is VALID [2022-02-20 18:08:56,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {89#true} is VALID [2022-02-20 18:08:56,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {89#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {89#true} is VALID [2022-02-20 18:08:56,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {89#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {89#true} is VALID [2022-02-20 18:08:56,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {89#true} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {89#true} is VALID [2022-02-20 18:08:56,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {89#true} assume 0bv32 != main_~tmp~0#1;assume { :begin_inline_setup } true; {89#true} is VALID [2022-02-20 18:08:56,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {89#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {89#true} is VALID [2022-02-20 18:08:56,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {89#true} assume false; {90#false} is VALID [2022-02-20 18:08:56,122 INFO L272 TraceCheckUtils]: 8: Hoare triple {90#false} call cleanup(); {90#false} is VALID [2022-02-20 18:08:56,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#false} havoc ~i~0;havoc ~__cil_tmp2~0; {90#false} is VALID [2022-02-20 18:08:56,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {90#false} call timeShift(); {90#false} is VALID [2022-02-20 18:08:56,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#false} assume !(0bv32 != ~pumpRunning~0); {90#false} is VALID [2022-02-20 18:08:56,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#false} assume !(0bv32 != ~systemActive~0); {90#false} is VALID [2022-02-20 18:08:56,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {90#false} is VALID [2022-02-20 18:08:56,123 INFO L272 TraceCheckUtils]: 14: Hoare triple {90#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {90#false} is VALID [2022-02-20 18:08:56,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {90#false} is VALID [2022-02-20 18:08:56,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#false} assume true; {90#false} is VALID [2022-02-20 18:08:56,124 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {90#false} {90#false} #215#return; {90#false} is VALID [2022-02-20 18:08:56,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {90#false} __utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {90#false} is VALID [2022-02-20 18:08:56,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {90#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~7#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; {90#false} is VALID [2022-02-20 18:08:56,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {90#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {90#false} is VALID [2022-02-20 18:08:56,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {90#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {90#false} is VALID [2022-02-20 18:08:56,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {90#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {90#false} is VALID [2022-02-20 18:08:56,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {90#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {90#false} is VALID [2022-02-20 18:08:56,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {90#false} assume !false; {90#false} is VALID [2022-02-20 18:08:56,126 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:56,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:56,127 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:56,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295611318] [2022-02-20 18:08:56,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295611318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:56,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:56,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:56,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034393197] [2022-02-20 18:08:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:56,133 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:56,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:56,137 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:56,160 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:56,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:56,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:56,199 INFO L87 Difference]: Start difference. First operand has 86 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 70 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) 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:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:56,299 INFO L93 Difference]: Finished difference Result 164 states and 219 transitions. [2022-02-20 18:08:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:56,300 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:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:56,302 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:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2022-02-20 18:08:56,313 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:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 219 transitions. [2022-02-20 18:08:56,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 219 transitions. [2022-02-20 18:08:56,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:56,524 INFO L225 Difference]: With dead ends: 164 [2022-02-20 18:08:56,525 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 18:08:56,530 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:56,537 INFO L933 BasicCegarLoop]: 106 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, 106 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:56,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 106 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:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 18:08:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-20 18:08:56,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:56,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:56,590 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:56,592 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:56,603 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-02-20 18:08:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:56,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:56,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:56,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-02-20 18:08:56,609 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-02-20 18:08:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:56,626 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-02-20 18:08:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:56,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:56,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:56,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:56,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 62 states have internal predecessors, (72), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 18:08:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-02-20 18:08:56,635 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 25 [2022-02-20 18:08:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:56,636 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-02-20 18:08:56,637 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:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-02-20 18:08:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:56,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:56,641 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:56,651 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:56,841 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:56,842 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -385739180, now seen corresponding path program 1 times [2022-02-20 18:08:56,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:56,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288568682] [2022-02-20 18:08:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:56,846 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:56,908 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:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:56,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:56,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:57,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#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);~cleanupTimeShifts~0 := 4bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {667#true} is VALID [2022-02-20 18:08:57,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {667#true} is VALID [2022-02-20 18:08:57,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {667#true} is VALID [2022-02-20 18:08:57,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {667#true} is VALID [2022-02-20 18:08:57,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#true} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {667#true} is VALID [2022-02-20 18:08:57,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} assume 0bv32 != main_~tmp~0#1;assume { :begin_inline_setup } true; {667#true} is VALID [2022-02-20 18:08:57,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {690#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:57,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {690#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {690#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:57,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {690#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {668#false} is VALID [2022-02-20 18:08:57,088 INFO L272 TraceCheckUtils]: 9: Hoare triple {668#false} call cleanup(); {668#false} is VALID [2022-02-20 18:08:57,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {668#false} havoc ~i~0;havoc ~__cil_tmp2~0; {668#false} is VALID [2022-02-20 18:08:57,088 INFO L272 TraceCheckUtils]: 11: Hoare triple {668#false} call timeShift(); {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#false} assume !(0bv32 != ~pumpRunning~0); {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#false} assume !(0bv32 != ~systemActive~0); {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {668#false} is VALID [2022-02-20 18:08:57,089 INFO L272 TraceCheckUtils]: 15: Hoare triple {668#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {668#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#false} assume true; {668#false} is VALID [2022-02-20 18:08:57,089 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {668#false} {668#false} #215#return; {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {668#false} __utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {668#false} is VALID [2022-02-20 18:08:57,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {668#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~7#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; {668#false} is VALID [2022-02-20 18:08:57,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {668#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {668#false} is VALID [2022-02-20 18:08:57,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {668#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {668#false} is VALID [2022-02-20 18:08:57,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {668#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {668#false} is VALID [2022-02-20 18:08:57,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {668#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {668#false} is VALID [2022-02-20 18:08:57,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-02-20 18:08:57,090 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:57,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:57,090 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:57,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288568682] [2022-02-20 18:08:57,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288568682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:57,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5734423] [2022-02-20 18:08:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,092 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:57,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,092 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:57,132 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:57,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:57,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:57,134 INFO L87 Difference]: Start difference. First operand 77 states and 97 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:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,258 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-02-20 18:08:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:57,259 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:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:57,259 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:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 18:08:57,262 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:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 18:08:57,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2022-02-20 18:08:57,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:57,403 INFO L225 Difference]: With dead ends: 115 [2022-02-20 18:08:57,403 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 18:08:57,404 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:57,405 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 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:57,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 146 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:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 18:08:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-20 18:08:57,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:57,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,410 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,410 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,412 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:08:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:57,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 68 states. [2022-02-20 18:08:57,414 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 68 states. [2022-02-20 18:08:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,416 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:08:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:57,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:57,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.3) internal successors, (65), 56 states have internal predecessors, (65), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2022-02-20 18:08:57,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 26 [2022-02-20 18:08:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:57,419 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2022-02-20 18:08:57,420 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:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:08:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:08:57,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:57,421 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:57,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:57,628 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:57,628 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 88146171, now seen corresponding path program 1 times [2022-02-20 18:08:57,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:57,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852597757] [2022-02-20 18:08:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:57,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:57,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:57,634 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:57,635 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:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:57,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {1145#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);~cleanupTimeShifts~0 := 4bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {1150#(= ~systemActive~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != main_~tmp~0#1;assume { :begin_inline_setup } true; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !false; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} test_~tmp~4#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~4#1); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} test_~tmp___0~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~0#1); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___1~0#1); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,766 INFO L272 TraceCheckUtils]: 16: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1150#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:57,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1146#false} is VALID [2022-02-20 18:08:57,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1146#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1146#false} is VALID [2022-02-20 18:08:57,767 INFO L272 TraceCheckUtils]: 20: Hoare triple {1146#false} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {1146#false} is VALID [2022-02-20 18:08:57,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {1146#false} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {1146#false} assume true; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1146#false} {1146#false} #215#return; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {1146#false} __utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {1146#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~7#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; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {1146#false} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {1146#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1146#false} is VALID [2022-02-20 18:08:57,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {1146#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {1146#false} is VALID [2022-02-20 18:08:57,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {1146#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1146#false} is VALID [2022-02-20 18:08:57,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2022-02-20 18:08:57,769 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:57,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:57,769 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:57,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852597757] [2022-02-20 18:08:57,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852597757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:57,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086749010] [2022-02-20 18:08:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:57,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,771 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), 2 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:57,793 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:57,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:57,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:57,795 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,937 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2022-02-20 18:08:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 18:08:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 18:08:57,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2022-02-20 18:08:58,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,128 INFO L225 Difference]: With dead ends: 188 [2022-02-20 18:08:58,128 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 18:08:58,128 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:58,129 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:58,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 18:08:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-02-20 18:08:58,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:58,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:08:58,139 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:08:58,139 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:08:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,143 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2022-02-20 18:08:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2022-02-20 18:08:58,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) Second operand 127 states. [2022-02-20 18:08:58,144 INFO L87 Difference]: Start difference. First operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) Second operand 127 states. [2022-02-20 18:08:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,148 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2022-02-20 18:08:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2022-02-20 18:08:58,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:58,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:08:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2022-02-20 18:08:58,152 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 31 [2022-02-20 18:08:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:58,153 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2022-02-20 18:08:58,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2022-02-20 18:08:58,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:08:58,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:58,154 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] [2022-02-20 18:08:58,172 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:58,370 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:58,371 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash -497555309, now seen corresponding path program 1 times [2022-02-20 18:08:58,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:58,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6222807] [2022-02-20 18:08:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:58,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:58,375 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:58,376 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:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:08:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:58,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {1935#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);~cleanupTimeShifts~0 := 4bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~retValue_acc~0#1, main_~tmp~0#1;havoc main_~retValue_acc~0#1;havoc main_~tmp~0#1;assume { :begin_inline_select_helpers } true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {1940#(= ~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret4#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~0#1 := main_#t~ret4#1;havoc main_#t~ret4#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~0#1;assume { :begin_inline_setup } true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_#t~nondet31#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !false; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~4#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~4#1); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~0#1); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___1~0#1;assume { :begin_inline_stopSystem } true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} ~systemActive~0 := 0bv32; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_stopSystem } true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_#t~ret50#1, __utac_acc__Specification3_spec__1_#t~ret51#1, __utac_acc__Specification3_spec__1_~tmp~7#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~7#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,638 INFO L272 TraceCheckUtils]: 23: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret49#1 := isMethaneLevelCritical(); {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~8;~retValue_acc~8 := ~methaneLevelCritical~0;#res := ~retValue_acc~8; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume true; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,640 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1940#(= ~waterLevel~0 (_ bv1 32))} {1940#(= ~waterLevel~0 (_ bv1 32))} #215#return; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~7#1 := __utac_acc__Specification3_spec__1_#t~ret49#1;havoc __utac_acc__Specification3_spec__1_#t~ret49#1; {1940#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~7#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; {2025#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:08:58,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {2025#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret50#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret50#1;havoc __utac_acc__Specification3_spec__1_#t~ret50#1; {2029#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~1#1| (_ bv1 32))} is VALID [2022-02-20 18:08:58,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {2029#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~1#1| (_ bv1 32))} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~1#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1936#false} is VALID [2022-02-20 18:08:58,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {1936#false} __utac_acc__Specification3_spec__1_#t~ret51#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret51#1;havoc __utac_acc__Specification3_spec__1_#t~ret51#1; {1936#false} is VALID [2022-02-20 18:08:58,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {1936#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1936#false} is VALID [2022-02-20 18:08:58,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {1936#false} assume !false; {1936#false} is VALID [2022-02-20 18:08:58,656 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:58,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:58,657 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:58,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6222807] [2022-02-20 18:08:58,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6222807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:58,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:58,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:08:58,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479479673] [2022-02-20 18:08:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 34 [2022-02-20 18:08:58,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:58,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:58,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:58,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:58,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:58,704 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,981 INFO L93 Difference]: Finished difference Result 352 states and 461 transitions. [2022-02-20 18:08:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 34 [2022-02-20 18:08:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2022-02-20 18:08:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2022-02-20 18:08:59,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 241 transitions. [2022-02-20 18:08:59,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:59,170 INFO L225 Difference]: With dead ends: 352 [2022-02-20 18:08:59,170 INFO L226 Difference]: Without dead ends: 235 [2022-02-20 18:08:59,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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:59,171 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 52 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 349 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:59,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 349 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:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-20 18:08:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2022-02-20 18:08:59,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:59,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) [2022-02-20 18:08:59,188 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) [2022-02-20 18:08:59,189 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) [2022-02-20 18:08:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,197 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2022-02-20 18:08:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 300 transitions. [2022-02-20 18:08:59,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) Second operand 235 states. [2022-02-20 18:08:59,200 INFO L87 Difference]: Start difference. First operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) Second operand 235 states. [2022-02-20 18:08:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,208 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2022-02-20 18:08:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 300 transitions. [2022-02-20 18:08:59,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:59,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.308641975308642) internal successors, (212), 181 states have internal predecessors, (212), 40 states have call successors, (40), 28 states have call predecessors, (40), 26 states have return successors, (42), 28 states have call predecessors, (42), 40 states have call successors, (42) [2022-02-20 18:08:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 294 transitions. [2022-02-20 18:08:59,218 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 294 transitions. Word has length 34 [2022-02-20 18:08:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:59,218 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 294 transitions. [2022-02-20 18:08:59,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 294 transitions. [2022-02-20 18:08:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:08:59,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:59,220 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, 1, 1] [2022-02-20 18:08:59,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:59,426 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:59,427 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 841670873, now seen corresponding path program 1 times [2022-02-20 18:08:59,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:59,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479155950] [2022-02-20 18:08:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:59,429 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:59,431 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:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:59,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:59,518 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:08:59,519 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:59,520 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:59,531 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:59,728 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:59,731 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:08:59,733 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:59,759 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:59,759 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:59,779 INFO L158 Benchmark]: Toolchain (without parser) took 4990.76ms. Allocated memory was 46.1MB in the beginning and 81.8MB in the end (delta: 35.7MB). Free memory was 21.2MB in the beginning and 26.0MB in the end (delta: -4.8MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,779 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 36.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:59,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.61ms. Allocated memory was 46.1MB in the beginning and 58.7MB in the end (delta: 12.6MB). Free memory was 21.0MB in the beginning and 31.6MB in the end (delta: -10.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.62ms. Allocated memory is still 58.7MB. Free memory was 31.4MB in the beginning and 29.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,780 INFO L158 Benchmark]: Boogie Preprocessor took 32.05ms. Allocated memory is still 58.7MB. Free memory was 29.0MB in the beginning and 27.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,780 INFO L158 Benchmark]: RCFGBuilder took 442.95ms. Allocated memory is still 58.7MB. Free memory was 27.2MB in the beginning and 26.1MB in the end (delta: 1.1MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,780 INFO L158 Benchmark]: TraceAbstraction took 3973.40ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 41.0MB in the beginning and 26.0MB in the end (delta: 15.0MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,781 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.16ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 36.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.61ms. Allocated memory was 46.1MB in the beginning and 58.7MB in the end (delta: 12.6MB). Free memory was 21.0MB in the beginning and 31.6MB in the end (delta: -10.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.62ms. Allocated memory is still 58.7MB. Free memory was 31.4MB in the beginning and 29.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.05ms. Allocated memory is still 58.7MB. Free memory was 29.0MB in the beginning and 27.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.95ms. Allocated memory is still 58.7MB. Free memory was 27.2MB in the beginning and 26.1MB in the end (delta: 1.1MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3973.40ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 41.0MB in the beginning and 26.0MB in the end (delta: 15.0MB). Peak memory consumption was 37.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:59,825 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