./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/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 eb59a6e6bbeea05d6faf844d6f750609a5360ad9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 11:26:30,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:30,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:30,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:30,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:30,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:30,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:30,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:30,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:30,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:30,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:30,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:30,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:30,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:30,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:30,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:30,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:30,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:30,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:30,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:30,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:30,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:30,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:30,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:30,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:30,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:30,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:30,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:30,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:30,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:30,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:30,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:30,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:30,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:30,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:30,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:30,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:30,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:30,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:30,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:30,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:30,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:30,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:30,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:30,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:30,124 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:30,124 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:30,124 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:30,124 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:30,125 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:30,125 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:30,125 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:30,125 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:30,125 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:30,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:30,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:30,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:30,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:30,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:30,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:30,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:30,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:30,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:30,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:30,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:30,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:30,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:30,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:30,129 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:30,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:30,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:30,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:30,131 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/working_dir_02788163-d5f0-444c-b711-fad230e3598e/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 -> eb59a6e6bbeea05d6faf844d6f750609a5360ad9 [2019-10-22 11:26:30,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:30,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:30,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:30,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:30,176 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:30,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-10-22 11:26:30,222 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/data/82ee5fabd/99c206bd7bbb4614a70e39823f631ebb/FLAGf2c1bd0d9 [2019-10-22 11:26:30,685 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:30,686 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-10-22 11:26:30,701 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/data/82ee5fabd/99c206bd7bbb4614a70e39823f631ebb/FLAGf2c1bd0d9 [2019-10-22 11:26:31,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/data/82ee5fabd/99c206bd7bbb4614a70e39823f631ebb [2019-10-22 11:26:31,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:31,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:31,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:31,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:31,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:31,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63df915c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31, skipping insertion in model container [2019-10-22 11:26:31,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,219 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:31,267 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:31,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:31,603 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:31,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:31,709 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:31,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31 WrapperNode [2019-10-22 11:26:31,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:31,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:31,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:31,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:31,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:31,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:31,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:31,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:31,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... [2019-10-22 11:26:31,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:31,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:31,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:31,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:31,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/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-10-22 11:26:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:26:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:31,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:32,610 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:32,610 INFO L284 CfgBuilder]: Removed 162 assume(true) statements. [2019-10-22 11:26:32,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:32 BoogieIcfgContainer [2019-10-22 11:26:32,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:32,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:32,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:32,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:32,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:31" (1/3) ... [2019-10-22 11:26:32,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e299533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:32, skipping insertion in model container [2019-10-22 11:26:32,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:31" (2/3) ... [2019-10-22 11:26:32,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e299533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:32, skipping insertion in model container [2019-10-22 11:26:32,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:32" (3/3) ... [2019-10-22 11:26:32,619 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product52.cil.c [2019-10-22 11:26:32,628 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:32,635 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:26:32,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:26:32,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:32,677 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:32,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:32,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:32,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:32,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:32,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:32,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-10-22 11:26:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:26:32,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:32,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2019-10-22 11:26:32,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:32,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770053356] [2019-10-22 11:26:32,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:32,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770053356] [2019-10-22 11:26:32,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:32,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:32,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51406191] [2019-10-22 11:26:32,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:32,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:32,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:32,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:32,956 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-10-22 11:26:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,990 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-10-22 11:26:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:32,991 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:26:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,001 INFO L225 Difference]: With dead ends: 232 [2019-10-22 11:26:33,001 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:26:33,005 INFO L600 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-10-22 11:26:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:26:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-10-22 11:26:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-22 11:26:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-10-22 11:26:33,044 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-10-22 11:26:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,045 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-10-22 11:26:33,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-10-22 11:26:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:26:33,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2019-10-22 11:26:33,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716697835] [2019-10-22 11:26:33,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716697835] [2019-10-22 11:26:33,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:33,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897701746] [2019-10-22 11:26:33,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:33,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:33,168 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-10-22 11:26:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,180 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-10-22 11:26:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:33,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:26:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,182 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:26:33,182 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:26:33,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:26:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 11:26:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:26:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-10-22 11:26:33,189 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-10-22 11:26:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,189 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-10-22 11:26:33,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-10-22 11:26:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:26:33,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,193 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2019-10-22 11:26:33,194 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146719364] [2019-10-22 11:26:33,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146719364] [2019-10-22 11:26:33,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:33,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187662565] [2019-10-22 11:26:33,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:33,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:33,328 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 5 states. [2019-10-22 11:26:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,389 INFO L93 Difference]: Finished difference Result 115 states and 170 transitions. [2019-10-22 11:26:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:33,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:26:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,390 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:26:33,390 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:26:33,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:26:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-10-22 11:26:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:26:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-10-22 11:26:33,399 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 22 [2019-10-22 11:26:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,400 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-10-22 11:26:33,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-10-22 11:26:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:26:33,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2019-10-22 11:26:33,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791042776] [2019-10-22 11:26:33,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791042776] [2019-10-22 11:26:33,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:33,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677966536] [2019-10-22 11:26:33,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:33,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:33,471 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2019-10-22 11:26:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,535 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2019-10-22 11:26:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:33,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:26:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,537 INFO L225 Difference]: With dead ends: 151 [2019-10-22 11:26:33,537 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 11:26:33,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 11:26:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-10-22 11:26:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:26:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-10-22 11:26:33,547 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 24 [2019-10-22 11:26:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,547 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-10-22 11:26:33,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-10-22 11:26:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:26:33,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,548 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2019-10-22 11:26:33,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281390153] [2019-10-22 11:26:33,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281390153] [2019-10-22 11:26:33,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:33,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593551830] [2019-10-22 11:26:33,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:33,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:33,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:33,642 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 5 states. [2019-10-22 11:26:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,736 INFO L93 Difference]: Finished difference Result 445 states and 650 transitions. [2019-10-22 11:26:33,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:33,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:26:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,739 INFO L225 Difference]: With dead ends: 445 [2019-10-22 11:26:33,739 INFO L226 Difference]: Without dead ends: 364 [2019-10-22 11:26:33,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-22 11:26:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 160. [2019-10-22 11:26:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:26:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2019-10-22 11:26:33,762 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 25 [2019-10-22 11:26:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,763 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2019-10-22 11:26:33,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2019-10-22 11:26:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:26:33,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,764 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,764 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1475071754, now seen corresponding path program 1 times [2019-10-22 11:26:33,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627091684] [2019-10-22 11:26:33,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627091684] [2019-10-22 11:26:33,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:33,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256805939] [2019-10-22 11:26:33,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:33,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:33,834 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand 5 states. [2019-10-22 11:26:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,972 INFO L93 Difference]: Finished difference Result 448 states and 637 transitions. [2019-10-22 11:26:33,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:33,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:26:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,975 INFO L225 Difference]: With dead ends: 448 [2019-10-22 11:26:33,975 INFO L226 Difference]: Without dead ends: 446 [2019-10-22 11:26:33,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-22 11:26:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 160. [2019-10-22 11:26:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-22 11:26:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2019-10-22 11:26:34,000 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 26 [2019-10-22 11:26:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,000 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2019-10-22 11:26:34,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2019-10-22 11:26:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:26:34,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash 317568404, now seen corresponding path program 1 times [2019-10-22 11:26:34,003 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793865124] [2019-10-22 11:26:34,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793865124] [2019-10-22 11:26:34,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:34,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636764987] [2019-10-22 11:26:34,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:34,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:34,076 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand 5 states. [2019-10-22 11:26:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,154 INFO L93 Difference]: Finished difference Result 476 states and 660 transitions. [2019-10-22 11:26:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:34,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:26:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,156 INFO L225 Difference]: With dead ends: 476 [2019-10-22 11:26:34,156 INFO L226 Difference]: Without dead ends: 322 [2019-10-22 11:26:34,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-22 11:26:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 172. [2019-10-22 11:26:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-22 11:26:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 236 transitions. [2019-10-22 11:26:34,174 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 236 transitions. Word has length 31 [2019-10-22 11:26:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,174 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 236 transitions. [2019-10-22 11:26:34,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 236 transitions. [2019-10-22 11:26:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:26:34,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,176 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -75458606, now seen corresponding path program 1 times [2019-10-22 11:26:34,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716693741] [2019-10-22 11:26:34,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716693741] [2019-10-22 11:26:34,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:34,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912440273] [2019-10-22 11:26:34,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:34,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:34,218 INFO L87 Difference]: Start difference. First operand 172 states and 236 transitions. Second operand 4 states. [2019-10-22 11:26:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,264 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2019-10-22 11:26:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:34,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:26:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,266 INFO L225 Difference]: With dead ends: 434 [2019-10-22 11:26:34,266 INFO L226 Difference]: Without dead ends: 268 [2019-10-22 11:26:34,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-22 11:26:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-22 11:26:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 180. [2019-10-22 11:26:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 11:26:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2019-10-22 11:26:34,292 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 244 transitions. Word has length 31 [2019-10-22 11:26:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,293 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 244 transitions. [2019-10-22 11:26:34,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 244 transitions. [2019-10-22 11:26:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:26:34,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,299 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,299 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 182706832, now seen corresponding path program 1 times [2019-10-22 11:26:34,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113915532] [2019-10-22 11:26:34,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113915532] [2019-10-22 11:26:34,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:34,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876261814] [2019-10-22 11:26:34,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:34,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,348 INFO L87 Difference]: Start difference. First operand 180 states and 244 transitions. Second operand 3 states. [2019-10-22 11:26:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,389 INFO L93 Difference]: Finished difference Result 442 states and 598 transitions. [2019-10-22 11:26:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:34,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:26:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,391 INFO L225 Difference]: With dead ends: 442 [2019-10-22 11:26:34,392 INFO L226 Difference]: Without dead ends: 268 [2019-10-22 11:26:34,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-22 11:26:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-10-22 11:26:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-22 11:26:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2019-10-22 11:26:34,423 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 31 [2019-10-22 11:26:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,425 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2019-10-22 11:26:34,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2019-10-22 11:26:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:26:34,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1930053038, now seen corresponding path program 1 times [2019-10-22 11:26:34,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339234542] [2019-10-22 11:26:34,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:35,209 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:26:35,209 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:26:35,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:35 BoogieIcfgContainer [2019-10-22 11:26:35,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:35,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:35,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:35,302 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:35,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:32" (3/4) ... [2019-10-22 11:26:35,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:26:35,410 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_02788163-d5f0-444c-b711-fad230e3598e/bin/utaipan/witness.graphml [2019-10-22 11:26:35,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:35,412 INFO L168 Benchmark]: Toolchain (without parser) took 4210.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 948.5 MB in the beginning and 1.0 GB in the end (delta: -59.6 MB). Peak memory consumption was 173.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,412 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:35,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 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-10-22 11:26:35,412 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,413 INFO L168 Benchmark]: RCFGBuilder took 792.89 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: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,413 INFO L168 Benchmark]: TraceAbstraction took 2688.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,416 INFO L168 Benchmark]: Witness Printer took 108.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:35,417 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.52 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. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 792.89 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: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2688.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.2 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. * Witness Printer took 108.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 383]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L458] int cleanupTimeShifts = 4; [L752] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L534] int retValue_acc ; [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L975] int retValue_acc ; [L978] retValue_acc = 1 [L979] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L541] tmp = valid_product() [L543] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L390] int splverifierCounter ; [L391] int tmp ; [L392] int tmp___0 ; [L393] int tmp___1 ; [L394] int tmp___2 ; [L397] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L399] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L407] tmp = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L66] COND TRUE waterLevel < 2 [L67] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L417] tmp___0 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L78] COND FALSE !(\read(methaneLevelCritical)) [L81] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L427] tmp___2 = __VERIFIER_nondet_int() [L429] COND TRUE \read(tmp___2) [L374] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L166] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND TRUE \read(systemActive) [L221] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] COND FALSE !(\read(pumpRunning)) [L195] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L198] COND TRUE ! pumpRunning [L318] int retValue_acc ; [L319] int tmp ; [L320] int tmp___0 ; [L128] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(waterLevel < 2) [L135] retValue_acc = 0 [L136] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L324] tmp = isHighWaterSensorDry() [L326] COND FALSE !(\read(tmp)) [L329] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L331] retValue_acc = tmp___0 [L332] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterLevel() [L202] COND TRUE \read(tmp) [L249] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L558] int tmp ; [L559] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L563] tmp = isMethaneLevelCritical() [L565] COND TRUE \read(tmp) [L273] int retValue_acc ; [L276] retValue_acc = pumpRunning [L277] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L567] tmp___0 = isPumpRunning() [L569] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L383] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1177 SDslu, 1132 SDs, 0 SdLazy, 149 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 734 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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...