./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.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_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/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 d63a23585cedb87d2d2ae4c59168b108a64280e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:27:25,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:25,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:26,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:26,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:26,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:26,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:26,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:26,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:26,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:26,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:26,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:26,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:26,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:26,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:26,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:26,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:26,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:26,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:26,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:26,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:26,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:26,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:26,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:26,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:26,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:26,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:26,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:26,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:26,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:26,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:26,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:26,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:26,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:26,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:26,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:26,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:26,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:26,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:26,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:26,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:26,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:26,044 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:26,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:26,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:26,045 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:26,045 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:26,045 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:26,045 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:26,046 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:26,046 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:26,046 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:26,046 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:26,046 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:26,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:26,047 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:26,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:26,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:26,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:26,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:26,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:26,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:26,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:26,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:26,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:26,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:26,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:26,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:26,050 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:26,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:26,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:26,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:26,051 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_5477cd7c-42b6-4ef3-888b-08ce70f7db63/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 -> d63a23585cedb87d2d2ae4c59168b108a64280e1 [2019-10-22 11:27:26,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:26,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:26,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:26,089 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:26,089 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:26,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-22 11:27:26,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/data/ec8db2692/e92bda9626af4386b3994ffac9014d80/FLAGf85c020f0 [2019-10-22 11:27:26,511 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:26,511 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-22 11:27:26,520 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/data/ec8db2692/e92bda9626af4386b3994ffac9014d80/FLAGf85c020f0 [2019-10-22 11:27:26,891 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/data/ec8db2692/e92bda9626af4386b3994ffac9014d80 [2019-10-22 11:27:26,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:26,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:26,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:26,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:26,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:26,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:26" (1/1) ... [2019-10-22 11:27:26,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6bbafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:26, skipping insertion in model container [2019-10-22 11:27:26,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:26" (1/1) ... [2019-10-22 11:27:26,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:26,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:27,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:27,310 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:27,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:27,401 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:27,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27 WrapperNode [2019-10-22 11:27:27,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:27,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:27,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:27,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:27,411 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:27:27" (1/1) ... [2019-10-22 11:27:27,420 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:27:27" (1/1) ... [2019-10-22 11:27:27,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:27,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:27,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:27,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:27,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... [2019-10-22 11:27:27,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:27,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:27,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:27,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:27,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/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:27:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:28,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:28,137 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 11:27:28,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:28 BoogieIcfgContainer [2019-10-22 11:27:28,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:28,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:28,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:28,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:28,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:26" (1/3) ... [2019-10-22 11:27:28,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13969760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:28, skipping insertion in model container [2019-10-22 11:27:28,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:27" (2/3) ... [2019-10-22 11:27:28,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13969760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:28, skipping insertion in model container [2019-10-22 11:27:28,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:28" (3/3) ... [2019-10-22 11:27:28,149 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-10-22 11:27:28,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:28,167 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 11:27:28,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 11:27:28,202 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:28,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:28,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:28,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:28,203 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:28,203 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:28,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:28,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-10-22 11:27:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:27:28,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:28,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:28,227 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-10-22 11:27:28,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:28,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785577602] [2019-10-22 11:27:28,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:28,381 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:27:28,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785577602] [2019-10-22 11:27:28,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:28,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:28,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88235504] [2019-10-22 11:27:28,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:28,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:28,406 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2019-10-22 11:27:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:28,674 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2019-10-22 11:27:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:28,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:27:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:28,686 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:27:28,686 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:27:28,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:27:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:27:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 11:27:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:27:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2019-10-22 11:27:28,731 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2019-10-22 11:27:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:28,732 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2019-10-22 11:27:28,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2019-10-22 11:27:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:27:28,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:28,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:28,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-10-22 11:27:28,734 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:28,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095706531] [2019-10-22 11:27:28,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:28,782 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:27:28,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095706531] [2019-10-22 11:27:28,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:28,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:28,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670176946] [2019-10-22 11:27:28,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:28,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:28,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:28,785 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 4 states. [2019-10-22 11:27:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:28,911 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2019-10-22 11:27:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:28,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:27:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:28,913 INFO L225 Difference]: With dead ends: 114 [2019-10-22 11:27:28,913 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 11:27:28,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:27:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 11:27:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-10-22 11:27:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 11:27:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-10-22 11:27:28,921 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2019-10-22 11:27:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:28,921 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-10-22 11:27:28,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-10-22 11:27:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:27:28,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:28,922 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:28,922 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2019-10-22 11:27:28,923 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:28,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874756894] [2019-10-22 11:27:28,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:28,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:28,965 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:27:28,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874756894] [2019-10-22 11:27:28,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:28,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:28,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650179264] [2019-10-22 11:27:28,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:28,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:28,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:28,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:28,967 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 5 states. [2019-10-22 11:27:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:29,137 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-10-22 11:27:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:29,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:27:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:29,139 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:27:29,139 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 11:27:29,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 11:27:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-22 11:27:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:27:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-10-22 11:27:29,146 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2019-10-22 11:27:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:29,147 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-10-22 11:27:29,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-10-22 11:27:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:27:29,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:29,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:29,148 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2019-10-22 11:27:29,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:29,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838135511] [2019-10-22 11:27:29,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:29,195 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:27:29,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838135511] [2019-10-22 11:27:29,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:29,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:29,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423871321] [2019-10-22 11:27:29,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:29,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:29,197 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 4 states. [2019-10-22 11:27:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:29,332 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-10-22 11:27:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:29,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:27:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:29,333 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:27:29,334 INFO L226 Difference]: Without dead ends: 103 [2019-10-22 11:27:29,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:27:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-22 11:27:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-22 11:27:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-22 11:27:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-22 11:27:29,340 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2019-10-22 11:27:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:29,341 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-22 11:27:29,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-22 11:27:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:27:29,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:29,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:29,342 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2019-10-22 11:27:29,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:29,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920496574] [2019-10-22 11:27:29,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:29,383 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:27:29,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920496574] [2019-10-22 11:27:29,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:29,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:29,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796772621] [2019-10-22 11:27:29,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:29,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:29,385 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-10-22 11:27:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:29,567 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-10-22 11:27:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:29,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:27:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:29,569 INFO L225 Difference]: With dead ends: 121 [2019-10-22 11:27:29,569 INFO L226 Difference]: Without dead ends: 119 [2019-10-22 11:27:29,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-22 11:27:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2019-10-22 11:27:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-22 11:27:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-10-22 11:27:29,576 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2019-10-22 11:27:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:29,576 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-10-22 11:27:29,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-10-22 11:27:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:27:29,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:29,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:29,578 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2019-10-22 11:27:29,578 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:29,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719179656] [2019-10-22 11:27:29,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:29,655 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:27:29,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719179656] [2019-10-22 11:27:29,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:29,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:29,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109117918] [2019-10-22 11:27:29,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:29,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:29,657 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-10-22 11:27:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:29,840 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-10-22 11:27:29,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:29,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:27:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:29,841 INFO L225 Difference]: With dead ends: 101 [2019-10-22 11:27:29,841 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 11:27:29,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 11:27:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-10-22 11:27:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 11:27:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-22 11:27:29,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2019-10-22 11:27:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:29,847 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-22 11:27:29,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-22 11:27:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:27:29,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:29,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:29,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2019-10-22 11:27:29,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:29,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768628194] [2019-10-22 11:27:29,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:29,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:29,929 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:27:29,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768628194] [2019-10-22 11:27:29,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:29,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:29,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668103300] [2019-10-22 11:27:29,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:29,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:29,931 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-10-22 11:27:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,103 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-10-22 11:27:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:30,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:27:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,104 INFO L225 Difference]: With dead ends: 116 [2019-10-22 11:27:30,104 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:27:30,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:27:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-10-22 11:27:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-22 11:27:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-10-22 11:27:30,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 14 [2019-10-22 11:27:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:30,109 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-10-22 11:27:30,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-10-22 11:27:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:27:30,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:30,110 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:30,111 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:30,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2019-10-22 11:27:30,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:30,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171460552] [2019-10-22 11:27:30,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:30,149 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:27:30,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171460552] [2019-10-22 11:27:30,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:30,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:30,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397852657] [2019-10-22 11:27:30,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:30,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:30,151 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2019-10-22 11:27:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,295 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-10-22 11:27:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:30,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:27:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,296 INFO L225 Difference]: With dead ends: 116 [2019-10-22 11:27:30,296 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:27:30,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:27:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-10-22 11:27:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-22 11:27:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-10-22 11:27:30,309 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 14 [2019-10-22 11:27:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:30,309 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-10-22 11:27:30,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-10-22 11:27:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:27:30,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:30,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:30,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2019-10-22 11:27:30,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:30,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261735548] [2019-10-22 11:27:30,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:30,391 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:27:30,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261735548] [2019-10-22 11:27:30,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:30,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:30,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811476308] [2019-10-22 11:27:30,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:30,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:30,393 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-10-22 11:27:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,539 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-22 11:27:30,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:30,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:27:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,540 INFO L225 Difference]: With dead ends: 95 [2019-10-22 11:27:30,540 INFO L226 Difference]: Without dead ends: 91 [2019-10-22 11:27:30,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-22 11:27:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-22 11:27:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-22 11:27:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-10-22 11:27:30,544 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 14 [2019-10-22 11:27:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:30,544 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-22 11:27:30,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-10-22 11:27:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:27:30,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:30,545 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:30,545 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2019-10-22 11:27:30,546 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:30,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119575746] [2019-10-22 11:27:30,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:30,589 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:27:30,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119575746] [2019-10-22 11:27:30,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:30,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:30,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402183286] [2019-10-22 11:27:30,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:30,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:30,590 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2019-10-22 11:27:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,780 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-10-22 11:27:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:30,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:27:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,782 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:27:30,782 INFO L226 Difference]: Without dead ends: 105 [2019-10-22 11:27:30,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-22 11:27:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-10-22 11:27:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:27:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-10-22 11:27:30,786 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 15 [2019-10-22 11:27:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:30,786 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-10-22 11:27:30,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-10-22 11:27:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:27:30,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:30,787 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:27:30,787 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2019-10-22 11:27:30,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:30,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735400272] [2019-10-22 11:27:30,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:30,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:30,838 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:27:30,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735400272] [2019-10-22 11:27:30,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:30,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:30,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483560738] [2019-10-22 11:27:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:30,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:30,839 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 6 states. [2019-10-22 11:27:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:30,992 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2019-10-22 11:27:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:30,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:27:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:30,993 INFO L225 Difference]: With dead ends: 99 [2019-10-22 11:27:30,994 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 11:27:30,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 11:27:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-10-22 11:27:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 11:27:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-10-22 11:27:30,999 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 16 [2019-10-22 11:27:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:30,999 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-10-22 11:27:30,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-10-22 11:27:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:27:31,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,000 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:27:31,000 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2019-10-22 11:27:31,001 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904241415] [2019-10-22 11:27:31,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,035 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:27:31,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904241415] [2019-10-22 11:27:31,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:31,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050651605] [2019-10-22 11:27:31,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:31,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:31,037 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 4 states. [2019-10-22 11:27:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,124 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-10-22 11:27:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:31,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 11:27:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,124 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:27:31,125 INFO L226 Difference]: Without dead ends: 54 [2019-10-22 11:27:31,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:27:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-22 11:27:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-22 11:27:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 11:27:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-10-22 11:27:31,126 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 17 [2019-10-22 11:27:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,127 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-10-22 11:27:31,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-10-22 11:27:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:27:31,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:31,128 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,128 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2019-10-22 11:27:31,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782101501] [2019-10-22 11:27:31,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,257 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:27:31,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782101501] [2019-10-22 11:27:31,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-22 11:27:31,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76717925] [2019-10-22 11:27:31,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:27:31,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:27:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:27:31,260 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2019-10-22 11:27:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,375 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-22 11:27:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:27:31,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-22 11:27:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,376 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:27:31,376 INFO L226 Difference]: Without dead ends: 52 [2019-10-22 11:27:31,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:27:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-22 11:27:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-22 11:27:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:27:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-22 11:27:31,378 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2019-10-22 11:27:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,378 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-22 11:27:31,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:27:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-22 11:27:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:27:31,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:31,380 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2019-10-22 11:27:31,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051586710] [2019-10-22 11:27:31,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,495 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:27:31,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051586710] [2019-10-22 11:27:31,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 11:27:31,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867354609] [2019-10-22 11:27:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 11:27:31,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 11:27:31,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:27:31,497 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2019-10-22 11:27:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,601 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-10-22 11:27:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:27:31,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-10-22 11:27:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,602 INFO L225 Difference]: With dead ends: 59 [2019-10-22 11:27:31,602 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:27:31,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:27:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:27:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-10-22 11:27:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:27:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-10-22 11:27:31,604 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2019-10-22 11:27:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,605 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-10-22 11:27:31,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 11:27:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-10-22 11:27:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:27:31,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:31,606 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2019-10-22 11:27:31,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978108300] [2019-10-22 11:27:31,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,744 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:27:31,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978108300] [2019-10-22 11:27:31,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:31,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984653049] [2019-10-22 11:27:31,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:31,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:31,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:31,746 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 5 states. [2019-10-22 11:27:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:31,811 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:27:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:31,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:27:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:31,812 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:27:31,812 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 11:27:31,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 11:27:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-22 11:27:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:27:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-10-22 11:27:31,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2019-10-22 11:27:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:31,814 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-10-22 11:27:31,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-10-22 11:27:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:27:31,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:31,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:31,815 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2019-10-22 11:27:31,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:31,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005977871] [2019-10-22 11:27:31,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:31,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:31,956 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:27:31,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005977871] [2019-10-22 11:27:31,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:31,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:31,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425069933] [2019-10-22 11:27:31,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:31,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:31,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:31,957 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2019-10-22 11:27:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:32,036 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-22 11:27:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:32,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:27:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:32,037 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:27:32,037 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:27:32,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:27:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:27:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:27:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:27:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:27:32,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-10-22 11:27:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:32,038 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:27:32,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:27:32,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:27:32,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-10-22 11:27:32,125 INFO L446 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-22 11:27:32,125 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-10-22 11:27:32,126 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-10-22 11:27:32,127 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-22 11:27:32,128 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 9 ULTIMATE.start_main_~main__t~0)) [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-10-22 11:27:32,129 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-10-22 11:27:32,130 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-22 11:27:32,131 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-10-22 11:27:32,132 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-22 11:27:32,133 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-22 11:27:32,134 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-10-22 11:27:32,135 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-10-22 11:27:32,135 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-10-22 11:27:32,135 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-10-22 11:27:32,135 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-10-22 11:27:32,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:32 BoogieIcfgContainer [2019-10-22 11:27:32,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:32,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:32,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:32,147 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:32,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:28" (3/4) ... [2019-10-22 11:27:32,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:27:32,163 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:27:32,163 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:27:32,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5477cd7c-42b6-4ef3-888b-08ce70f7db63/bin/utaipan/witness.graphml [2019-10-22 11:27:32,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:32,274 INFO L168 Benchmark]: Toolchain (without parser) took 5378.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 945.8 MB in the beginning and 985.9 MB in the end (delta: -40.0 MB). Peak memory consumption was 146.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,274 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:32,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.69 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:27:32,275 INFO L168 Benchmark]: Boogie Preprocessor took 29.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,275 INFO L168 Benchmark]: RCFGBuilder took 638.20 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,275 INFO L168 Benchmark]: TraceAbstraction took 4007.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.9 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,276 INFO L168 Benchmark]: Witness Printer took 125.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 985.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:32,278 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.69 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 29.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 638.20 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4007.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.9 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * Witness Printer took 125.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 985.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 697 SDtfs, 1844 SDslu, 728 SDs, 0 SdLazy, 2417 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 48 SyntacticMatches, 56 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, 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, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 32 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1146 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 31348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 correct! Received shutdown request...