./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 454aaa6b423a8831b8582dfeb545ec6b3447f968 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:51:33,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:51:33,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:51:33,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:51:33,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:51:33,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:51:33,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:51:33,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:51:33,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:51:33,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:51:33,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:51:33,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:51:33,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:51:33,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:51:33,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:51:33,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:51:33,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:51:33,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:51:33,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:51:33,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:51:33,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:51:33,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:51:33,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:51:33,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:51:33,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:51:33,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:51:33,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:51:33,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:51:33,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:51:33,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:51:33,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:51:33,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:51:33,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:51:33,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:51:33,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:51:33,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:51:33,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:51:33,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:51:33,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:51:33,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:51:33,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:51:33,834 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:51:33,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:51:33,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:51:33,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:51:33,861 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:51:33,861 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:51:33,861 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:51:33,861 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:51:33,862 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:51:33,862 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:51:33,862 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:51:33,862 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:51:33,862 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:51:33,863 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:51:33,863 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:51:33,863 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:51:33,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:51:33,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:51:33,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:51:33,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:51:33,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:51:33,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:51:33,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:51:33,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:51:33,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:51:33,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:51:33,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:51:33,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:51:33,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:51:33,867 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:51:33,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:51:33,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:51:33,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:51:33,867 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 454aaa6b423a8831b8582dfeb545ec6b3447f968 [2019-11-26 02:51:34,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:51:34,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:51:34,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:51:34,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:51:34,017 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:51:34,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c [2019-11-26 02:51:34,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/data/b9fefccf5/3da5c8d15c2f484e9548741213ca1786/FLAG07226b2b0 [2019-11-26 02:51:34,522 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:51:34,523 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c [2019-11-26 02:51:34,534 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/data/b9fefccf5/3da5c8d15c2f484e9548741213ca1786/FLAG07226b2b0 [2019-11-26 02:51:34,873 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/data/b9fefccf5/3da5c8d15c2f484e9548741213ca1786 [2019-11-26 02:51:34,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:51:34,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:51:34,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:51:34,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:51:34,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:51:34,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:51:34" (1/1) ... [2019-11-26 02:51:34,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31191da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:34, skipping insertion in model container [2019-11-26 02:51:34,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:51:34" (1/1) ... [2019-11-26 02:51:34,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:51:34,949 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:51:35,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:51:35,312 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:51:35,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:51:35,414 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:51:35,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35 WrapperNode [2019-11-26 02:51:35,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:51:35,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:51:35,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:51:35,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:51:35,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:51:35,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:51:35,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:51:35,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:51:35,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... [2019-11-26 02:51:35,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:51:35,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:51:35,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:51:35,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:51:35,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:51:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:51:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:51:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:51:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:51:38,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:51:38,020 INFO L284 CfgBuilder]: Removed 194 assume(true) statements. [2019-11-26 02:51:38,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:51:38 BoogieIcfgContainer [2019-11-26 02:51:38,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:51:38,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:51:38,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:51:38,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:51:38,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:51:34" (1/3) ... [2019-11-26 02:51:38,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e97f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:51:38, skipping insertion in model container [2019-11-26 02:51:38,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:51:35" (2/3) ... [2019-11-26 02:51:38,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e97f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:51:38, skipping insertion in model container [2019-11-26 02:51:38,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:51:38" (3/3) ... [2019-11-26 02:51:38,028 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product58.cil.c [2019-11-26 02:51:38,037 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:51:38,043 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:51:38,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:51:38,077 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:51:38,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:51:38,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:51:38,078 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:51:38,078 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:51:38,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:51:38,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:51:38,079 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:51:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:51:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:51:38,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:51:38,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:51:38,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:51:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:51:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 762994306, now seen corresponding path program 1 times [2019-11-26 02:51:38,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:51:38,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597952567] [2019-11-26 02:51:38,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:51:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:51:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:51:38,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597952567] [2019-11-26 02:51:38,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:51:38,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:51:38,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543888204] [2019-11-26 02:51:38,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:51:38,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:51:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:51:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:51:38,628 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-26 02:51:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:51:38,829 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2019-11-26 02:51:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:51:38,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-26 02:51:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:51:38,838 INFO L225 Difference]: With dead ends: 73 [2019-11-26 02:51:38,839 INFO L226 Difference]: Without dead ends: 44 [2019-11-26 02:51:38,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:51:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-26 02:51:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-11-26 02:51:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-26 02:51:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-26 02:51:38,875 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2019-11-26 02:51:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:51:38,875 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-26 02:51:38,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:51:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-26 02:51:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:51:38,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:51:38,876 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:51:38,877 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:51:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:51:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash -822864426, now seen corresponding path program 1 times [2019-11-26 02:51:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:51:38,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008596082] [2019-11-26 02:51:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:51:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:51:39,314 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-11-26 02:51:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:51:39,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008596082] [2019-11-26 02:51:39,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397216293] [2019-11-26 02:51:39,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:51:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:51:39,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-26 02:51:39,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:51:39,909 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-11-26 02:51:40,108 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-26 02:51:40,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:51:40,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:51:40,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,720 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 20 [2019-11-26 02:51:40,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:51:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:51:40,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:51:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:51:40,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88516833] [2019-11-26 02:51:40,846 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:51:40,846 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:51:40,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:51:40,856 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:51:40,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:51:47,631 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:51:49,128 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:51:49,259 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:51:49,860 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 594 DAG size of output: 594 [2019-11-26 02:51:51,110 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 385 [2019-11-26 02:51:53,938 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 753 [2019-11-26 02:51:55,545 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:51:57,615 WARN L192 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 380 DAG size of output: 206 [2019-11-26 02:52:01,808 WARN L192 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:52:02,748 WARN L192 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 146 [2019-11-26 02:52:05,180 WARN L192 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 367 DAG size of output: 263 [2019-11-26 02:52:07,540 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 378 DAG size of output: 259 [2019-11-26 02:52:07,544 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:52:07,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:52:07,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2019-11-26 02:52:07,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786065342] [2019-11-26 02:52:07,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:52:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:52:07,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:52:07,548 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 15 states. [2019-11-26 02:52:07,981 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-11-26 02:52:08,269 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-11-26 02:52:08,447 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-11-26 02:52:08,633 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 37 [2019-11-26 02:52:08,986 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-26 02:52:09,149 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-26 02:52:09,316 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-11-26 02:52:09,565 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 36 [2019-11-26 02:52:09,765 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-11-26 02:52:10,081 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-26 02:52:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:10,130 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2019-11-26 02:52:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 02:52:10,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-11-26 02:52:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:10,132 INFO L225 Difference]: With dead ends: 110 [2019-11-26 02:52:10,132 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:52:10,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-11-26 02:52:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:52:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:52:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:52:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:52:10,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-11-26 02:52:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:10,134 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:52:10,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:52:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:52:10,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:52:10,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:10,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:52:10,593 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 24 [2019-11-26 02:52:10,933 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 24 [2019-11-26 02:52:11,208 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,208 INFO L440 ceAbstractionStarter]: At program point L498(lines 498 511) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,208 INFO L440 ceAbstractionStarter]: At program point L498-1(lines 1 982) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L498-2(lines 498 511) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L498-3(lines 1 982) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L498-4(lines 498 511) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L498-5(lines 1 982) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 508) no Hoare annotation was computed. [2019-11-26 02:52:11,209 INFO L444 ceAbstractionStarter]: For program point L502-2(lines 502 508) no Hoare annotation was computed. [2019-11-26 02:52:11,209 INFO L444 ceAbstractionStarter]: For program point L502-4(lines 502 508) no Hoare annotation was computed. [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L172-2(lines 172 186) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,209 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,209 INFO L440 ceAbstractionStarter]: At program point L176(lines 176 180) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,210 INFO L444 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,210 INFO L444 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,210 INFO L444 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,210 INFO L440 ceAbstractionStarter]: At program point L574(lines 525 575) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,210 INFO L440 ceAbstractionStarter]: At program point L248(lines 248 255) the Hoare annotation is: (and (= 0 ~methaneLevelCritical~0) (= 1 ~waterLevel~0) (= 1 ULTIMATE.start_main_~tmp~0) (= ~pumpRunning~0 0)) [2019-11-26 02:52:11,210 INFO L440 ceAbstractionStarter]: At program point L248-1(lines 248 255) the Hoare annotation is: (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) (= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp___0~2 0) (= ~pumpRunning~0 0)) [2019-11-26 02:52:11,210 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-26 02:52:11,210 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:52:11,211 INFO L440 ceAbstractionStarter]: At program point L527(lines 526 573) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (and (<= ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6 0) (<= 0 ULTIMATE.start___utac_acc__Specification1_spec__1_~tmp~6)) .cse0) (or (and (not (= 1 ~waterLevel~0)) (not (= 0 ~waterLevel~0)) (not (= (+ ~waterLevel~0 1) 0))) .cse0) (or .cse0 (not (= 0 ~systemActive~0))))) [2019-11-26 02:52:11,211 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-26 02:52:11,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:52:11 BoogieIcfgContainer [2019-11-26 02:52:11,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:52:11,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:52:11,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:52:11,231 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:52:11,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:51:38" (3/4) ... [2019-11-26 02:52:11,234 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:52:11,254 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-11-26 02:52:11,255 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2019-11-26 02:52:11,257 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-26 02:52:11,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-26 02:52:11,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:52:11,261 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:52:11,262 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:52:11,373 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b7da0666-ff07-49f4-b6c0-75422e8bdaa3/bin/utaipan/witness.graphml [2019-11-26 02:52:11,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:52:11,374 INFO L168 Benchmark]: Toolchain (without parser) took 36498.25 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 744.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -227.4 MB). Peak memory consumption was 517.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,374 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:11,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,375 INFO L168 Benchmark]: Boogie Preprocessor took 62.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:11,375 INFO L168 Benchmark]: RCFGBuilder took 2476.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,376 INFO L168 Benchmark]: TraceAbstraction took 33208.72 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 619.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -138.9 MB). Peak memory consumption was 480.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,376 INFO L168 Benchmark]: Witness Printer took 142.05 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:11,378 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 537.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2476.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.2 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33208.72 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 619.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -138.9 MB). Peak memory consumption was 480.8 MB. Max. memory is 11.5 GB. * Witness Printer took 142.05 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((tmp <= 0 && 0 <= tmp) || tmp___0 == 0) || pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((0 == methaneLevelCritical && 1 == waterLevel) && 1 == tmp) && pumpRunning == 0 - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((tmp <= 0 && 0 <= tmp) || pumpRunning == 0) && (((!(1 == waterLevel) && !(0 == waterLevel)) && !(waterLevel + 1 == 0)) || pumpRunning == 0)) && (pumpRunning == 0 || !(0 == systemActive)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Result: SAFE, OverallTime: 33.1s, OverallIterations: 2, TraceHistogramMax: 2, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 40 SDtfs, 326 SDslu, 164 SDs, 0 SdLazy, 235 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 95 NumberOfFragments, 418 HoareAnnotationTreeSize, 13 FomulaSimplifications, 3374 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1731 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 5850 SizeOfPredicates, 88 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...