./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product47.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_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/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 982cd7c832ad69be85d11abb6d88a1915810e691 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:35:18,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:35:18,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:35:18,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:35:18,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:35:18,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:35:18,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:35:18,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:35:18,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:35:18,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:35:18,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:35:18,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:35:18,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:35:18,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:35:18,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:35:18,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:35:18,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:35:18,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:35:18,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:35:18,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:35:18,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:35:18,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:35:18,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:35:18,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:35:18,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:35:18,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:35:18,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:35:18,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:35:18,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:35:18,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:35:18,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:35:18,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:35:18,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:35:18,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:35:18,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:35:18,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:35:18,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:35:18,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:35:18,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:35:18,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:35:18,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:35:18,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:35:18,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:35:18,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:35:18,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:35:18,638 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:35:18,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:35:18,639 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:35:18,639 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:35:18,639 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:35:18,639 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:35:18,640 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:35:18,640 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:35:18,640 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:35:18,640 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:35:18,640 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:35:18,641 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:35:18,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:35:18,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:35:18,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:35:18,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:35:18,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:35:18,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:35:18,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:35:18,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:35:18,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:35:18,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:35:18,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:35:18,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:35:18,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:35:18,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:35:18,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:35:18,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:35:18,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:35:18,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:35:18,645 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:35:18,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:35:18,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:35:18,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:35:18,646 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_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/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 -> 982cd7c832ad69be85d11abb6d88a1915810e691 [2019-11-26 02:35:18,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:35:18,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:35:18,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:35:18,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:35:18,838 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:35:18,838 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c [2019-11-26 02:35:18,885 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/data/fb8b6e3be/f23e31d6992f4758936f71bac159e4f5/FLAG0c7f054d2 [2019-11-26 02:35:19,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:35:19,322 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/sv-benchmarks/c/product-lines/minepump_spec4_product47.cil.c [2019-11-26 02:35:19,340 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/data/fb8b6e3be/f23e31d6992f4758936f71bac159e4f5/FLAG0c7f054d2 [2019-11-26 02:35:19,615 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/data/fb8b6e3be/f23e31d6992f4758936f71bac159e4f5 [2019-11-26 02:35:19,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:35:19,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:35:19,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:19,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:35:19,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:35:19,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:19" (1/1) ... [2019-11-26 02:35:19,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e2b7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:19, skipping insertion in model container [2019-11-26 02:35:19,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:19" (1/1) ... [2019-11-26 02:35:19,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:35:19,686 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:35:20,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:20,043 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:35:20,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:20,164 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:35:20,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20 WrapperNode [2019-11-26 02:35:20,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:20,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:20,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:35:20,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:35:20,172 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:35:20" (1/1) ... [2019-11-26 02:35:20,187 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:35:20" (1/1) ... [2019-11-26 02:35:20,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:20,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:35:20,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:35:20,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:35:20,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... [2019-11-26 02:35:20,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:35:20,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:35:20,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:35:20,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:35:20,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/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:35:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:35:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:35:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:35:20,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:35:22,652 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:35:22,653 INFO L284 CfgBuilder]: Removed 196 assume(true) statements. [2019-11-26 02:35:22,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:22 BoogieIcfgContainer [2019-11-26 02:35:22,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:35:22,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:35:22,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:35:22,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:35:22,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:35:19" (1/3) ... [2019-11-26 02:35:22,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a30a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:22, skipping insertion in model container [2019-11-26 02:35:22,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:20" (2/3) ... [2019-11-26 02:35:22,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a30a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:22, skipping insertion in model container [2019-11-26 02:35:22,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:22" (3/3) ... [2019-11-26 02:35:22,661 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product47.cil.c [2019-11-26 02:35:22,669 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:35:22,675 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:35:22,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:35:22,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:35:22,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:35:22,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:35:22,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:35:22,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:35:22,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:35:22,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:35:22,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:35:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:35:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:35:22,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:22,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:35:22,730 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash -323002610, now seen corresponding path program 1 times [2019-11-26 02:35:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:22,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874963346] [2019-11-26 02:35:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:23,181 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:35:23,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874963346] [2019-11-26 02:35:23,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:23,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:35:23,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31628487] [2019-11-26 02:35:23,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:35:23,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:35:23,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:35:23,200 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-26 02:35:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:23,377 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2019-11-26 02:35:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:35:23,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-26 02:35:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:23,387 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:35:23,388 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:35:23,391 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:35:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:35:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-11-26 02:35:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-26 02:35:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-26 02:35:23,432 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2019-11-26 02:35:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:23,432 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-26 02:35:23,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:35:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-26 02:35:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:35:23,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:23,435 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:35:23,435 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 917924982, now seen corresponding path program 1 times [2019-11-26 02:35:23,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:23,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237126352] [2019-11-26 02:35:23,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:23,737 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:35:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237126352] [2019-11-26 02:35:23,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508439585] [2019-11-26 02:35:23,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/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:35:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:23,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-26 02:35:23,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:35:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,315 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-26 02:35:24,473 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-26 02:35:24,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:24,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,023 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 9 [2019-11-26 02:35:25,026 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:35:25,026 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:35:25,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:25,301 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:35:25,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [171862007] [2019-11-26 02:35:25,323 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:35:25,323 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:35:25,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:35:25,334 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:35:25,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:35:34,513 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:35:36,122 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:35:36,265 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:35:37,067 WARN L192 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 627 DAG size of output: 615 [2019-11-26 02:35:38,283 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:35:40,683 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 414 DAG size of output: 203 [2019-11-26 02:35:44,679 WARN L192 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:35:45,549 WARN L192 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 142 [2019-11-26 02:35:49,105 WARN L192 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 402 DAG size of output: 288 [2019-11-26 02:35:51,028 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 412 DAG size of output: 215 [2019-11-26 02:35:51,031 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:35:51,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:35:51,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-11-26 02:35:51,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956675799] [2019-11-26 02:35:51,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:35:51,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:35:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:35:51,034 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 15 states. [2019-11-26 02:35:51,335 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-26 02:35:51,465 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-26 02:35:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:51,868 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2019-11-26 02:35:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:35:51,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-11-26 02:35:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:51,871 INFO L225 Difference]: With dead ends: 100 [2019-11-26 02:35:51,871 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 02:35:51,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:35:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 02:35:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 44. [2019-11-26 02:35:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-26 02:35:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-11-26 02:35:51,889 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 10 [2019-11-26 02:35:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:51,890 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-11-26 02:35:51,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:35:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-11-26 02:35:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:35:51,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:51,895 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-11-26 02:35:52,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:52,100 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1686665714, now seen corresponding path program 2 times [2019-11-26 02:35:52,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:52,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887741471] [2019-11-26 02:35:52,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:35:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:35:52,567 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:35:52,570 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:35:52,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:35:52 BoogieIcfgContainer [2019-11-26 02:35:52,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:35:52,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:35:52,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:35:52,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:35:52,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:22" (3/4) ... [2019-11-26 02:35:52,695 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:35:52,821 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a1764ad-d803-4fa2-a4f3-1f4fbc5c5473/bin/utaipan/witness.graphml [2019-11-26 02:35:52,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:35:52,822 INFO L168 Benchmark]: Toolchain (without parser) took 33203.74 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 595.1 MB). Free memory was 939.3 MB in the beginning and 954.7 MB in the end (delta: -15.4 MB). Peak memory consumption was 579.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,822 INFO L168 Benchmark]: CDTParser took 0.13 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:35:52,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,824 INFO L168 Benchmark]: Boogie Preprocessor took 65.29 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:35:52,824 INFO L168 Benchmark]: RCFGBuilder took 2357.08 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: 41.3 MB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,825 INFO L168 Benchmark]: TraceAbstraction took 30028.60 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 451.4 MB). Free memory was 1.1 GB in the beginning and 972.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 558.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,825 INFO L168 Benchmark]: Witness Printer took 136.91 ms. Allocated memory is still 1.6 GB. Free memory was 972.7 MB in the beginning and 954.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:52,827 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.13 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 543.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.29 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 2357.08 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: 41.3 MB). Peak memory consumption was 250.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30028.60 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 451.4 MB). Free memory was 1.1 GB in the beginning and 972.7 MB in the end (delta: 107.0 MB). Peak memory consumption was 558.4 MB. Max. memory is 11.5 GB. * Witness Printer took 136.91 ms. Allocated memory is still 1.6 GB. Free memory was 972.7 MB in the beginning and 954.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 828]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L219] int pumpRunning = 0; [L220] int systemActive = 1; [L868] int waterLevel = 1; [L869] int methaneLevelCritical = 0; [L599] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L121] int retValue_acc ; [L122] int tmp ; [L859] int retValue_acc ; [L862] retValue_acc = 1 [L863] return (retValue_acc); [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) [L886] COND TRUE waterLevel < 2 [L887] waterLevel = waterLevel + 1 [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND FALSE !(\read(tmp___2)) [L189] tmp___1 = __VERIFIER_nondet_int() [L191] COND FALSE !(\read(tmp___1)) [L227] COND FALSE !(\read(pumpRunning)) [L234] COND TRUE \read(systemActive) [L282] int tmp ; [L285] COND FALSE !(\read(pumpRunning)) [L256] int tmp ; [L259] COND TRUE ! pumpRunning [L396] int retValue_acc ; [L397] int tmp ; [L398] int tmp___0 ; [L948] int retValue_acc ; [L951] COND FALSE !(waterLevel < 2) [L955] retValue_acc = 0 [L956] return (retValue_acc); [L402] tmp = isHighWaterSensorDry() [L404] COND FALSE !(\read(tmp)) [L407] tmp___0 = 1 [L409] retValue_acc = tmp___0 [L410] return (retValue_acc); [L261] tmp = isHighWaterLevel() [L263] COND TRUE \read(tmp) [L315] int tmp ; [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); [L319] tmp = isMethaneAlarm() [L321] COND FALSE !(\read(tmp)) [L310] pumpRunning = 1 [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L157] COND TRUE splverifierCounter < 4 [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) [L886] COND FALSE !(waterLevel < 2) [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) [L227] COND TRUE \read(pumpRunning) [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 [L234] COND TRUE \read(systemActive) [L282] int tmp ; [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; [L259] COND FALSE !(! pumpRunning) [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND FALSE !(\read(tmp___2)) [L189] tmp___1 = __VERIFIER_nondet_int() [L191] COND FALSE !(\read(tmp___1)) [L227] COND TRUE \read(pumpRunning) [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 [L234] COND TRUE \read(systemActive) [L282] int tmp ; [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; [L259] COND FALSE !(! pumpRunning) [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); [L804] tmp = getWaterLevel() [L806] COND TRUE tmp == 0 [L351] int retValue_acc ; [L354] retValue_acc = pumpRunning [L355] return (retValue_acc); [L808] tmp___0 = isPumpRunning() [L810] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L828] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 49 SDtfs, 164 SDslu, 223 SDs, 0 SdLazy, 238 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, 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, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 8652 SizeOfPredicates, 62 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 41 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 incorrect! Received shutdown request...