./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product59.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_product59.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 44dae38cb994480933527955346e93b306d1aac023f2c5b3e53f2823ec637c09 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:09:37,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:09:37,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:09:37,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:09:37,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:09:37,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:09:37,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:09:37,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:09:37,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:09:37,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:09:37,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:09:37,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:09:37,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:09:37,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:09:37,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:09:37,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:09:37,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:09:37,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:09:37,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:09:37,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:09:37,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:09:37,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:09:37,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:09:37,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:09:37,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:09:37,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:09:37,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:09:37,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:09:37,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:09:37,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:09:37,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:09:37,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:09:37,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:09:37,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:09:37,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:09:37,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:09:37,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:09:37,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:09:37,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:09:37,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:09:37,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:09:37,881 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:09:37,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:09:37,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:09:37,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:09:37,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:09:37,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:09:37,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:09:37,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:09:37,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:09:37,913 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:09:37,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:09:37,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:09:37,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:09:37,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:09:37,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:09:37,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:09:37,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:09:37,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:09:37,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:09:37,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:09:37,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:37,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:09:37,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:09:37,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:09:37,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:09:37,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:09:37,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:09:37,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:09:37,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:09:37,919 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 -> 44dae38cb994480933527955346e93b306d1aac023f2c5b3e53f2823ec637c09 [2022-02-20 18:09:38,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:09:38,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:09:38,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:09:38,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:09:38,120 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:09:38,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product59.cil.c [2022-02-20 18:09:38,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a1ec99d/0ff236d673ab4795b79e6479a62806bf/FLAG6e8ad2fbf [2022-02-20 18:09:38,498 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:09:38,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product59.cil.c [2022-02-20 18:09:38,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a1ec99d/0ff236d673ab4795b79e6479a62806bf/FLAG6e8ad2fbf [2022-02-20 18:09:38,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a1ec99d/0ff236d673ab4795b79e6479a62806bf [2022-02-20 18:09:38,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:09:38,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:09:38,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:38,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:09:38,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:09:38,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:38" (1/1) ... [2022-02-20 18:09:38,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0de7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:38, skipping insertion in model container [2022-02-20 18:09:38,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:38" (1/1) ... [2022-02-20 18:09:38,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:09:38,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:39,242 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_product59.cil.c[15143,15156] [2022-02-20 18:09:39,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:39,279 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:09:39,343 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_product59.cil.c[15143,15156] [2022-02-20 18:09:39,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:39,364 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:09:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39 WrapperNode [2022-02-20 18:09:39,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:39,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:39,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:09:39,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:09:39,372 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:09:39" (1/1) ... [2022-02-20 18:09:39,382 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:09:39" (1/1) ... [2022-02-20 18:09:39,419 INFO L137 Inliner]: procedures = 57, calls = 159, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 283 [2022-02-20 18:09:39,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:39,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:09:39,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:09:39,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:09:39,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:09:39,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:09:39,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:09:39,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:09:39,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (1/1) ... [2022-02-20 18:09:39,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:09:39,487 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:09:39,503 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:09:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:09:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:09:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:09:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:09:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:09:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:09:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:09:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:09:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:09:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:09:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:09:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:09:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:09:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:09:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:09:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:09:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:09:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:09:39,574 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:09:39,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:09:39,940 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:09:39,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:09:39,946 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:09:39,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:39 BoogieIcfgContainer [2022-02-20 18:09:39,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:09:39,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:09:39,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:09:39,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:09:39,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:09:38" (1/3) ... [2022-02-20 18:09:39,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41b3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:39, skipping insertion in model container [2022-02-20 18:09:39,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:39" (2/3) ... [2022-02-20 18:09:39,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41b3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:39, skipping insertion in model container [2022-02-20 18:09:39,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:39" (3/3) ... [2022-02-20 18:09:39,954 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product59.cil.c [2022-02-20 18:09:39,961 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:09:39,961 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:09:39,992 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:09:39,997 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:09:39,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:09:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 18:09:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:09:40,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:40,021 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:09:40,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1192429989, now seen corresponding path program 1 times [2022-02-20 18:09:40,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:40,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988056285] [2022-02-20 18:09:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:09:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:40,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {103#true} is VALID [2022-02-20 18:09:40,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume true; {103#true} is VALID [2022-02-20 18:09:40,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103#true} {104#false} #262#return; {104#false} is VALID [2022-02-20 18:09:40,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {103#true} is VALID [2022-02-20 18:09:40,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {103#true} is VALID [2022-02-20 18:09:40,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {103#true} is VALID [2022-02-20 18:09:40,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {103#true} is VALID [2022-02-20 18:09:40,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#true} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {103#true} is VALID [2022-02-20 18:09:40,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {103#true} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {103#true} is VALID [2022-02-20 18:09:40,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {103#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {103#true} is VALID [2022-02-20 18:09:40,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#true} assume false; {104#false} is VALID [2022-02-20 18:09:40,249 INFO L272 TraceCheckUtils]: 8: Hoare triple {104#false} call cleanup(); {104#false} is VALID [2022-02-20 18:09:40,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {104#false} havoc ~i~0;havoc ~__cil_tmp2~0; {104#false} is VALID [2022-02-20 18:09:40,250 INFO L272 TraceCheckUtils]: 10: Hoare triple {104#false} call timeShift(); {104#false} is VALID [2022-02-20 18:09:40,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#false} assume !(0 != ~pumpRunning~0); {104#false} is VALID [2022-02-20 18:09:40,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {104#false} assume !(0 != ~systemActive~0); {104#false} is VALID [2022-02-20 18:09:40,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {104#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {104#false} is VALID [2022-02-20 18:09:40,251 INFO L272 TraceCheckUtils]: 14: Hoare triple {104#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {103#true} is VALID [2022-02-20 18:09:40,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {103#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {103#true} is VALID [2022-02-20 18:09:40,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {103#true} assume true; {103#true} is VALID [2022-02-20 18:09:40,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {103#true} {104#false} #262#return; {104#false} is VALID [2022-02-20 18:09:40,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {104#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret34#1 && __utac_acc__Specification3_spec__1_#t~ret34#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {104#false} is VALID [2022-02-20 18:09:40,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {104#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {104#false} is VALID [2022-02-20 18:09:40,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {104#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret35#1 && __utac_acc__Specification3_spec__1_#t~ret35#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {104#false} is VALID [2022-02-20 18:09:40,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {104#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {104#false} is VALID [2022-02-20 18:09:40,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {104#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret36#1 && __utac_acc__Specification3_spec__1_#t~ret36#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {104#false} is VALID [2022-02-20 18:09:40,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {104#false} is VALID [2022-02-20 18:09:40,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {104#false} assume !false; {104#false} is VALID [2022-02-20 18:09:40,255 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:09:40,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:40,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988056285] [2022-02-20 18:09:40,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988056285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:40,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:40,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:40,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023615205] [2022-02-20 18:09:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:40,263 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:09:40,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:40,268 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:09:40,303 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:09:40,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:09:40,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:09:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:09:40,329 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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:09:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:40,454 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2022-02-20 18:09:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:09:40,455 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:09:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:40,456 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:09:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2022-02-20 18:09:40,471 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:09:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2022-02-20 18:09:40,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 261 transitions. [2022-02-20 18:09:40,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:40,679 INFO L225 Difference]: With dead ends: 192 [2022-02-20 18:09:40,680 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:09:40,682 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:09:40,684 INFO L933 BasicCegarLoop]: 127 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, 127 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:09:40,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:09:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 18:09:40,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:40,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:40,711 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:40,712 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:40,717 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-02-20 18:09:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:40,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:40,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:40,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 91 states. [2022-02-20 18:09:40,720 INFO L87 Difference]: Start difference. First operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 91 states. [2022-02-20 18:09:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:40,724 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-02-20 18:09:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:40,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:40,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:40,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:40,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2022-02-20 18:09:40,731 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 25 [2022-02-20 18:09:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:40,731 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2022-02-20 18:09:40,731 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:09:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:09:40,733 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:40,733 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:09:40,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:09:40,734 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1057066551, now seen corresponding path program 1 times [2022-02-20 18:09:40,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:40,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770462807] [2022-02-20 18:09:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:09:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:40,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {703#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {703#true} is VALID [2022-02-20 18:09:40,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#true} assume true; {703#true} is VALID [2022-02-20 18:09:40,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {703#true} {704#false} #262#return; {704#false} is VALID [2022-02-20 18:09:40,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {703#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {703#true} is VALID [2022-02-20 18:09:40,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {703#true} is VALID [2022-02-20 18:09:40,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {703#true} is VALID [2022-02-20 18:09:40,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {703#true} is VALID [2022-02-20 18:09:40,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {703#true} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {703#true} is VALID [2022-02-20 18:09:40,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {703#true} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {703#true} is VALID [2022-02-20 18:09:40,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {703#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {705#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:09:40,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {705#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {705#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:09:40,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {704#false} is VALID [2022-02-20 18:09:40,793 INFO L272 TraceCheckUtils]: 9: Hoare triple {704#false} call cleanup(); {704#false} is VALID [2022-02-20 18:09:40,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {704#false} havoc ~i~0;havoc ~__cil_tmp2~0; {704#false} is VALID [2022-02-20 18:09:40,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {704#false} call timeShift(); {704#false} is VALID [2022-02-20 18:09:40,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {704#false} assume !(0 != ~pumpRunning~0); {704#false} is VALID [2022-02-20 18:09:40,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {704#false} assume !(0 != ~systemActive~0); {704#false} is VALID [2022-02-20 18:09:40,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {704#false} is VALID [2022-02-20 18:09:40,794 INFO L272 TraceCheckUtils]: 15: Hoare triple {704#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {703#true} is VALID [2022-02-20 18:09:40,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {703#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {703#true} is VALID [2022-02-20 18:09:40,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {703#true} assume true; {703#true} is VALID [2022-02-20 18:09:40,795 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {703#true} {704#false} #262#return; {704#false} is VALID [2022-02-20 18:09:40,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {704#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret34#1 && __utac_acc__Specification3_spec__1_#t~ret34#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {704#false} is VALID [2022-02-20 18:09:40,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {704#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {704#false} is VALID [2022-02-20 18:09:40,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {704#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret35#1 && __utac_acc__Specification3_spec__1_#t~ret35#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {704#false} is VALID [2022-02-20 18:09:40,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {704#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {704#false} is VALID [2022-02-20 18:09:40,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {704#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret36#1 && __utac_acc__Specification3_spec__1_#t~ret36#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {704#false} is VALID [2022-02-20 18:09:40,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {704#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {704#false} is VALID [2022-02-20 18:09:40,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {704#false} assume !false; {704#false} is VALID [2022-02-20 18:09:40,797 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:09:40,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:40,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770462807] [2022-02-20 18:09:40,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770462807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:40,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:40,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:40,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602521436] [2022-02-20 18:09:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:40,800 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:09:40,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:40,801 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:09:40,820 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:09:40,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:40,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:40,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:40,822 INFO L87 Difference]: Start difference. First operand 91 states and 118 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:09:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:40,904 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-02-20 18:09:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:40,905 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:09:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:40,905 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:09:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:09:40,909 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:09:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:09:40,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-20 18:09:41,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:41,055 INFO L225 Difference]: With dead ends: 144 [2022-02-20 18:09:41,055 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 18:09:41,056 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:09:41,057 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 189 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:09:41,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 18:09:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-02-20 18:09:41,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:41,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:41,064 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:41,064 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:41,068 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-02-20 18:09:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:41,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:41,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:41,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Second operand 82 states. [2022-02-20 18:09:41,069 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Second operand 82 states. [2022-02-20 18:09:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:41,072 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-02-20 18:09:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:41,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:41,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:41,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:41,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-02-20 18:09:41,076 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2022-02-20 18:09:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:41,076 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-02-20 18:09:41,077 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:09:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:09:41,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:41,078 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] [2022-02-20 18:09:41,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:09:41,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1107205587, now seen corresponding path program 1 times [2022-02-20 18:09:41,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:41,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728820836] [2022-02-20 18:09:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:09:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:41,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1202#true} is VALID [2022-02-20 18:09:41,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1202#true} assume true; {1202#true} is VALID [2022-02-20 18:09:41,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1202#true} {1203#false} #262#return; {1203#false} is VALID [2022-02-20 18:09:41,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {1204#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:41,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1204#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {1204#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:41,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1204#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1204#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:41,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {1204#(= 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~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {1205#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-20 18:09:41,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {1205#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1206#(= |ULTIMATE.start_main_~tmp~3#1| ~systemActive~0)} is VALID [2022-02-20 18:09:41,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1206#(= |ULTIMATE.start_main_~tmp~3#1| ~systemActive~0)} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume !false; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~5#1); {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~1#1); {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,163 INFO L272 TraceCheckUtils]: 15: Hoare triple {1207#(not (= 0 ~systemActive~0))} call timeShift(); {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {1207#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:09:41,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {1207#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {1203#false} is VALID [2022-02-20 18:09:41,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {1203#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1203#false} is VALID [2022-02-20 18:09:41,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {1203#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {1202#true} is VALID [2022-02-20 18:09:41,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1202#true} is VALID [2022-02-20 18:09:41,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#true} assume true; {1202#true} is VALID [2022-02-20 18:09:41,165 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1202#true} {1203#false} #262#return; {1203#false} is VALID [2022-02-20 18:09:41,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {1203#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret34#1 && __utac_acc__Specification3_spec__1_#t~ret34#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {1203#false} is VALID [2022-02-20 18:09:41,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {1203#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {1203#false} is VALID [2022-02-20 18:09:41,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {1203#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret35#1 && __utac_acc__Specification3_spec__1_#t~ret35#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {1203#false} is VALID [2022-02-20 18:09:41,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {1203#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {1203#false} is VALID [2022-02-20 18:09:41,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {1203#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret36#1 && __utac_acc__Specification3_spec__1_#t~ret36#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {1203#false} is VALID [2022-02-20 18:09:41,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {1203#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1203#false} is VALID [2022-02-20 18:09:41,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {1203#false} assume !false; {1203#false} is VALID [2022-02-20 18:09:41,167 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:09:41,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:41,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728820836] [2022-02-20 18:09:41,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728820836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:41,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:41,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:09:41,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129632735] [2022-02-20 18:09:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2022-02-20 18:09:41,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:41,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:41,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:41,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:09:41,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:09:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:09:41,189 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:41,664 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2022-02-20 18:09:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:09:41,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2022-02-20 18:09:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2022-02-20 18:09:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2022-02-20 18:09:41,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 362 transitions. [2022-02-20 18:09:41,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:41,832 INFO L225 Difference]: With dead ends: 275 [2022-02-20 18:09:41,832 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 18:09:41,833 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:09:41,833 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 286 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:41,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 483 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:09:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 18:09:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-02-20 18:09:41,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:41,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) [2022-02-20 18:09:41,873 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) [2022-02-20 18:09:41,874 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) [2022-02-20 18:09:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:41,880 INFO L93 Difference]: Finished difference Result 200 states and 259 transitions. [2022-02-20 18:09:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2022-02-20 18:09:41,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:41,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:41,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) Second operand 200 states. [2022-02-20 18:09:41,882 INFO L87 Difference]: Start difference. First operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) Second operand 200 states. [2022-02-20 18:09:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:41,905 INFO L93 Difference]: Finished difference Result 200 states and 259 transitions. [2022-02-20 18:09:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2022-02-20 18:09:41,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:41,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:41,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:41,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 165 states have internal predecessors, (200), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) [2022-02-20 18:09:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 255 transitions. [2022-02-20 18:09:41,915 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 255 transitions. Word has length 30 [2022-02-20 18:09:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:41,916 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 255 transitions. [2022-02-20 18:09:41,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 255 transitions. [2022-02-20 18:09:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:09:41,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:41,917 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:09:41,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:09:41,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 915350115, now seen corresponding path program 1 times [2022-02-20 18:09:41,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:41,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714131401] [2022-02-20 18:09:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:09:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:42,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {2282#true} is VALID [2022-02-20 18:09:42,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-02-20 18:09:42,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2282#true} {2284#(= ~waterLevel~0 1)} #262#return; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2284#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {2284#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {2284#(= ~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~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#(= ~waterLevel~0 1)} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {2284#(= ~waterLevel~0 1)} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {2284#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#(= ~waterLevel~0 1)} assume !false; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {2284#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~5#1); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~1#1); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2284#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___2~0#1);assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp___1~1#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2284#(= ~waterLevel~0 1)} assume 0 != test_~tmp___1~1#1;assume { :begin_inline_stopSystem } true; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {2284#(= ~waterLevel~0 1)} ~systemActive~0 := 0; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {2284#(= ~waterLevel~0 1)} assume { :end_inline_stopSystem } true; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,098 INFO L272 TraceCheckUtils]: 19: Hoare triple {2284#(= ~waterLevel~0 1)} call timeShift(); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != ~systemActive~0); {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {2284#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,100 INFO L272 TraceCheckUtils]: 23: Hoare triple {2284#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {2282#true} is VALID [2022-02-20 18:09:42,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {2282#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {2282#true} is VALID [2022-02-20 18:09:42,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {2282#true} assume true; {2282#true} is VALID [2022-02-20 18:09:42,101 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2282#true} {2284#(= ~waterLevel~0 1)} #262#return; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {2284#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret34#1 && __utac_acc__Specification3_spec__1_#t~ret34#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {2284#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:42,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {2284#(= ~waterLevel~0 1)} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {2288#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:09:42,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {2288#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret35#1 && __utac_acc__Specification3_spec__1_#t~ret35#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {2289#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1|) 0)} is VALID [2022-02-20 18:09:42,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {2289#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1|) 0)} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {2283#false} is VALID [2022-02-20 18:09:42,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {2283#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret36#1 && __utac_acc__Specification3_spec__1_#t~ret36#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {2283#false} is VALID [2022-02-20 18:09:42,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {2283#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {2283#false} is VALID [2022-02-20 18:09:42,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2022-02-20 18:09:42,113 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:09:42,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:42,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714131401] [2022-02-20 18:09:42,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714131401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:42,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:42,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:09:42,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541244830] [2022-02-20 18:09:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:42,114 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:09:42,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:42,114 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:09:42,140 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:09:42,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:09:42,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:09:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:09:42,142 INFO L87 Difference]: Start difference. First operand 194 states and 255 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:09:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:42,376 INFO L93 Difference]: Finished difference Result 560 states and 760 transitions. [2022-02-20 18:09:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:09:42,376 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:09:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:42,377 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:09:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2022-02-20 18:09:42,381 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:09:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2022-02-20 18:09:42,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 306 transitions. [2022-02-20 18:09:42,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:42,555 INFO L225 Difference]: With dead ends: 560 [2022-02-20 18:09:42,555 INFO L226 Difference]: Without dead ends: 373 [2022-02-20 18:09:42,556 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:09:42,556 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 75 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:42,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 427 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-02-20 18:09:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 364. [2022-02-20 18:09:42,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:42,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) [2022-02-20 18:09:42,576 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) [2022-02-20 18:09:42,577 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) [2022-02-20 18:09:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:42,587 INFO L93 Difference]: Finished difference Result 373 states and 490 transitions. [2022-02-20 18:09:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 490 transitions. [2022-02-20 18:09:42,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:42,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:42,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) Second operand 373 states. [2022-02-20 18:09:42,589 INFO L87 Difference]: Start difference. First operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) Second operand 373 states. [2022-02-20 18:09:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:42,599 INFO L93 Difference]: Finished difference Result 373 states and 490 transitions. [2022-02-20 18:09:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 490 transitions. [2022-02-20 18:09:42,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:42,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:42,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:42,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 274 states have (on average 1.3357664233576643) internal successors, (366), 306 states have internal predecessors, (366), 54 states have call successors, (54), 38 states have call predecessors, (54), 35 states have return successors, (60), 35 states have call predecessors, (60), 54 states have call successors, (60) [2022-02-20 18:09:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-02-20 18:09:42,612 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 34 [2022-02-20 18:09:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:42,613 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-02-20 18:09:42,613 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:09:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-02-20 18:09:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:09:42,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:42,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:09:42,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:09:42,614 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1049265448, now seen corresponding path program 1 times [2022-02-20 18:09:42,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:42,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161002526] [2022-02-20 18:09:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:42,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 18:09:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:42,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {4355#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {4355#true} is VALID [2022-02-20 18:09:42,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {4355#true} assume true; {4355#true} is VALID [2022-02-20 18:09:42,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4355#true} {4356#false} #262#return; {4356#false} is VALID [2022-02-20 18:09:42,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {4355#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#(= ~pumpRunning~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#(= ~pumpRunning~0 0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {4357#(= ~pumpRunning~0 0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {4357#(= ~pumpRunning~0 0)} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#(= ~pumpRunning~0 0)} assume 0 != main_~tmp~3#1;assume { :begin_inline_setup } true; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#(= ~pumpRunning~0 0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#(= ~pumpRunning~0 0)} assume !false; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#(= ~pumpRunning~0 0)} assume test_~splverifierCounter~0#1 < 4; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {4357#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {4357#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp~5#1); {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {4357#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {4357#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___0~1#1); {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {4357#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___2~0#1);assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp___1~1#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {4357#(= ~pumpRunning~0 0)} assume 0 != test_~tmp___1~1#1;assume { :begin_inline_stopSystem } true; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {4357#(= ~pumpRunning~0 0)} assume !(0 != ~pumpRunning~0); {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {4357#(= ~pumpRunning~0 0)} ~systemActive~0 := 0; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {4357#(= ~pumpRunning~0 0)} assume { :end_inline_stopSystem } true; {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {4357#(= ~pumpRunning~0 0)} call timeShift(); {4357#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:09:42,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {4357#(= ~pumpRunning~0 0)} assume 0 != ~pumpRunning~0;assume { :begin_inline_lowerWaterLevel } true; {4356#false} is VALID [2022-02-20 18:09:42,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {4356#false} assume ~waterLevel~0 > 0;~waterLevel~0 := ~waterLevel~0 - 1; {4356#false} is VALID [2022-02-20 18:09:42,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {4356#false} assume { :end_inline_lowerWaterLevel } true; {4356#false} is VALID [2022-02-20 18:09:42,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {4356#false} assume !(0 != ~systemActive~0); {4356#false} is VALID [2022-02-20 18:09:42,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {4356#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {4356#false} is VALID [2022-02-20 18:09:42,658 INFO L272 TraceCheckUtils]: 25: Hoare triple {4356#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {4355#true} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {4355#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {4355#true} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {4355#true} assume true; {4355#true} is VALID [2022-02-20 18:09:42,659 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4355#true} {4356#false} #262#return; {4356#false} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {4356#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret34#1 && __utac_acc__Specification3_spec__1_#t~ret34#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {4356#false} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {4356#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {4356#false} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {4356#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret35#1 && __utac_acc__Specification3_spec__1_#t~ret35#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {4356#false} is VALID [2022-02-20 18:09:42,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {4356#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {4356#false} is VALID [2022-02-20 18:09:42,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {4356#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret36#1 && __utac_acc__Specification3_spec__1_#t~ret36#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {4356#false} is VALID [2022-02-20 18:09:42,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {4356#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {4356#false} is VALID [2022-02-20 18:09:42,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {4356#false} assume !false; {4356#false} is VALID [2022-02-20 18:09:42,660 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:09:42,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:42,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161002526] [2022-02-20 18:09:42,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161002526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:42,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:42,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:42,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134073212] [2022-02-20 18:09:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 36 [2022-02-20 18:09:42,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:42,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:09:42,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:42,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:42,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:42,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:42,682 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:09:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:42,818 INFO L93 Difference]: Finished difference Result 852 states and 1147 transitions. [2022-02-20 18:09:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 36 [2022-02-20 18:09:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:09:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-20 18:09:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:09:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-20 18:09:42,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 268 transitions. [2022-02-20 18:09:42,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:42,978 INFO L225 Difference]: With dead ends: 852 [2022-02-20 18:09:42,978 INFO L226 Difference]: Without dead ends: 495 [2022-02-20 18:09:42,979 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:09:42,980 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 65 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:42,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 172 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-02-20 18:09:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2022-02-20 18:09:42,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:42,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) [2022-02-20 18:09:42,998 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) [2022-02-20 18:09:42,999 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) [2022-02-20 18:09:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:43,013 INFO L93 Difference]: Finished difference Result 495 states and 633 transitions. [2022-02-20 18:09:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 633 transitions. [2022-02-20 18:09:43,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:43,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:43,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) Second operand 495 states. [2022-02-20 18:09:43,016 INFO L87 Difference]: Start difference. First operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) Second operand 495 states. [2022-02-20 18:09:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:43,031 INFO L93 Difference]: Finished difference Result 495 states and 633 transitions. [2022-02-20 18:09:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 633 transitions. [2022-02-20 18:09:43,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:43,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:43,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:43,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 370 states have (on average 1.2918918918918918) internal successors, (478), 397 states have internal predecessors, (478), 61 states have call successors, (61), 55 states have call predecessors, (61), 52 states have return successors, (83), 55 states have call predecessors, (83), 61 states have call successors, (83) [2022-02-20 18:09:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 622 transitions. [2022-02-20 18:09:43,049 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 622 transitions. Word has length 36 [2022-02-20 18:09:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:43,050 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 622 transitions. [2022-02-20 18:09:43,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:09:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 622 transitions. [2022-02-20 18:09:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:09:43,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:43,051 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:09:43,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:09:43,051 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1706214601, now seen corresponding path program 1 times [2022-02-20 18:09:43,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:43,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35067927] [2022-02-20 18:09:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:43,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:09:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:43,107 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:09:43,108 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:09:43,108 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:09:43,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:09:43,111 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:09:43,114 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:09:43,129 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:09:43,129 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:09:43,132 INFO L158 Benchmark]: Toolchain (without parser) took 4216.56ms. Allocated memory was 88.1MB in the beginning and 146.8MB in the end (delta: 58.7MB). Free memory was 55.3MB in the beginning and 46.4MB in the end (delta: 8.9MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,132 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:43,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.96ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 53.2MB in the end (delta: 1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 88.1MB. Free memory was 53.2MB in the beginning and 50.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,133 INFO L158 Benchmark]: Boogie Preprocessor took 28.83ms. Allocated memory is still 88.1MB. Free memory was 50.1MB in the beginning and 48.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,133 INFO L158 Benchmark]: RCFGBuilder took 498.04ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 48.4MB in the beginning and 90.3MB in the end (delta: -41.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,133 INFO L158 Benchmark]: TraceAbstraction took 3182.21ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 89.4MB in the beginning and 46.4MB in the end (delta: 43.0MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2022-02-20 18:09:43,134 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.17ms. Allocated memory is still 88.1MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.96ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 53.2MB in the end (delta: 1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 88.1MB. Free memory was 53.2MB in the beginning and 50.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.83ms. Allocated memory is still 88.1MB. Free memory was 50.1MB in the beginning and 48.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.04ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 48.4MB in the beginning and 90.3MB in the end (delta: -41.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3182.21ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 89.4MB in the beginning and 46.4MB in the end (delta: 43.0MB). Peak memory consumption was 67.7MB. 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:09:43,160 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_product59.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 44dae38cb994480933527955346e93b306d1aac023f2c5b3e53f2823ec637c09 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:09:45,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:09:45,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:09:45,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:09:45,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:09:45,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:09:45,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:09:45,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:09:45,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:09:45,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:09:45,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:09:45,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:09:45,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:09:45,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:09:45,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:09:45,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:09:45,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:09:45,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:09:45,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:09:45,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:09:45,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:09:45,195 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:09:45,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:09:45,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:09:45,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:09:45,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:09:45,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:09:45,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:09:45,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:09:45,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:09:45,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:09:45,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:09:45,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:09:45,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:09:45,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:09:45,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:09:45,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:09:45,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:09:45,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:09:45,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:09:45,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:09:45,209 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:09:45,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:09:45,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:09:45,241 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:09:45,241 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:09:45,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:09:45,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:09:45,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:09:45,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:09:45,243 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:09:45,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:09:45,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:09:45,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:09:45,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:09:45,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:09:45,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:09:45,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:09:45,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:09:45,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:09:45,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:09:45,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:45,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:09:45,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:09:45,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:09:45,247 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:09:45,247 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:09:45,247 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:09:45,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:09:45,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:09:45,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:09:45,248 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 -> 44dae38cb994480933527955346e93b306d1aac023f2c5b3e53f2823ec637c09 [2022-02-20 18:09:45,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:09:45,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:09:45,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:09:45,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:09:45,654 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:09:45,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product59.cil.c [2022-02-20 18:09:45,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfa84802/36e1d274d96344899395f1630f8219ac/FLAGbaca65d2c [2022-02-20 18:09:46,088 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:09:46,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product59.cil.c [2022-02-20 18:09:46,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfa84802/36e1d274d96344899395f1630f8219ac/FLAGbaca65d2c [2022-02-20 18:09:46,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfa84802/36e1d274d96344899395f1630f8219ac [2022-02-20 18:09:46,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:09:46,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:09:46,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:46,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:09:46,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:09:46,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3d1d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46, skipping insertion in model container [2022-02-20 18:09:46,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:09:46,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:46,359 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_product59.cil.c[15143,15156] [2022-02-20 18:09:46,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:46,382 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:09:46,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:46,419 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_product59.cil.c[15143,15156] [2022-02-20 18:09:46,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:46,431 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:09:46,466 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_product59.cil.c[15143,15156] [2022-02-20 18:09:46,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:46,488 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:09:46,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46 WrapperNode [2022-02-20 18:09:46,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:46,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:46,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:09:46,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:09:46,494 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:09:46" (1/1) ... [2022-02-20 18:09:46,507 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:09:46" (1/1) ... [2022-02-20 18:09:46,556 INFO L137 Inliner]: procedures = 59, calls = 159, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 269 [2022-02-20 18:09:46,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:46,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:09:46,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:09:46,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:09:46,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:09:46,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:09:46,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:09:46,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:09:46,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (1/1) ... [2022-02-20 18:09:46,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:46,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:09:46,640 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:09:46,647 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:09:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:09:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:09:46,666 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:09:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:09:46,666 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:09:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:09:46,666 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:09:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:09:46,666 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:09:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:09:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:09:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:09:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:09:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:09:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:09:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:09:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:09:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:09:46,762 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:09:46,780 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:09:47,022 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:09:47,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:09:47,029 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:09:47,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:47 BoogieIcfgContainer [2022-02-20 18:09:47,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:09:47,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:09:47,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:09:47,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:09:47,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:09:46" (1/3) ... [2022-02-20 18:09:47,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff3d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:47, skipping insertion in model container [2022-02-20 18:09:47,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:46" (2/3) ... [2022-02-20 18:09:47,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff3d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:47, skipping insertion in model container [2022-02-20 18:09:47,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:47" (3/3) ... [2022-02-20 18:09:47,035 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product59.cil.c [2022-02-20 18:09:47,039 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:09:47,039 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:09:47,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:09:47,080 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:09:47,081 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:09:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 18:09:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:09:47,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:47,100 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:09:47,100 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1192429989, now seen corresponding path program 1 times [2022-02-20 18:09:47,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:47,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677505431] [2022-02-20 18:09:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:47,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:47,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:47,120 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:09:47,120 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:09:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:47,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:09:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:47,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:47,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#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(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {103#true} is VALID [2022-02-20 18:09:47,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {103#true} is VALID [2022-02-20 18:09:47,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {103#true} is VALID [2022-02-20 18:09:47,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {103#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {103#true} is VALID [2022-02-20 18:09:47,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#true} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {103#true} is VALID [2022-02-20 18:09:47,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {103#true} assume 0bv32 != main_~tmp~3#1;assume { :begin_inline_setup } true; {103#true} is VALID [2022-02-20 18:09:47,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {103#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {103#true} is VALID [2022-02-20 18:09:47,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#true} assume false; {104#false} is VALID [2022-02-20 18:09:47,333 INFO L272 TraceCheckUtils]: 8: Hoare triple {104#false} call cleanup(); {104#false} is VALID [2022-02-20 18:09:47,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {104#false} havoc ~i~0;havoc ~__cil_tmp2~0; {104#false} is VALID [2022-02-20 18:09:47,334 INFO L272 TraceCheckUtils]: 10: Hoare triple {104#false} call timeShift(); {104#false} is VALID [2022-02-20 18:09:47,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#false} assume !(0bv32 != ~pumpRunning~0); {104#false} is VALID [2022-02-20 18:09:47,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {104#false} assume !(0bv32 != ~systemActive~0); {104#false} is VALID [2022-02-20 18:09:47,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {104#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {104#false} is VALID [2022-02-20 18:09:47,334 INFO L272 TraceCheckUtils]: 14: Hoare triple {104#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {104#false} is VALID [2022-02-20 18:09:47,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {104#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {104#false} is VALID [2022-02-20 18:09:47,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {104#false} assume true; {104#false} is VALID [2022-02-20 18:09:47,335 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {104#false} {104#false} #262#return; {104#false} is VALID [2022-02-20 18:09:47,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {104#false} __utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {104#false} is VALID [2022-02-20 18:09:47,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {104#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {104#false} is VALID [2022-02-20 18:09:47,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {104#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {104#false} is VALID [2022-02-20 18:09:47,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {104#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {104#false} is VALID [2022-02-20 18:09:47,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {104#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {104#false} is VALID [2022-02-20 18:09:47,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {104#false} is VALID [2022-02-20 18:09:47,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {104#false} assume !false; {104#false} is VALID [2022-02-20 18:09:47,337 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:09:47,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:47,338 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:47,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677505431] [2022-02-20 18:09:47,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677505431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:47,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:47,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:47,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168416258] [2022-02-20 18:09:47,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:47,357 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:09:47,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:47,360 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:09:47,382 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:09:47,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:09:47,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:09:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:09:47,399 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.381578947368421) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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:09:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:47,573 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2022-02-20 18:09:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:09:47,574 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:09:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:47,575 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:09:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2022-02-20 18:09:47,597 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:09:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2022-02-20 18:09:47,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 261 transitions. [2022-02-20 18:09:47,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:47,840 INFO L225 Difference]: With dead ends: 192 [2022-02-20 18:09:47,840 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:09:47,843 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:09:47,845 INFO L933 BasicCegarLoop]: 127 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, 127 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:09:47,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:09:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 18:09:47,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:47,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:47,873 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:47,873 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:47,880 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-02-20 18:09:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:47,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:47,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:47,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 91 states. [2022-02-20 18:09:47,882 INFO L87 Difference]: Start difference. First operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 91 states. [2022-02-20 18:09:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:47,887 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2022-02-20 18:09:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:47,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:47,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:47,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:47,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 18:09:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2022-02-20 18:09:47,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 25 [2022-02-20 18:09:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:47,894 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2022-02-20 18:09:47,895 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:09:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-02-20 18:09:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:09:47,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:47,896 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:09:47,907 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:09:48,103 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:09:48,103 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1057066551, now seen corresponding path program 1 times [2022-02-20 18:09:48,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:48,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721028941] [2022-02-20 18:09:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:48,119 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:09:48,120 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:09:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:48,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:09:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:48,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:48,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#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(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {772#true} is VALID [2022-02-20 18:09:48,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {772#true} is VALID [2022-02-20 18:09:48,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {772#true} is VALID [2022-02-20 18:09:48,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {772#true} is VALID [2022-02-20 18:09:48,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#true} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {772#true} is VALID [2022-02-20 18:09:48,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} assume 0bv32 != main_~tmp~3#1;assume { :begin_inline_setup } true; {772#true} is VALID [2022-02-20 18:09:48,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {795#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:09:48,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {795#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {795#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L272 TraceCheckUtils]: 9: Hoare triple {773#false} call cleanup(); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#false} havoc ~i~0;havoc ~__cil_tmp2~0; {773#false} is VALID [2022-02-20 18:09:48,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {773#false} call timeShift(); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {773#false} assume !(0bv32 != ~pumpRunning~0); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#false} assume !(0bv32 != ~systemActive~0); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {773#false} is VALID [2022-02-20 18:09:48,319 INFO L272 TraceCheckUtils]: 15: Hoare triple {773#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {773#false} is VALID [2022-02-20 18:09:48,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#false} assume true; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#false} {773#false} #262#return; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#false} __utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {773#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {773#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {773#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {773#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {773#false} is VALID [2022-02-20 18:09:48,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-02-20 18:09:48,321 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:09:48,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:48,321 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:48,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721028941] [2022-02-20 18:09:48,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721028941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:48,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:48,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:48,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595291882] [2022-02-20 18:09:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:48,322 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:09:48,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:48,330 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:09:48,351 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:09:48,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:48,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:48,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:48,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:48,352 INFO L87 Difference]: Start difference. First operand 91 states and 118 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:09:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:48,515 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-02-20 18:09:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:48,515 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:09:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:48,516 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:09:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:09:48,519 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:09:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 18:09:48,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-20 18:09:48,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:48,716 INFO L225 Difference]: With dead ends: 144 [2022-02-20 18:09:48,716 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 18:09:48,719 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:09:48,720 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 189 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:09:48,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 18:09:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-02-20 18:09:48,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:48,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:48,735 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:48,735 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:48,738 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-02-20 18:09:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:48,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Second operand 82 states. [2022-02-20 18:09:48,740 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Second operand 82 states. [2022-02-20 18:09:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:48,742 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-02-20 18:09:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:48,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:48,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:48,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:48,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:09:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-02-20 18:09:48,745 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2022-02-20 18:09:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:48,746 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-02-20 18:09:48,746 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:09:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-02-20 18:09:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:09:48,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:48,747 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] [2022-02-20 18:09:48,755 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:09:48,953 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:09:48,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1107205587, now seen corresponding path program 1 times [2022-02-20 18:09:48,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:48,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311907468] [2022-02-20 18:09:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:48,959 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:09:48,967 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:09:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:49,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:09:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:49,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:49,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1343#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(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {1348#(= ~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~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != main_~tmp~3#1;assume { :begin_inline_setup } true; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume !false; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~5#1); {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~1#1); {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1; {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,136 INFO L272 TraceCheckUtils]: 15: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1348#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {1348#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {1344#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L272 TraceCheckUtils]: 19: Hoare triple {1344#false} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {1344#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {1344#false} assume true; {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1344#false} {1344#false} #262#return; {1344#false} is VALID [2022-02-20 18:09:49,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {1344#false} __utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {1344#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1344#false} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {1344#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1344#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1344#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1344#false} is VALID [2022-02-20 18:09:49,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-02-20 18:09:49,139 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:09:49,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:49,139 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:49,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311907468] [2022-02-20 18:09:49,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311907468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:49,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:49,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:49,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885059061] [2022-02-20 18:09:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 30 [2022-02-20 18:09:49,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:49,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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:09:49,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:49,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:49,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:49,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:49,167 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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:09:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:49,319 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2022-02-20 18:09:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:49,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 30 [2022-02-20 18:09:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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:09:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2022-02-20 18:09:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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:09:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2022-02-20 18:09:49,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 304 transitions. [2022-02-20 18:09:49,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:49,529 INFO L225 Difference]: With dead ends: 231 [2022-02-20 18:09:49,529 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 18:09:49,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:09:49,530 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 86 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:49,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 228 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 18:09:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2022-02-20 18:09:49,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:49,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 18:09:49,545 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 18:09:49,545 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 18:09:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:49,549 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2022-02-20 18:09:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2022-02-20 18:09:49,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:49,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:49,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) Second operand 156 states. [2022-02-20 18:09:49,551 INFO L87 Difference]: Start difference. First operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) Second operand 156 states. [2022-02-20 18:09:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:49,555 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2022-02-20 18:09:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2022-02-20 18:09:49,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:49,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:49,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:49,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 116 states have (on average 1.353448275862069) internal successors, (157), 131 states have internal predecessors, (157), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 18:09:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2022-02-20 18:09:49,560 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 30 [2022-02-20 18:09:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:49,560 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2022-02-20 18:09:49,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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:09:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2022-02-20 18:09:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:09:49,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:49,561 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:09:49,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 18:09:49,767 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:09:49,768 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 915350115, now seen corresponding path program 1 times [2022-02-20 18:09:49,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:49,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608365429] [2022-02-20 18:09:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:49,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:49,770 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:09:49,776 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:09:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:49,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:09:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:49,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:49,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {2297#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(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_~retValue_acc~7#1, main_~tmp~3#1;havoc main_~retValue_acc~7#1;havoc main_~tmp~3#1;assume { :begin_inline_select_helpers } true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {2302#(= ~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~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret32#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~3#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~3#1;assume { :begin_inline_setup } true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !false; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~5#1); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~1#1); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___2~0#1);test_~tmp___1~1#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___1~1#1;assume { :begin_inline_stopSystem } true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} ~systemActive~0 := 0bv32; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_stopSystem } true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret34#1, __utac_acc__Specification3_spec__1_#t~ret35#1, __utac_acc__Specification3_spec__1_#t~ret36#1, __utac_acc__Specification3_spec__1_~tmp~4#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~4#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,950 INFO L272 TraceCheckUtils]: 23: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret34#1 := isMethaneLevelCritical(); {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume true; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,953 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2302#(= ~waterLevel~0 (_ bv1 32))} {2302#(= ~waterLevel~0 (_ bv1 32))} #262#return; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~4#1 := __utac_acc__Specification3_spec__1_#t~ret34#1;havoc __utac_acc__Specification3_spec__1_#t~ret34#1; {2302#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:49,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {2302#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~4#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {2387#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:09:49,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {2387#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret35#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret35#1;havoc __utac_acc__Specification3_spec__1_#t~ret35#1; {2391#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} is VALID [2022-02-20 18:09:49,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {2391#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~11#1;havoc isPumpRunning_~retValue_acc~11#1;isPumpRunning_~retValue_acc~11#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; {2298#false} is VALID [2022-02-20 18:09:49,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {2298#false} __utac_acc__Specification3_spec__1_#t~ret36#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret36#1;havoc __utac_acc__Specification3_spec__1_#t~ret36#1; {2298#false} is VALID [2022-02-20 18:09:49,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {2298#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {2298#false} is VALID [2022-02-20 18:09:49,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {2298#false} assume !false; {2298#false} is VALID [2022-02-20 18:09:49,955 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:09:49,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:49,955 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:49,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608365429] [2022-02-20 18:09:49,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608365429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:49,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:49,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:09:49,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931628155] [2022-02-20 18:09:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:49,956 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:09:49,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:49,956 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:09:49,986 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:09:49,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:09:49,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:09:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:09:49,986 INFO L87 Difference]: Start difference. First operand 153 states and 201 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:09:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:50,283 INFO L93 Difference]: Finished difference Result 439 states and 594 transitions. [2022-02-20 18:09:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:09:50,283 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:09:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:50,283 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:09:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2022-02-20 18:09:50,287 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:09:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2022-02-20 18:09:50,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 306 transitions. [2022-02-20 18:09:50,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:50,511 INFO L225 Difference]: With dead ends: 439 [2022-02-20 18:09:50,512 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 18:09:50,512 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:09:50,513 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 72 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:50,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 427 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 18:09:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2022-02-20 18:09:50,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:50,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2022-02-20 18:09:50,526 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2022-02-20 18:09:50,527 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2022-02-20 18:09:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:50,536 INFO L93 Difference]: Finished difference Result 293 states and 384 transitions. [2022-02-20 18:09:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 384 transitions. [2022-02-20 18:09:50,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:50,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:50,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) Second operand 293 states. [2022-02-20 18:09:50,538 INFO L87 Difference]: Start difference. First operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) Second operand 293 states. [2022-02-20 18:09:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:50,547 INFO L93 Difference]: Finished difference Result 293 states and 384 transitions. [2022-02-20 18:09:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 384 transitions. [2022-02-20 18:09:50,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:50,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:50,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:50,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2022-02-20 18:09:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 378 transitions. [2022-02-20 18:09:50,557 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 378 transitions. Word has length 34 [2022-02-20 18:09:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:50,558 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 378 transitions. [2022-02-20 18:09:50,558 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:09:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 378 transitions. [2022-02-20 18:09:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:09:50,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:50,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:09:50,577 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:09:50,765 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:09:50,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1706214601, now seen corresponding path program 1 times [2022-02-20 18:09:50,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:50,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257740844] [2022-02-20 18:09:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:50,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:50,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:50,768 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:09:50,770 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:09:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:50,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:09:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:50,868 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:09:50,868 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:09:50,869 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:09:50,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 18:09:51,079 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:09:51,082 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:09:51,085 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:09:51,118 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:09:51,119 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:09:51,122 INFO L158 Benchmark]: Toolchain (without parser) took 4977.95ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 48.1MB in the beginning and 99.3MB in the end (delta: -51.1MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,122 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:51,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.74ms. Allocated memory is still 73.4MB. Free memory was 48.0MB in the beginning and 37.6MB in the end (delta: 10.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.45ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 56.4MB in the end (delta: -19.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,123 INFO L158 Benchmark]: Boogie Preprocessor took 56.65ms. Allocated memory is still 73.4MB. Free memory was 56.4MB in the beginning and 54.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,123 INFO L158 Benchmark]: RCFGBuilder took 415.72ms. Allocated memory is still 73.4MB. Free memory was 54.3MB in the beginning and 35.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,123 INFO L158 Benchmark]: TraceAbstraction took 4089.73ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 35.1MB in the beginning and 99.3MB in the end (delta: -64.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-02-20 18:09:51,124 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 50.3MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.74ms. Allocated memory is still 73.4MB. Free memory was 48.0MB in the beginning and 37.6MB in the end (delta: 10.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.45ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 56.4MB in the end (delta: -19.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.65ms. Allocated memory is still 73.4MB. Free memory was 56.4MB in the beginning and 54.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.72ms. Allocated memory is still 73.4MB. Free memory was 54.3MB in the beginning and 35.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4089.73ms. Allocated memory was 73.4MB in the beginning and 121.6MB in the end (delta: 48.2MB). Free memory was 35.1MB in the beginning and 99.3MB in the end (delta: -64.2MB). Peak memory consumption was 38.8MB. 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:09:51,163 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator