./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/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 429b7772bb057004ca0c11ab7cd7751d4a0d846f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:23:21,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:23:21,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:23:21,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:23:21,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:23:21,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:23:21,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:23:21,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:23:21,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:23:21,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:23:21,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:23:21,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:23:21,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:23:21,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:23:21,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:23:21,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:23:21,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:23:21,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:23:21,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:23:21,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:23:21,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:23:21,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:23:21,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:23:21,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:23:21,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:23:21,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:23:21,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:23:21,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:23:21,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:23:21,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:23:21,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:23:21,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:23:21,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:23:21,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:23:21,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:23:21,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:23:21,715 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:23:21,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:23:21,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:23:21,725 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:23:21,725 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:23:21,725 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:23:21,726 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:23:21,726 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:23:21,727 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:23:21,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:23:21,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:23:21,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:23:21,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:23:21,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:23:21,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:23:21,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:23:21,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:23:21,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:23:21,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:23:21,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:23:21,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:23:21,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:23:21,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:23:21,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:23:21,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:23:21,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:23:21,730 INFO L133 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_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/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 -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2018-11-18 17:23:21,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:23:21,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:23:21,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:23:21,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:23:21,767 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:23:21,767 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-18 17:23:21,811 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/data/364aea1c2/c84f663275ab48b7acc4ce2e88c61785/FLAGeede0697e [2018-11-18 17:23:22,225 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:23:22,225 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-18 17:23:22,233 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/data/364aea1c2/c84f663275ab48b7acc4ce2e88c61785/FLAGeede0697e [2018-11-18 17:23:22,244 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/data/364aea1c2/c84f663275ab48b7acc4ce2e88c61785 [2018-11-18 17:23:22,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:23:22,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:23:22,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:23:22,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:23:22,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:23:22,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183d2547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22, skipping insertion in model container [2018-11-18 17:23:22,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:23:22,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:23:22,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:23:22,447 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:23:22,491 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:23:22,501 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:23:22,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22 WrapperNode [2018-11-18 17:23:22,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:23:22,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:23:22,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:23:22,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:23:22,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:23:22,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:23:22,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:23:22,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:23:22,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... [2018-11-18 17:23:22,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:23:22,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:23:22,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:23:22,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:23:22,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/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 [2018-11-18 17:23:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:23:22,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:23:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 17:23:22,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 17:23:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:23:22,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:23:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:23:22,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:23:22,717 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 17:23:22,717 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 17:23:23,048 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:23:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:23:23 BoogieIcfgContainer [2018-11-18 17:23:23,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:23:23,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:23:23,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:23:23,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:23:23,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:23:22" (1/3) ... [2018-11-18 17:23:23,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60df1ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:23:23, skipping insertion in model container [2018-11-18 17:23:23,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:23:22" (2/3) ... [2018-11-18 17:23:23,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60df1ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:23:23, skipping insertion in model container [2018-11-18 17:23:23,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:23:23" (3/3) ... [2018-11-18 17:23:23,053 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-18 17:23:23,059 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:23:23,064 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:23:23,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:23:23,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:23:23,093 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:23:23,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:23:23,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:23:23,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:23:23,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:23:23,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:23:23,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:23:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-18 17:23:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:23:23,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:23,114 INFO L375 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] [2018-11-18 17:23:23,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:23,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-11-18 17:23:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:23:23,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:23,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:23,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,287 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-18 17:23:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:23,366 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-18 17:23:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:23,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 17:23:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:23,376 INFO L225 Difference]: With dead ends: 380 [2018-11-18 17:23:23,376 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 17:23:23,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 17:23:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-18 17:23:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-18 17:23:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-18 17:23:23,411 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-18 17:23:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:23,411 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-18 17:23:23,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-18 17:23:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 17:23:23,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:23,413 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 17:23:23,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:23,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1775768565, now seen corresponding path program 1 times [2018-11-18 17:23:23,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:23:23,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:23,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:23,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:23,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,465 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-18 17:23:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:23,590 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2018-11-18 17:23:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:23,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 17:23:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:23,592 INFO L225 Difference]: With dead ends: 478 [2018-11-18 17:23:23,592 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 17:23:23,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 17:23:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-11-18 17:23:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 17:23:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-18 17:23:23,608 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-18 17:23:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:23,608 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-18 17:23:23,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-18 17:23:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 17:23:23,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:23,610 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-11-18 17:23:23,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:23,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -196010889, now seen corresponding path program 1 times [2018-11-18 17:23:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:23:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:23,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:23,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:23,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,676 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-18 17:23:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:23,809 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-11-18 17:23:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:23,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 17:23:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:23,812 INFO L225 Difference]: With dead ends: 608 [2018-11-18 17:23:23,812 INFO L226 Difference]: Without dead ends: 360 [2018-11-18 17:23:23,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-18 17:23:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-11-18 17:23:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-18 17:23:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-11-18 17:23:23,825 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-11-18 17:23:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:23,826 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-11-18 17:23:23,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-11-18 17:23:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 17:23:23,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:23,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-11-18 17:23:23,827 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:23,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash -330024395, now seen corresponding path program 1 times [2018-11-18 17:23:23,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:23,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:23:23,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:23,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:23,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:23,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,871 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-11-18 17:23:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:23,987 INFO L93 Difference]: Finished difference Result 722 states and 1019 transitions. [2018-11-18 17:23:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:23,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 17:23:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:23,989 INFO L225 Difference]: With dead ends: 722 [2018-11-18 17:23:23,989 INFO L226 Difference]: Without dead ends: 392 [2018-11-18 17:23:23,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-11-18 17:23:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2018-11-18 17:23:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 17:23:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-18 17:23:24,002 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-18 17:23:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,002 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-18 17:23:24,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-18 17:23:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 17:23:24,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,004 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-18 17:23:24,005 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2107235932, now seen corresponding path program 1 times [2018-11-18 17:23:24,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:23:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,057 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-18 17:23:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,217 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-18 17:23:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-18 17:23:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,223 INFO L225 Difference]: With dead ends: 860 [2018-11-18 17:23:24,223 INFO L226 Difference]: Without dead ends: 488 [2018-11-18 17:23:24,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-18 17:23:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-18 17:23:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-18 17:23:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-18 17:23:24,238 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-18 17:23:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,238 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-18 17:23:24,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-18 17:23:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 17:23:24,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,240 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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] [2018-11-18 17:23:24,240 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -402330157, now seen corresponding path program 1 times [2018-11-18 17:23:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:23:24,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,289 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-18 17:23:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,377 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-18 17:23:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 17:23:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,380 INFO L225 Difference]: With dead ends: 962 [2018-11-18 17:23:24,380 INFO L226 Difference]: Without dead ends: 512 [2018-11-18 17:23:24,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-18 17:23:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-18 17:23:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-18 17:23:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-18 17:23:24,397 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-18 17:23:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,398 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-18 17:23:24,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,398 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-18 17:23:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:23:24,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,400 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2018-11-18 17:23:24,400 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -199923553, now seen corresponding path program 1 times [2018-11-18 17:23:24,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:23:24,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,460 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-18 17:23:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,601 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-11-18 17:23:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 17:23:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,604 INFO L225 Difference]: With dead ends: 1106 [2018-11-18 17:23:24,604 INFO L226 Difference]: Without dead ends: 608 [2018-11-18 17:23:24,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-18 17:23:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-11-18 17:23:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-18 17:23:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-11-18 17:23:24,617 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-11-18 17:23:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,617 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-11-18 17:23:24,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-11-18 17:23:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:23:24,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,618 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1] [2018-11-18 17:23:24,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash -333937059, now seen corresponding path program 1 times [2018-11-18 17:23:24,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:23:24,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,664 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-11-18 17:23:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,691 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-11-18 17:23:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 17:23:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,695 INFO L225 Difference]: With dead ends: 1612 [2018-11-18 17:23:24,695 INFO L226 Difference]: Without dead ends: 1036 [2018-11-18 17:23:24,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-18 17:23:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-11-18 17:23:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-18 17:23:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-11-18 17:23:24,718 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-11-18 17:23:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,719 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-11-18 17:23:24,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-11-18 17:23:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:23:24,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,720 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 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] [2018-11-18 17:23:24,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2037876779, now seen corresponding path program 1 times [2018-11-18 17:23:24,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 17:23:24,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,774 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-11-18 17:23:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,812 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-11-18 17:23:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 17:23:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,817 INFO L225 Difference]: With dead ends: 2056 [2018-11-18 17:23:24,817 INFO L226 Difference]: Without dead ends: 1544 [2018-11-18 17:23:24,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-18 17:23:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-11-18 17:23:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-18 17:23:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-11-18 17:23:24,852 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-11-18 17:23:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:24,852 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-11-18 17:23:24,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-11-18 17:23:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 17:23:24,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:24,854 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 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] [2018-11-18 17:23:24,854 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:24,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 609264735, now seen corresponding path program 1 times [2018-11-18 17:23:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:24,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 17:23:24,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:24,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:24,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,913 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-11-18 17:23:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:24,958 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-11-18 17:23:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:24,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-18 17:23:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:24,965 INFO L225 Difference]: With dead ends: 2056 [2018-11-18 17:23:24,965 INFO L226 Difference]: Without dead ends: 2054 [2018-11-18 17:23:24,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-18 17:23:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-11-18 17:23:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-11-18 17:23:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-11-18 17:23:25,009 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-11-18 17:23:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:25,010 INFO L480 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-11-18 17:23:25,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-11-18 17:23:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 17:23:25,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:25,013 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 17:23:25,014 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:25,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 183144198, now seen corresponding path program 1 times [2018-11-18 17:23:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 17:23:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:25,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:25,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:25,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,056 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-11-18 17:23:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:25,194 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-11-18 17:23:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:25,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-18 17:23:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:25,202 INFO L225 Difference]: With dead ends: 4504 [2018-11-18 17:23:25,202 INFO L226 Difference]: Without dead ends: 2446 [2018-11-18 17:23:25,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-11-18 17:23:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-11-18 17:23:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-11-18 17:23:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-11-18 17:23:25,255 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 162 [2018-11-18 17:23:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:25,255 INFO L480 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-11-18 17:23:25,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-11-18 17:23:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 17:23:25,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:25,259 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-18 17:23:25,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:25,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash 285272055, now seen corresponding path program 1 times [2018-11-18 17:23:25,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-18 17:23:25,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:25,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:25,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:25,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,312 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-11-18 17:23:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:25,478 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-11-18 17:23:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:25,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-11-18 17:23:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:25,486 INFO L225 Difference]: With dead ends: 4874 [2018-11-18 17:23:25,487 INFO L226 Difference]: Without dead ends: 2552 [2018-11-18 17:23:25,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-11-18 17:23:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-11-18 17:23:25,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-11-18 17:23:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-11-18 17:23:25,552 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 199 [2018-11-18 17:23:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:25,552 INFO L480 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-11-18 17:23:25,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-11-18 17:23:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 17:23:25,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:25,559 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-18 17:23:25,559 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:25,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1787778247, now seen corresponding path program 1 times [2018-11-18 17:23:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-18 17:23:25,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:25,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:25,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:25,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,662 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-11-18 17:23:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:25,772 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-11-18 17:23:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:25,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-18 17:23:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:25,781 INFO L225 Difference]: With dead ends: 5272 [2018-11-18 17:23:25,781 INFO L226 Difference]: Without dead ends: 2758 [2018-11-18 17:23:25,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-18 17:23:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-11-18 17:23:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-11-18 17:23:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-11-18 17:23:25,835 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 221 [2018-11-18 17:23:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:25,836 INFO L480 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-11-18 17:23:25,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-11-18 17:23:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-18 17:23:25,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:25,841 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-18 17:23:25,841 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:25,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1716166414, now seen corresponding path program 1 times [2018-11-18 17:23:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:25,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-18 17:23:25,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:25,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:25,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:25,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:25,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:25,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:25,901 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-11-18 17:23:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:26,014 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-11-18 17:23:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:26,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-18 17:23:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:26,023 INFO L225 Difference]: With dead ends: 5704 [2018-11-18 17:23:26,024 INFO L226 Difference]: Without dead ends: 2982 [2018-11-18 17:23:26,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-11-18 17:23:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-11-18 17:23:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-18 17:23:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-11-18 17:23:26,086 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 246 [2018-11-18 17:23:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:26,087 INFO L480 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-11-18 17:23:26,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-11-18 17:23:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-18 17:23:26,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:26,092 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-18 17:23:26,092 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:26,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1296628596, now seen corresponding path program 1 times [2018-11-18 17:23:26,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-18 17:23:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:26,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:26,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,163 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-11-18 17:23:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:26,323 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-11-18 17:23:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:26,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-18 17:23:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:26,332 INFO L225 Difference]: With dead ends: 6200 [2018-11-18 17:23:26,333 INFO L226 Difference]: Without dead ends: 3246 [2018-11-18 17:23:26,337 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-18 17:23:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-11-18 17:23:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-11-18 17:23:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-11-18 17:23:26,389 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 246 [2018-11-18 17:23:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:26,389 INFO L480 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-11-18 17:23:26,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-11-18 17:23:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-18 17:23:26,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:26,395 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-18 17:23:26,395 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:26,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 801968022, now seen corresponding path program 1 times [2018-11-18 17:23:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-18 17:23:26,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:26,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:26,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:26,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,525 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-11-18 17:23:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:26,623 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-11-18 17:23:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:26,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-18 17:23:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:26,640 INFO L225 Difference]: With dead ends: 9346 [2018-11-18 17:23:26,641 INFO L226 Difference]: Without dead ends: 6136 [2018-11-18 17:23:26,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-11-18 17:23:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-11-18 17:23:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-11-18 17:23:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-11-18 17:23:26,743 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 277 [2018-11-18 17:23:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:26,744 INFO L480 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-11-18 17:23:26,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-11-18 17:23:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-18 17:23:26,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:26,753 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-18 17:23:26,753 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:26,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash -480204264, now seen corresponding path program 1 times [2018-11-18 17:23:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:26,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-18 17:23:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:26,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:26,826 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-11-18 17:23:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:26,996 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-11-18 17:23:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:26,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-18 17:23:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:27,009 INFO L225 Difference]: With dead ends: 12864 [2018-11-18 17:23:27,009 INFO L226 Difference]: Without dead ends: 6742 [2018-11-18 17:23:27,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-18 17:23:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-11-18 17:23:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-18 17:23:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-11-18 17:23:27,123 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 277 [2018-11-18 17:23:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:27,124 INFO L480 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-11-18 17:23:27,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-11-18 17:23:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-18 17:23:27,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:27,134 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:27,134 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:27,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:27,135 INFO L82 PathProgramCache]: Analyzing trace with hash 8856548, now seen corresponding path program 1 times [2018-11-18 17:23:27,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1178 backedges. 686 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2018-11-18 17:23:27,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:27,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:27,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,212 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-11-18 17:23:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:27,365 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-11-18 17:23:27,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:27,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-11-18 17:23:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:27,402 INFO L225 Difference]: With dead ends: 13432 [2018-11-18 17:23:27,402 INFO L226 Difference]: Without dead ends: 6734 [2018-11-18 17:23:27,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-11-18 17:23:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-11-18 17:23:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-18 17:23:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-11-18 17:23:27,508 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 302 [2018-11-18 17:23:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:27,509 INFO L480 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-11-18 17:23:27,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-11-18 17:23:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-18 17:23:27,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:27,519 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:27,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:27,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 510871661, now seen corresponding path program 1 times [2018-11-18 17:23:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-18 17:23:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:27,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:27,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:27,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,605 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-11-18 17:23:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:27,785 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-11-18 17:23:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:27,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-18 17:23:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:27,797 INFO L225 Difference]: With dead ends: 14208 [2018-11-18 17:23:27,797 INFO L226 Difference]: Without dead ends: 7518 [2018-11-18 17:23:27,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-11-18 17:23:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-11-18 17:23:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-18 17:23:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-11-18 17:23:27,906 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 313 [2018-11-18 17:23:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:27,907 INFO L480 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-11-18 17:23:27,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-11-18 17:23:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-18 17:23:27,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:27,918 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:27,918 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:27,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1593672479, now seen corresponding path program 1 times [2018-11-18 17:23:27,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:27,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-18 17:23:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:27,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:27,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:27,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:27,998 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-11-18 17:23:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:28,189 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-11-18 17:23:28,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:28,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-18 17:23:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:28,201 INFO L225 Difference]: With dead ends: 15496 [2018-11-18 17:23:28,201 INFO L226 Difference]: Without dead ends: 8166 [2018-11-18 17:23:28,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-18 17:23:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-11-18 17:23:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-18 17:23:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-11-18 17:23:28,338 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 328 [2018-11-18 17:23:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:28,339 INFO L480 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-11-18 17:23:28,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-11-18 17:23:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-18 17:23:28,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:28,352 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:28,352 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:28,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1085355354, now seen corresponding path program 1 times [2018-11-18 17:23:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:28,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-18 17:23:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:28,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:28,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:28,507 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-11-18 17:23:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:28,711 INFO L93 Difference]: Finished difference Result 15176 states and 19730 transitions. [2018-11-18 17:23:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:28,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-18 17:23:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:28,721 INFO L225 Difference]: With dead ends: 15176 [2018-11-18 17:23:28,722 INFO L226 Difference]: Without dead ends: 7598 [2018-11-18 17:23:28,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-18 17:23:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-11-18 17:23:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-11-18 17:23:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-11-18 17:23:28,826 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 330 [2018-11-18 17:23:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:28,826 INFO L480 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-11-18 17:23:28,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-11-18 17:23:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-18 17:23:28,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:28,837 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:28,837 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:28,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash 880461980, now seen corresponding path program 1 times [2018-11-18 17:23:28,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:28,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 817 proven. 13 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-18 17:23:28,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:28,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:23:28,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-18 17:23:28,951 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [246], [249], [257], [260], [265], [268], [270], [273], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 17:23:28,982 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:23:28,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:23:29,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:23:29,592 INFO L272 AbstractInterpreter]: Visited 103 different actions 314 times. Merged at 84 different actions 183 times. Widened at 1 different actions 1 times. Performed 1641 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 16 different actions. Largest state had 114 variables. [2018-11-18 17:23:29,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:29,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:23:29,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:29,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:23:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:29,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:23:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:29,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:23:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2018-11-18 17:23:29,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:23:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2018-11-18 17:23:30,041 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:23:30,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-11-18 17:23:30,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:30,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:23:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:23:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:23:30,043 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 5 states. [2018-11-18 17:23:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:30,348 INFO L93 Difference]: Finished difference Result 15299 states and 19804 transitions. [2018-11-18 17:23:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:23:30,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2018-11-18 17:23:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:30,361 INFO L225 Difference]: With dead ends: 15299 [2018-11-18 17:23:30,361 INFO L226 Difference]: Without dead ends: 7717 [2018-11-18 17:23:30,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:23:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7717 states. [2018-11-18 17:23:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7717 to 7573. [2018-11-18 17:23:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2018-11-18 17:23:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 9798 transitions. [2018-11-18 17:23:30,513 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 9798 transitions. Word has length 353 [2018-11-18 17:23:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:30,513 INFO L480 AbstractCegarLoop]: Abstraction has 7573 states and 9798 transitions. [2018-11-18 17:23:30,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:23:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 9798 transitions. [2018-11-18 17:23:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-11-18 17:23:30,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:30,526 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:30,526 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:30,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1048619351, now seen corresponding path program 1 times [2018-11-18 17:23:30,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:30,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:30,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:30,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:30,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-18 17:23:30,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:30,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:23:30,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-11-18 17:23:30,667 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [270], [273], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 17:23:30,674 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:23:30,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:23:30,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:23:30,954 INFO L272 AbstractInterpreter]: Visited 112 different actions 243 times. Merged at 92 different actions 113 times. Widened at 2 different actions 2 times. Performed 1196 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 15 different actions. Largest state had 116 variables. [2018-11-18 17:23:30,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:30,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:23:30,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:30,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:23:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:30,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:23:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:31,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:23:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-18 17:23:31,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:23:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 847 proven. 13 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-18 17:23:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:23:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 17:23:31,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:23:31,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:23:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:23:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:23:31,376 INFO L87 Difference]: Start difference. First operand 7573 states and 9798 transitions. Second operand 4 states. [2018-11-18 17:23:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:31,939 INFO L93 Difference]: Finished difference Result 17714 states and 22609 transitions. [2018-11-18 17:23:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:23:31,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2018-11-18 17:23:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:31,956 INFO L225 Difference]: With dead ends: 17714 [2018-11-18 17:23:31,956 INFO L226 Difference]: Without dead ends: 10152 [2018-11-18 17:23:31,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:23:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10152 states. [2018-11-18 17:23:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10152 to 7714. [2018-11-18 17:23:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7714 states. [2018-11-18 17:23:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7714 states to 7714 states and 9800 transitions. [2018-11-18 17:23:32,108 INFO L78 Accepts]: Start accepts. Automaton has 7714 states and 9800 transitions. Word has length 367 [2018-11-18 17:23:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:32,109 INFO L480 AbstractCegarLoop]: Abstraction has 7714 states and 9800 transitions. [2018-11-18 17:23:32,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:23:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7714 states and 9800 transitions. [2018-11-18 17:23:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-18 17:23:32,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:32,122 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:32,122 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:32,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1679620924, now seen corresponding path program 2 times [2018-11-18 17:23:32,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:32,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:32,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 911 proven. 6 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-18 17:23:32,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:32,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:23:32,240 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 17:23:32,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 17:23:32,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:32,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:23:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:23:32,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 17:23:32,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 17:23:32,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:23:32,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:23:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-18 17:23:32,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:23:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-18 17:23:32,471 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:23:32,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-11-18 17:23:32,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:32,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:23:32,472 INFO L87 Difference]: Start difference. First operand 7714 states and 9800 transitions. Second operand 3 states. [2018-11-18 17:23:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:32,760 INFO L93 Difference]: Finished difference Result 15591 states and 19800 transitions. [2018-11-18 17:23:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:32,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-11-18 17:23:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:32,772 INFO L225 Difference]: With dead ends: 15591 [2018-11-18 17:23:32,772 INFO L226 Difference]: Without dead ends: 7896 [2018-11-18 17:23:32,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:23:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2018-11-18 17:23:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 7298. [2018-11-18 17:23:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7298 states. [2018-11-18 17:23:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 8976 transitions. [2018-11-18 17:23:32,893 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 8976 transitions. Word has length 381 [2018-11-18 17:23:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:32,893 INFO L480 AbstractCegarLoop]: Abstraction has 7298 states and 8976 transitions. [2018-11-18 17:23:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 8976 transitions. [2018-11-18 17:23:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-18 17:23:32,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:32,899 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:32,900 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:32,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1843020363, now seen corresponding path program 1 times [2018-11-18 17:23:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:32,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:23:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:32,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 17:23:33,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:33,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:23:33,021 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-11-18 17:23:33,021 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [270], [273], [281], [286], [288], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 17:23:33,024 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:23:33,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:23:33,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:23:33,525 INFO L272 AbstractInterpreter]: Visited 113 different actions 417 times. Merged at 96 different actions 259 times. Widened at 2 different actions 2 times. Performed 2194 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 54 fixpoints after 23 different actions. Largest state had 116 variables. [2018-11-18 17:23:33,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:33,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:23:33,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:33,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:23:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:33,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:23:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:33,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:23:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 17:23:33,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:23:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 17:23:33,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:23:33,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 17:23:33,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:23:33,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:23:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:23:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:23:33,797 INFO L87 Difference]: Start difference. First operand 7298 states and 8976 transitions. Second operand 4 states. [2018-11-18 17:23:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:34,045 INFO L93 Difference]: Finished difference Result 15978 states and 19523 transitions. [2018-11-18 17:23:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:23:34,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-18 17:23:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:34,054 INFO L225 Difference]: With dead ends: 15978 [2018-11-18 17:23:34,054 INFO L226 Difference]: Without dead ends: 8808 [2018-11-18 17:23:34,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:23:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8808 states. [2018-11-18 17:23:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8808 to 7266. [2018-11-18 17:23:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7266 states. [2018-11-18 17:23:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7266 states to 7266 states and 8880 transitions. [2018-11-18 17:23:34,157 INFO L78 Accepts]: Start accepts. Automaton has 7266 states and 8880 transitions. Word has length 396 [2018-11-18 17:23:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:34,158 INFO L480 AbstractCegarLoop]: Abstraction has 7266 states and 8880 transitions. [2018-11-18 17:23:34,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:23:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7266 states and 8880 transitions. [2018-11-18 17:23:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-18 17:23:34,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:34,164 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:34,164 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:34,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 934836294, now seen corresponding path program 1 times [2018-11-18 17:23:34,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:34,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-18 17:23:34,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:34,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:34,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:34,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:34,290 INFO L87 Difference]: Start difference. First operand 7266 states and 8880 transitions. Second operand 3 states. [2018-11-18 17:23:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:34,409 INFO L93 Difference]: Finished difference Result 13348 states and 16219 transitions. [2018-11-18 17:23:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:34,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-18 17:23:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:34,415 INFO L225 Difference]: With dead ends: 13348 [2018-11-18 17:23:34,415 INFO L226 Difference]: Without dead ends: 5456 [2018-11-18 17:23:34,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2018-11-18 17:23:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5195. [2018-11-18 17:23:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5195 states. [2018-11-18 17:23:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 6308 transitions. [2018-11-18 17:23:34,474 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 6308 transitions. Word has length 436 [2018-11-18 17:23:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:34,474 INFO L480 AbstractCegarLoop]: Abstraction has 5195 states and 6308 transitions. [2018-11-18 17:23:34,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 6308 transitions. [2018-11-18 17:23:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-11-18 17:23:34,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:34,478 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:34,478 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:34,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1940794016, now seen corresponding path program 1 times [2018-11-18 17:23:34,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:34,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:34,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1438 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2018-11-18 17:23:34,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:23:34,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:23:34,583 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:23:34,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:23:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:23:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:34,584 INFO L87 Difference]: Start difference. First operand 5195 states and 6308 transitions. Second operand 3 states. [2018-11-18 17:23:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:34,637 INFO L93 Difference]: Finished difference Result 9375 states and 11393 transitions. [2018-11-18 17:23:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:23:34,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2018-11-18 17:23:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:34,642 INFO L225 Difference]: With dead ends: 9375 [2018-11-18 17:23:34,642 INFO L226 Difference]: Without dead ends: 4090 [2018-11-18 17:23:34,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:23:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2018-11-18 17:23:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3646. [2018-11-18 17:23:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2018-11-18 17:23:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 4510 transitions. [2018-11-18 17:23:34,681 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 4510 transitions. Word has length 482 [2018-11-18 17:23:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:34,682 INFO L480 AbstractCegarLoop]: Abstraction has 3646 states and 4510 transitions. [2018-11-18 17:23:34,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:23:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 4510 transitions. [2018-11-18 17:23:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-11-18 17:23:34,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:23:34,686 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:23:34,686 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:23:34,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:34,686 INFO L82 PathProgramCache]: Analyzing trace with hash -206246475, now seen corresponding path program 1 times [2018-11-18 17:23:34,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:23:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:23:34,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:23:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-18 17:23:34,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:34,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:23:34,821 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 636 with the following transitions: [2018-11-18 17:23:34,821 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [184], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [270], [273], [281], [284], [288], [290], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [413], [418], [423], [425], [430], [433], [437], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 17:23:34,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:23:34,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:23:35,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:23:35,056 INFO L272 AbstractInterpreter]: Visited 116 different actions 243 times. Merged at 91 different actions 110 times. Widened at 1 different actions 1 times. Performed 1190 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 25 fixpoints after 16 different actions. Largest state had 117 variables. [2018-11-18 17:23:35,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:23:35,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:23:35,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:23:35,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:23:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:23:35,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:23:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:23:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:23:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-18 17:23:35,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:23:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 2170 proven. 15 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-11-18 17:23:35,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:23:35,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 17:23:35,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:23:35,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:23:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:23:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:23:35,509 INFO L87 Difference]: Start difference. First operand 3646 states and 4510 transitions. Second operand 4 states. [2018-11-18 17:23:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:23:35,639 INFO L93 Difference]: Finished difference Result 4532 states and 5605 transitions. [2018-11-18 17:23:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:23:35,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 635 [2018-11-18 17:23:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:23:35,640 INFO L225 Difference]: With dead ends: 4532 [2018-11-18 17:23:35,640 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:23:35,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1270 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:23:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:23:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:23:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:23:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:23:35,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 635 [2018-11-18 17:23:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:23:35,645 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:23:35,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:23:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:23:35,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:23:35,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:23:35,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:35,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:23:36,046 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 97 [2018-11-18 17:23:36,335 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-18 17:23:36,712 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-11-18 17:23:37,158 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-18 17:23:37,160 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 17:23:37,160 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:23:37,160 INFO L428 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-11-18 17:23:37,160 INFO L425 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-11-18 17:23:37,160 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-11-18 17:23:37,160 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-11-18 17:23:37,160 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-11-18 17:23:37,160 INFO L421 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse2) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0))) [2018-11-18 17:23:37,161 INFO L421 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-11-18 17:23:37,161 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L421 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-18 17:23:37,162 INFO L421 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 563) no Hoare annotation was computed. [2018-11-18 17:23:37,162 INFO L425 ceAbstractionStarter]: For program point L108-2(lines 85 575) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L428 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-11-18 17:23:37,163 INFO L421 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L428 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-11-18 17:23:37,163 INFO L425 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L421 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-18 17:23:37,164 INFO L421 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L421 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__state~0 4560)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse9 (<= 4352 ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (= ssl3_connect_~s__state~0 4512)) (.cse1 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (not .cse2))) (or (and .cse0 .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4496) .cse1 .cse2) (and .cse3 .cse4 .cse1 .cse5 .cse2 .cse6) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse8 .cse9 .cse10) (and .cse2 (and (= ssl3_connect_~s__state~0 4432) .cse1)) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and .cse7 .cse4 .cse10 .cse5) (and .cse7 .cse11) (and .cse12 .cse3 .cse1 .cse6) (and .cse11 .cse1 .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and .cse7 (= ssl3_connect_~s__state~0 4400) .cse2) (and .cse3 .cse8 .cse9 .cse1 .cse2 .cse6) (and (and (= ssl3_connect_~s__state~0 4448) .cse1) .cse2) (<= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse0) (and .cse1 .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4464) .cse1 .cse2) (and (= ssl3_connect_~s__state~0 4416) .cse1 .cse2) (and .cse12 .cse3 .cse10)))) [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L421 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-11-18 17:23:37,164 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L421 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L421 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-11-18 17:23:37,165 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L421 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 0)) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)))) [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L421 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 0)) .cse1) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)))) [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-11-18 17:23:37,166 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L421 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) .cse1))) [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-11-18 17:23:37,167 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L421 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-11-18 17:23:37,168 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L421 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-11-18 17:23:37,169 INFO L421 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-18 17:23:37,169 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:23:37,170 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 17:23:37,170 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:23:37,170 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:23:37,170 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-11-18 17:23:37,170 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-11-18 17:23:37,170 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-11-18 17:23:37,170 INFO L421 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-18 17:23:37,170 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-18 17:23:37,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:23:37 BoogieIcfgContainer [2018-11-18 17:23:37,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:23:37,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:23:37,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:23:37,190 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:23:37,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:23:23" (3/4) ... [2018-11-18 17:23:37,194 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:23:37,199 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:23:37,199 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-18 17:23:37,200 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:23:37,207 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-18 17:23:37,208 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 17:23:37,208 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-18 17:23:37,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-18 17:23:37,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) [2018-11-18 17:23:37,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 2 && s__state == 4528)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0)) [2018-11-18 17:23:37,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-18 17:23:37,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-18 17:23:37,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 0 && 4560 <= s__state) [2018-11-18 17:23:37,235 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-18 17:23:37,283 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_615176b0-9d5c-4ec1-b203-4f287961398f/bin-2019/utaipan/witness.graphml [2018-11-18 17:23:37,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:23:37,284 INFO L168 Benchmark]: Toolchain (without parser) took 15036.36 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 962.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:23:37,284 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:23:37,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.27 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:23:37,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:23:37,285 INFO L168 Benchmark]: Boogie Preprocessor took 32.74 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. [2018-11-18 17:23:37,285 INFO L168 Benchmark]: RCFGBuilder took 459.00 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:23:37,285 INFO L168 Benchmark]: TraceAbstraction took 14140.83 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-18 17:23:37,286 INFO L168 Benchmark]: Witness Printer took 92.65 ms. Allocated memory is still 2.5 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:23:37,287 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.27 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 940.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 459.00 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: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14140.83 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 92.65 ms. Allocated memory is still 2.5 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4512 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((4352 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s__state == 4512 && blastFlag <= 4) && s__hit == 0) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__hit == 0 && s__state == 4432 && blastFlag <= 4)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || (blastFlag <= 2 && s__state == 4528)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) || \old(initial_state) < 12292) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 14.0s OverallTime, 28 OverallIterations, 21 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 5793 SDtfs, 2023 SDslu, 3451 SDs, 0 SdLazy, 2811 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4355 GetRequests, 4304 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7714occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 6571 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 191 NumberOfFragments, 631 HoareAnnotationTreeSize, 26 FomulaSimplifications, 26860 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2262 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 8852 NumberOfCodeBlocks, 8573 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 10946 ConstructedInterpolants, 0 QuantifiedInterpolants, 5085751 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3492 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 46415/46536 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...