./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product48.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_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/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 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:16,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:56:16,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:56:16,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:56:16,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:56:16,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:56:16,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:56:16,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:56:17,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:56:17,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:56:17,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:56:17,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:56:17,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:56:17,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:56:17,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:56:17,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:56:17,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:56:17,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:56:17,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:56:17,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:56:17,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:56:17,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:56:17,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:56:17,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:56:17,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:56:17,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:56:17,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:56:17,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:56:17,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:56:17,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:56:17,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:56:17,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:56:17,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:56:17,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:56:17,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:56:17,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:56:17,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:56:17,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:56:17,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:56:17,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:56:17,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:56:17,038 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:56:17,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:56:17,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:56:17,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:56:17,062 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:56:17,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:56:17,063 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:56:17,064 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:56:17,064 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:56:17,064 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:56:17,064 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:56:17,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:56:17,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:56:17,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:56:17,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:56:17,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:56:17,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:56:17,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:56:17,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:56:17,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:56:17,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:56:17,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:56:17,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:56:17,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:56:17,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:56:17,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:56:17,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:56:17,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:56:17,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:56:17,068 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:56:17,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:56:17,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:56:17,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:56:17,068 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_46668cf3-576c-4eae-a8ed-968131b7ebfe/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 -> 5f57b6f2bb2bb4fa43dac897ff23a28c21886d7b [2019-11-26 02:56:17,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:56:17,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:56:17,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:56:17,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:56:17,254 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:56:17,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2019-11-26 02:56:17,308 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/data/cf38b29b5/06e3b9d6b0c44595ab4e9b6805e9a53a/FLAG8105c7728 [2019-11-26 02:56:17,720 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:56:17,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2019-11-26 02:56:17,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/data/cf38b29b5/06e3b9d6b0c44595ab4e9b6805e9a53a/FLAG8105c7728 [2019-11-26 02:56:18,117 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/data/cf38b29b5/06e3b9d6b0c44595ab4e9b6805e9a53a [2019-11-26 02:56:18,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:56:18,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:56:18,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:18,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:56:18,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:56:18,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8ce307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18, skipping insertion in model container [2019-11-26 02:56:18,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:56:18,174 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:56:18,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:18,517 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:56:18,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:18,623 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:56:18,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18 WrapperNode [2019-11-26 02:56:18,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:18,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:18,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:56:18,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:56:18,632 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:56:18" (1/1) ... [2019-11-26 02:56:18,647 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:56:18" (1/1) ... [2019-11-26 02:56:18,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:18,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:56:18,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:56:18,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:56:18,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... [2019-11-26 02:56:18,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:56:18,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:56:18,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:56:18,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:56:18,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/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:56:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:56:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:56:18,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:56:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:56:21,169 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:56:21,169 INFO L284 CfgBuilder]: Removed 198 assume(true) statements. [2019-11-26 02:56:21,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:21 BoogieIcfgContainer [2019-11-26 02:56:21,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:56:21,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:56:21,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:56:21,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:56:21,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:56:18" (1/3) ... [2019-11-26 02:56:21,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167b1b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:21, skipping insertion in model container [2019-11-26 02:56:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:18" (2/3) ... [2019-11-26 02:56:21,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167b1b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:21, skipping insertion in model container [2019-11-26 02:56:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:21" (3/3) ... [2019-11-26 02:56:21,186 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product48.cil.c [2019-11-26 02:56:21,197 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:56:21,204 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:56:21,214 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:56:21,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:56:21,237 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:56:21,237 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:56:21,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:56:21,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:56:21,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:56:21,238 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:56:21,238 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:56:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:56:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:56:21,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:21,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:21,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1023791189, now seen corresponding path program 1 times [2019-11-26 02:56:21,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:21,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448680530] [2019-11-26 02:56:21,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:21,560 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:56:21,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448680530] [2019-11-26 02:56:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:56:21,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999673405] [2019-11-26 02:56:21,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:56:21,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:56:21,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:56:21,583 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-11-26 02:56:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:21,601 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-26 02:56:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:56:21,602 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-26 02:56:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:21,613 INFO L225 Difference]: With dead ends: 44 [2019-11-26 02:56:21,613 INFO L226 Difference]: Without dead ends: 21 [2019-11-26 02:56:21,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:56:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-26 02:56:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-26 02:56:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-26 02:56:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-26 02:56:21,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 7 [2019-11-26 02:56:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:21,662 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-26 02:56:21,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:56:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-26 02:56:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:56:21,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:21,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:21,663 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash 480157338, now seen corresponding path program 1 times [2019-11-26 02:56:21,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:21,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912185177] [2019-11-26 02:56:21,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:21,958 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:56:21,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912185177] [2019-11-26 02:56:21,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:56:21,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:56:21,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636877067] [2019-11-26 02:56:21,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:56:21,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:56:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:56:21,962 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-26 02:56:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:22,047 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-11-26 02:56:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:56:22,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:56:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:22,048 INFO L225 Difference]: With dead ends: 53 [2019-11-26 02:56:22,048 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:56:22,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:56:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:56:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-26 02:56:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-26 02:56:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-26 02:56:22,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-11-26 02:56:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:22,054 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-26 02:56:22,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:56:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-26 02:56:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:56:22,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:22,055 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:56:22,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 677823757, now seen corresponding path program 1 times [2019-11-26 02:56:22,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:22,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690523196] [2019-11-26 02:56:22,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:22,245 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:56:22,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690523196] [2019-11-26 02:56:22,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452478541] [2019-11-26 02:56:22,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/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:56:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:56:22,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-26 02:56:22,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:56:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:22,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:22,849 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-11-26 02:56:22,993 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-26 02:56:23,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,680 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:56:23,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:56:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:56:23,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:56:24,003 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:56:24,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [55372739] [2019-11-26 02:56:24,024 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:56:24,024 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:56:24,028 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:56:24,033 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:56:24,034 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:56:31,338 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:56:32,803 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:56:32,946 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:56:33,572 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 639 DAG size of output: 619 [2019-11-26 02:56:35,038 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 771 DAG size of output: 767 [2019-11-26 02:56:37,920 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:56:39,530 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 379 DAG size of output: 214 [2019-11-26 02:56:43,351 WARN L192 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:56:44,218 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2019-11-26 02:56:45,177 WARN L192 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 145 [2019-11-26 02:56:47,110 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 367 DAG size of output: 271 [2019-11-26 02:56:48,924 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 377 DAG size of output: 223 [2019-11-26 02:56:48,926 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:56:48,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:56:48,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2019-11-26 02:56:48,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330133801] [2019-11-26 02:56:48,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:56:48,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:56:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:56:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-11-26 02:56:48,929 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 15 states. [2019-11-26 02:56:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:56:49,391 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-11-26 02:56:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:56:49,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 10 [2019-11-26 02:56:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:56:49,392 INFO L225 Difference]: With dead ends: 70 [2019-11-26 02:56:49,392 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 02:56:49,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:56:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 02:56:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-26 02:56:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-26 02:56:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2019-11-26 02:56:49,413 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 10 [2019-11-26 02:56:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:56:49,414 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-11-26 02:56:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:56:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2019-11-26 02:56:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:56:49,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:56:49,416 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-11-26 02:56:49,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:56:49,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:56:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:56:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash 957949370, now seen corresponding path program 2 times [2019-11-26 02:56:49,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:56:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971572414] [2019-11-26 02:56:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:56:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:56:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:56:50,058 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:56:50,058 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:56:50,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:56:50 BoogieIcfgContainer [2019-11-26 02:56:50,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:56:50,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:56:50,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:56:50,177 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:56:50,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:21" (3/4) ... [2019-11-26 02:56:50,180 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:56:50,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46668cf3-576c-4eae-a8ed-968131b7ebfe/bin/utaipan/witness.graphml [2019-11-26 02:56:50,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:56:50,296 INFO L168 Benchmark]: Toolchain (without parser) took 32174.98 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 696.3 MB). Free memory was 951.4 MB in the beginning and 1.5 GB in the end (delta: -545.9 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,297 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:56:50,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,298 INFO L168 Benchmark]: Boogie Preprocessor took 87.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,298 INFO L168 Benchmark]: RCFGBuilder took 2372.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 789.1 MB in the end (delta: 288.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,298 INFO L168 Benchmark]: TraceAbstraction took 29005.35 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 587.2 MB). Free memory was 789.1 MB in the beginning and 1.5 GB in the end (delta: -730.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:56:50,299 INFO L168 Benchmark]: Witness Printer took 118.15 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:56:50,301 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 498.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2372.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 789.1 MB in the end (delta: 288.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29005.35 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 587.2 MB). Free memory was 789.1 MB in the beginning and 1.5 GB in the end (delta: -730.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 118.15 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L444] int cleanupTimeShifts = 4; [L556] int pumpRunning = 0; [L557] int systemActive = 1; [L774] int waterLevel = 1; [L775] int methaneLevelCritical = 0; [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L525] int retValue_acc ; [L526] int tmp ; [L963] int retValue_acc ; [L966] retValue_acc = 1 [L967] return (retValue_acc); [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) [L869] int splverifierCounter ; [L870] int tmp ; [L871] int tmp___0 ; [L872] int tmp___1 ; [L873] int tmp___2 ; [L876] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 [L886] tmp = __VERIFIER_nondet_int() [L888] COND TRUE \read(tmp) [L792] COND TRUE waterLevel < 2 [L793] waterLevel = waterLevel + 1 [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___2)) [L914] tmp___1 = __VERIFIER_nondet_int() [L916] COND FALSE !(\read(tmp___1)) [L563] COND FALSE !(\read(pumpRunning)) [L570] COND TRUE \read(systemActive) [L618] int tmp ; [L621] COND FALSE !(\read(pumpRunning)) [L592] int tmp ; [L595] COND TRUE ! pumpRunning [L732] int retValue_acc ; [L733] int tmp ; [L734] int tmp___0 ; [L854] int retValue_acc ; [L857] COND FALSE !(waterLevel < 2) [L861] retValue_acc = 0 [L862] return (retValue_acc); [L738] tmp = isHighWaterSensorDry() [L740] COND FALSE !(\read(tmp)) [L743] tmp___0 = 1 [L745] retValue_acc = tmp___0 [L746] return (retValue_acc); [L597] tmp = isHighWaterLevel() [L599] COND TRUE \read(tmp) [L651] int tmp ; [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); [L655] tmp = isMethaneAlarm() [L657] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND TRUE splverifierCounter < 4 [L886] tmp = __VERIFIER_nondet_int() [L888] COND TRUE \read(tmp) [L792] COND FALSE !(waterLevel < 2) [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND TRUE \read(tmp___2) [L769] systemActive = 1 [L563] COND TRUE \read(pumpRunning) [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 [L570] COND TRUE \read(systemActive) [L618] int tmp ; [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; [L595] COND FALSE !(! pumpRunning) [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L878] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] COND TRUE splverifierCounter < 4 [L886] tmp = __VERIFIER_nondet_int() [L888] COND FALSE !(\read(tmp)) [L896] tmp___0 = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp___0)) [L906] tmp___2 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___2)) [L914] tmp___1 = __VERIFIER_nondet_int() [L916] COND FALSE !(\read(tmp___1)) [L563] COND TRUE \read(pumpRunning) [L780] COND TRUE waterLevel > 0 [L781] waterLevel = waterLevel - 1 [L570] COND TRUE \read(systemActive) [L618] int tmp ; [L621] COND TRUE \read(pumpRunning) [L676] int retValue_acc ; [L813] int retValue_acc ; [L816] retValue_acc = methaneLevelCritical [L817] return (retValue_acc); [L680] retValue_acc = isMethaneLevelCritical() [L682] return (retValue_acc); [L623] tmp = isMethaneAlarm() [L625] COND FALSE !(\read(tmp)) [L592] int tmp ; [L595] COND FALSE !(! pumpRunning) [L44] int tmp ; [L45] int tmp___0 ; [L845] int retValue_acc ; [L848] retValue_acc = waterLevel [L849] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L687] int retValue_acc ; [L690] retValue_acc = pumpRunning [L691] return (retValue_acc); [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L439] __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: 28.9s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 74 SDtfs, 86 SDslu, 211 SDs, 0 SdLazy, 200 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=3, 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, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 8526 SizeOfPredicates, 64 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 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...