./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-1dbac8b [2018-11-10 11:33:50,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:33:50,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:33:50,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:33:50,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:33:50,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:33:50,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:33:50,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:33:50,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:33:50,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:33:50,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:33:50,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:33:50,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:33:50,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:33:50,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:33:50,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:33:50,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:33:50,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:33:50,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:33:50,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:33:50,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:33:50,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:33:50,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:33:50,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:33:50,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:33:50,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:33:50,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:33:50,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:33:50,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:33:50,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:33:50,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:33:50,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:33:50,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:33:50,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:33:50,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:33:50,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:33:50,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:33:50,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:33:50,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:33:50,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:33:50,045 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:33:50,045 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:33:50,045 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:33:50,045 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:33:50,046 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:33:50,046 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:33:50,046 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:33:50,046 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:33:50,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:33:50,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:33:50,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:33:50,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:33:50,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:33:50,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:33:50,049 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:33:50,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:33:50,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:33:50,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:33:50,049 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_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:33:50,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:33:50,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:33:50,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:33:50,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:33:50,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:33:50,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-10 11:33:50,129 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/data/911998d71/83c2f7d9c7e748e693a3b0f5c588bdb3/FLAGf7daa3005 [2018-11-10 11:33:50,539 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:33:50,540 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-10 11:33:50,545 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/data/911998d71/83c2f7d9c7e748e693a3b0f5c588bdb3/FLAGf7daa3005 [2018-11-10 11:33:50,557 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/data/911998d71/83c2f7d9c7e748e693a3b0f5c588bdb3 [2018-11-10 11:33:50,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:33:50,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:33:50,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:33:50,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:33:50,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:33:50,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d1fd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50, skipping insertion in model container [2018-11-10 11:33:50,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:33:50,605 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:33:50,759 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:33:50,762 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:33:50,801 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:33:50,809 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:33:50,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50 WrapperNode [2018-11-10 11:33:50,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:33:50,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:33:50,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:33:50,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:33:50,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:33:50,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:33:50,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:33:50,860 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:33:50,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... [2018-11-10 11:33:50,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:33:50,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:33:50,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:33:50,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:33:50,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:33:50,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:33:50,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:33:50,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:33:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:33:50,929 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 11:33:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 11:33:50,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:33:50,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:33:51,009 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 11:33:51,010 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 11:33:51,339 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:33:51,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:51 BoogieIcfgContainer [2018-11-10 11:33:51,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:33:51,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:33:51,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:33:51,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:33:51,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:33:50" (1/3) ... [2018-11-10 11:33:51,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7620766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:33:51, skipping insertion in model container [2018-11-10 11:33:51,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:50" (2/3) ... [2018-11-10 11:33:51,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7620766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:33:51, skipping insertion in model container [2018-11-10 11:33:51,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:51" (3/3) ... [2018-11-10 11:33:51,343 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-10 11:33:51,348 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:33:51,353 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:33:51,361 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:33:51,379 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:33:51,379 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:33:51,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:33:51,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:33:51,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:33:51,379 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:33:51,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:33:51,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:33:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-10 11:33:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 11:33:51,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:51,395 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-10 11:33:51,397 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-11-10 11:33:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:51,545 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-10 11:33:51,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:51,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:51,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:51,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:51,565 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-10 11:33:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:51,630 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-10 11:33:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:51,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 11:33:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:51,638 INFO L225 Difference]: With dead ends: 380 [2018-11-10 11:33:51,639 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 11:33:51,641 INFO L605 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-10 11:33:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 11:33:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-10 11:33:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 11:33:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-10 11:33:51,676 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-10 11:33:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:51,676 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-10 11:33:51,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-10 11:33:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:33:51,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:51,678 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-10 11:33:51,678 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:51,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash -770617106, now seen corresponding path program 1 times [2018-11-10 11:33:51,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:51,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:51,729 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-10 11:33:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:51,730 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:51,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:51,731 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-10 11:33:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:51,868 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2018-11-10 11:33:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:51,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 11:33:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:51,871 INFO L225 Difference]: With dead ends: 478 [2018-11-10 11:33:51,871 INFO L226 Difference]: Without dead ends: 268 [2018-11-10 11:33:51,872 INFO L605 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-10 11:33:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-10 11:33:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2018-11-10 11:33:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 11:33:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-10 11:33:51,884 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-10 11:33:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:51,885 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-10 11:33:51,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-10 11:33:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 11:33:51,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:51,886 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-10 11:33:51,886 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:51,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -93589576, now seen corresponding path program 1 times [2018-11-10 11:33:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:51,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:51,939 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-10 11:33:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:51,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:51,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:51,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:51,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:51,941 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-10 11:33:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,066 INFO L93 Difference]: Finished difference Result 556 states and 817 transitions. [2018-11-10 11:33:52,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 11:33:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,068 INFO L225 Difference]: With dead ends: 556 [2018-11-10 11:33:52,068 INFO L226 Difference]: Without dead ends: 310 [2018-11-10 11:33:52,069 INFO L605 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-10 11:33:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-10 11:33:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2018-11-10 11:33:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-10 11:33:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2018-11-10 11:33:52,082 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 63 [2018-11-10 11:33:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,083 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2018-11-10 11:33:52,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2018-11-10 11:33:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 11:33:52,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,085 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-10 11:33:52,086 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash 40423930, now seen corresponding path program 1 times [2018-11-10 11:33:52,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,130 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-10 11:33:52,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,132 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand 3 states. [2018-11-10 11:33:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,267 INFO L93 Difference]: Finished difference Result 690 states and 1014 transitions. [2018-11-10 11:33:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 11:33:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,269 INFO L225 Difference]: With dead ends: 690 [2018-11-10 11:33:52,269 INFO L226 Difference]: Without dead ends: 400 [2018-11-10 11:33:52,270 INFO L605 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-10 11:33:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-11-10 11:33:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2018-11-10 11:33:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 11:33:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-10 11:33:52,282 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-10 11:33:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,283 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-10 11:33:52,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-10 11:33:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 11:33:52,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,285 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-10 11:33:52,285 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1896332607, now seen corresponding path program 1 times [2018-11-10 11:33:52,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,355 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-10 11:33:52,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,356 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-10 11:33:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,482 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-10 11:33:52,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 11:33:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,485 INFO L225 Difference]: With dead ends: 860 [2018-11-10 11:33:52,485 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 11:33:52,486 INFO L605 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-10 11:33:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 11:33:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-10 11:33:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-10 11:33:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-10 11:33:52,500 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-10 11:33:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,500 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-10 11:33:52,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-10 11:33:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 11:33:52,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,502 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-10 11:33:52,502 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1579938826, now seen corresponding path program 1 times [2018-11-10 11:33:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,548 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-10 11:33:52,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,549 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-10 11:33:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,631 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-10 11:33:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 11:33:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,633 INFO L225 Difference]: With dead ends: 962 [2018-11-10 11:33:52,633 INFO L226 Difference]: Without dead ends: 512 [2018-11-10 11:33:52,634 INFO L605 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-10 11:33:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-10 11:33:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-10 11:33:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-10 11:33:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-10 11:33:52,644 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-10 11:33:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,645 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-10 11:33:52,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-10 11:33:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 11:33:52,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,647 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-10 11:33:52,647 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1478150613, now seen corresponding path program 1 times [2018-11-10 11:33:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,703 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-10 11:33:52,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,703 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,704 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-10 11:33:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,736 INFO L93 Difference]: Finished difference Result 1000 states and 1421 transitions. [2018-11-10 11:33:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 11:33:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,742 INFO L225 Difference]: With dead ends: 1000 [2018-11-10 11:33:52,742 INFO L226 Difference]: Without dead ends: 752 [2018-11-10 11:33:52,743 INFO L605 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-10 11:33:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-10 11:33:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2018-11-10 11:33:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-10 11:33:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1065 transitions. [2018-11-10 11:33:52,778 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1065 transitions. Word has length 102 [2018-11-10 11:33:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,778 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1065 transitions. [2018-11-10 11:33:52,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1065 transitions. [2018-11-10 11:33:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 11:33:52,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,780 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-10 11:33:52,780 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash -627673409, now seen corresponding path program 1 times [2018-11-10 11:33:52,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,830 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-10 11:33:52,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,831 INFO L87 Difference]: Start difference. First operand 752 states and 1065 transitions. Second operand 3 states. [2018-11-10 11:33:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:52,860 INFO L93 Difference]: Finished difference Result 1000 states and 1418 transitions. [2018-11-10 11:33:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:52,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-10 11:33:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:52,863 INFO L225 Difference]: With dead ends: 1000 [2018-11-10 11:33:52,863 INFO L226 Difference]: Without dead ends: 998 [2018-11-10 11:33:52,864 INFO L605 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-10 11:33:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-10 11:33:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2018-11-10 11:33:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-11-10 11:33:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1416 transitions. [2018-11-10 11:33:52,885 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1416 transitions. Word has length 104 [2018-11-10 11:33:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:52,885 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1416 transitions. [2018-11-10 11:33:52,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1416 transitions. [2018-11-10 11:33:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 11:33:52,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:52,888 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-10 11:33:52,888 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:52,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1947098042, now seen corresponding path program 1 times [2018-11-10 11:33:52,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:52,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:52,943 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-10 11:33:52,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:52,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:52,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:52,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:52,944 INFO L87 Difference]: Start difference. First operand 998 states and 1416 transitions. Second operand 3 states. [2018-11-10 11:33:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,076 INFO L93 Difference]: Finished difference Result 2192 states and 3160 transitions. [2018-11-10 11:33:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-10 11:33:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,080 INFO L225 Difference]: With dead ends: 2192 [2018-11-10 11:33:53,080 INFO L226 Difference]: Without dead ends: 1198 [2018-11-10 11:33:53,081 INFO L605 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-10 11:33:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-11-10 11:33:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1158. [2018-11-10 11:33:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 11:33:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1660 transitions. [2018-11-10 11:33:53,107 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1660 transitions. Word has length 162 [2018-11-10 11:33:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,107 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1660 transitions. [2018-11-10 11:33:53,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1660 transitions. [2018-11-10 11:33:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 11:33:53,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,110 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-10 11:33:53,110 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1355334650, now seen corresponding path program 1 times [2018-11-10 11:33:53,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:53,167 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-10 11:33:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:53,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:53,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:53,168 INFO L87 Difference]: Start difference. First operand 1158 states and 1660 transitions. Second operand 3 states. [2018-11-10 11:33:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,271 INFO L93 Difference]: Finished difference Result 2414 states and 3438 transitions. [2018-11-10 11:33:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-11-10 11:33:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,276 INFO L225 Difference]: With dead ends: 2414 [2018-11-10 11:33:53,276 INFO L226 Difference]: Without dead ends: 1268 [2018-11-10 11:33:53,278 INFO L605 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-10 11:33:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-11-10 11:33:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1254. [2018-11-10 11:33:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-11-10 11:33:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-11-10 11:33:53,305 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1776 transitions. Word has length 199 [2018-11-10 11:33:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,305 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-11-10 11:33:53,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1776 transitions. [2018-11-10 11:33:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 11:33:53,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,309 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-10 11:33:53,309 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1865787222, now seen corresponding path program 1 times [2018-11-10 11:33:53,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:53,367 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-10 11:33:53,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:53,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:53,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:53,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:53,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:53,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:53,368 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. Second operand 3 states. [2018-11-10 11:33:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,464 INFO L93 Difference]: Finished difference Result 2612 states and 3688 transitions. [2018-11-10 11:33:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-10 11:33:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,468 INFO L225 Difference]: With dead ends: 2612 [2018-11-10 11:33:53,468 INFO L226 Difference]: Without dead ends: 1370 [2018-11-10 11:33:53,470 INFO L605 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-10 11:33:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-10 11:33:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1358. [2018-11-10 11:33:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-11-10 11:33:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1900 transitions. [2018-11-10 11:33:53,498 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1900 transitions. Word has length 221 [2018-11-10 11:33:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,498 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1900 transitions. [2018-11-10 11:33:53,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1900 transitions. [2018-11-10 11:33:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 11:33:53,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,502 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-10 11:33:53,502 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 632408180, now seen corresponding path program 1 times [2018-11-10 11:33:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:53,603 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-10 11:33:53,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:53,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:53,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:53,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:53,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:53,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:53,605 INFO L87 Difference]: Start difference. First operand 1358 states and 1900 transitions. Second operand 3 states. [2018-11-10 11:33:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,694 INFO L93 Difference]: Finished difference Result 2848 states and 3988 transitions. [2018-11-10 11:33:53,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-10 11:33:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,697 INFO L225 Difference]: With dead ends: 2848 [2018-11-10 11:33:53,697 INFO L226 Difference]: Without dead ends: 1502 [2018-11-10 11:33:53,699 INFO L605 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-10 11:33:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-11-10 11:33:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1490. [2018-11-10 11:33:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-11-10 11:33:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2052 transitions. [2018-11-10 11:33:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2052 transitions. Word has length 246 [2018-11-10 11:33:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,716 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 2052 transitions. [2018-11-10 11:33:53,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2052 transitions. [2018-11-10 11:33:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-10 11:33:53,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,718 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-10 11:33:53,719 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1914580466, now seen corresponding path program 1 times [2018-11-10 11:33:53,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:53,765 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-10 11:33:53,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:53,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:53,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:53,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:53,766 INFO L87 Difference]: Start difference. First operand 1490 states and 2052 transitions. Second operand 3 states. [2018-11-10 11:33:53,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,846 INFO L93 Difference]: Finished difference Result 3088 states and 4248 transitions. [2018-11-10 11:33:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-11-10 11:33:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,849 INFO L225 Difference]: With dead ends: 3088 [2018-11-10 11:33:53,849 INFO L226 Difference]: Without dead ends: 1610 [2018-11-10 11:33:53,850 INFO L605 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-10 11:33:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-11-10 11:33:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1602. [2018-11-10 11:33:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-11-10 11:33:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2184 transitions. [2018-11-10 11:33:53,868 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2184 transitions. Word has length 246 [2018-11-10 11:33:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,869 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 2184 transitions. [2018-11-10 11:33:53,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2184 transitions. [2018-11-10 11:33:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-10 11:33:53,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,872 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-10 11:33:53,872 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 348301561, now seen corresponding path program 1 times [2018-11-10 11:33:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:53,920 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-10 11:33:53,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:53,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:53,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:53,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:53,921 INFO L87 Difference]: Start difference. First operand 1602 states and 2184 transitions. Second operand 3 states. [2018-11-10 11:33:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:53,951 INFO L93 Difference]: Finished difference Result 4778 states and 6516 transitions. [2018-11-10 11:33:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:53,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-10 11:33:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:53,956 INFO L225 Difference]: With dead ends: 4778 [2018-11-10 11:33:53,956 INFO L226 Difference]: Without dead ends: 3188 [2018-11-10 11:33:53,958 INFO L605 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-10 11:33:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-11-10 11:33:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-11-10 11:33:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-11-10 11:33:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4343 transitions. [2018-11-10 11:33:53,991 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4343 transitions. Word has length 277 [2018-11-10 11:33:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:53,992 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 4343 transitions. [2018-11-10 11:33:53,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4343 transitions. [2018-11-10 11:33:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-10 11:33:53,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:53,996 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-10 11:33:53,996 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:53,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -933870725, now seen corresponding path program 1 times [2018-11-10 11:33:53,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:53,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:54,057 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-10 11:33:54,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:54,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:54,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:54,058 INFO L87 Difference]: Start difference. First operand 3186 states and 4343 transitions. Second operand 3 states. [2018-11-10 11:33:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:54,170 INFO L93 Difference]: Finished difference Result 6668 states and 9122 transitions. [2018-11-10 11:33:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:54,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2018-11-10 11:33:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:54,176 INFO L225 Difference]: With dead ends: 6668 [2018-11-10 11:33:54,176 INFO L226 Difference]: Without dead ends: 3494 [2018-11-10 11:33:54,180 INFO L605 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-10 11:33:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-11-10 11:33:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3478. [2018-11-10 11:33:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3478 states. [2018-11-10 11:33:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4675 transitions. [2018-11-10 11:33:54,250 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4675 transitions. Word has length 277 [2018-11-10 11:33:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:54,250 INFO L481 AbstractCegarLoop]: Abstraction has 3478 states and 4675 transitions. [2018-11-10 11:33:54,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4675 transitions. [2018-11-10 11:33:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-10 11:33:54,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:54,255 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-10 11:33:54,255 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:54,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1451193500, now seen corresponding path program 1 times [2018-11-10 11:33:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:54,312 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-10 11:33:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:54,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:54,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:54,313 INFO L87 Difference]: Start difference. First operand 3478 states and 4675 transitions. Second operand 3 states. [2018-11-10 11:33:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:54,410 INFO L93 Difference]: Finished difference Result 7096 states and 9550 transitions. [2018-11-10 11:33:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:54,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-11-10 11:33:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:54,416 INFO L225 Difference]: With dead ends: 7096 [2018-11-10 11:33:54,416 INFO L226 Difference]: Without dead ends: 3630 [2018-11-10 11:33:54,420 INFO L605 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-10 11:33:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-11-10 11:33:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3614. [2018-11-10 11:33:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2018-11-10 11:33:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4831 transitions. [2018-11-10 11:33:54,461 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4831 transitions. Word has length 302 [2018-11-10 11:33:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:54,461 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 4831 transitions. [2018-11-10 11:33:54,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4831 transitions. [2018-11-10 11:33:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 11:33:54,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:54,466 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-10 11:33:54,466 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:54,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash -701605104, now seen corresponding path program 1 times [2018-11-10 11:33:54,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:54,520 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-10 11:33:54,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:54,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:54,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:54,521 INFO L87 Difference]: Start difference. First operand 3614 states and 4831 transitions. Second operand 3 states. [2018-11-10 11:33:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:54,631 INFO L93 Difference]: Finished difference Result 7624 states and 10326 transitions. [2018-11-10 11:33:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:54,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-10 11:33:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:54,638 INFO L225 Difference]: With dead ends: 7624 [2018-11-10 11:33:54,638 INFO L226 Difference]: Without dead ends: 4022 [2018-11-10 11:33:54,642 INFO L605 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-10 11:33:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2018-11-10 11:33:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3934. [2018-11-10 11:33:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2018-11-10 11:33:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 5207 transitions. [2018-11-10 11:33:54,689 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 5207 transitions. Word has length 313 [2018-11-10 11:33:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:54,689 INFO L481 AbstractCegarLoop]: Abstraction has 3934 states and 5207 transitions. [2018-11-10 11:33:54,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 5207 transitions. [2018-11-10 11:33:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 11:33:54,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:54,694 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-10 11:33:54,694 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:54,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2061615233, now seen corresponding path program 1 times [2018-11-10 11:33:54,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:54,774 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-10 11:33:54,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:54,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:54,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:54,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:54,776 INFO L87 Difference]: Start difference. First operand 3934 states and 5207 transitions. Second operand 3 states. [2018-11-10 11:33:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:54,895 INFO L93 Difference]: Finished difference Result 8272 states and 10886 transitions. [2018-11-10 11:33:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:54,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-10 11:33:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:54,907 INFO L225 Difference]: With dead ends: 8272 [2018-11-10 11:33:54,907 INFO L226 Difference]: Without dead ends: 4350 [2018-11-10 11:33:54,912 INFO L605 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-10 11:33:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2018-11-10 11:33:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4062. [2018-11-10 11:33:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-11-10 11:33:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5359 transitions. [2018-11-10 11:33:54,961 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5359 transitions. Word has length 328 [2018-11-10 11:33:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:54,962 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 5359 transitions. [2018-11-10 11:33:54,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5359 transitions. [2018-11-10 11:33:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-10 11:33:54,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:54,967 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] [2018-11-10 11:33:54,967 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:54,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash -752269920, now seen corresponding path program 1 times [2018-11-10 11:33:54,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:54,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-11-10 11:33:55,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:55,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:55,040 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:55,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:55,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:55,041 INFO L87 Difference]: Start difference. First operand 4062 states and 5359 transitions. Second operand 3 states. [2018-11-10 11:33:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:55,101 INFO L93 Difference]: Finished difference Result 11642 states and 15437 transitions. [2018-11-10 11:33:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-11-10 11:33:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:55,112 INFO L225 Difference]: With dead ends: 11642 [2018-11-10 11:33:55,113 INFO L226 Difference]: Without dead ends: 7592 [2018-11-10 11:33:55,118 INFO L605 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-10 11:33:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2018-11-10 11:33:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 7590. [2018-11-10 11:33:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-10 11:33:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 10069 transitions. [2018-11-10 11:33:55,202 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 10069 transitions. Word has length 329 [2018-11-10 11:33:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:55,203 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 10069 transitions. [2018-11-10 11:33:55,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 10069 transitions. [2018-11-10 11:33:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-10 11:33:55,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:55,210 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-10 11:33:55,210 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:55,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1637112346, now seen corresponding path program 1 times [2018-11-10 11:33:55,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:55,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:55,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:55,288 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-10 11:33:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:33:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:33:55,289 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:55,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:33:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:33:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:33:55,290 INFO L87 Difference]: Start difference. First operand 7590 states and 10069 transitions. Second operand 3 states. [2018-11-10 11:33:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:33:55,444 INFO L93 Difference]: Finished difference Result 15176 states and 20114 transitions. [2018-11-10 11:33:55,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:33:55,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-10 11:33:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:33:55,454 INFO L225 Difference]: With dead ends: 15176 [2018-11-10 11:33:55,454 INFO L226 Difference]: Without dead ends: 7598 [2018-11-10 11:33:55,462 INFO L605 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-10 11:33:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-10 11:33:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-11-10 11:33:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-11-10 11:33:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-11-10 11:33:55,581 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 330 [2018-11-10 11:33:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:33:55,582 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-11-10 11:33:55,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:33:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-11-10 11:33:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-10 11:33:55,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:33:55,589 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-10 11:33:55,589 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:33:55,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1668969407, now seen corresponding path program 1 times [2018-11-10 11:33:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:33:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:33:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:33:55,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:33:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:55,662 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-10 11:33:55,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:33:55,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:33:55,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-10 11:33:55,664 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 11:33:55,700 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:33:55,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:33:56,455 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:33:56,456 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 114 variables. [2018-11-10 11:33:56,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:56,471 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:33:58,378 INFO L227 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 75.81% of their original sizes. [2018-11-10 11:33:58,378 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:33:59,565 INFO L415 sIntCurrentIteration]: We unified 352 AI predicates to 352 [2018-11-10 11:33:59,565 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:33:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:33:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-10 11:33:59,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:33:59,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 11:33:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 11:33:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:33:59,567 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 14 states. [2018-11-10 11:34:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:02,669 INFO L93 Difference]: Finished difference Result 15125 states and 19568 transitions. [2018-11-10 11:34:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:34:02,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 353 [2018-11-10 11:34:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:34:02,676 INFO L225 Difference]: With dead ends: 15125 [2018-11-10 11:34:02,676 INFO L226 Difference]: Without dead ends: 7571 [2018-11-10 11:34:02,684 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 354 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:34:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2018-11-10 11:34:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7570. [2018-11-10 11:34:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-11-10 11:34:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 9793 transitions. [2018-11-10 11:34:02,755 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 9793 transitions. Word has length 353 [2018-11-10 11:34:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:34:02,755 INFO L481 AbstractCegarLoop]: Abstraction has 7570 states and 9793 transitions. [2018-11-10 11:34:02,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 11:34:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 9793 transitions. [2018-11-10 11:34:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-11-10 11:34:02,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:34:02,761 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-10 11:34:02,761 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:34:02,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1483220442, now seen corresponding path program 1 times [2018-11-10 11:34:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:34:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:02,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:02,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:34:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:02,837 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-10 11:34:02,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:34:02,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:34:02,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-11-10 11:34:02,838 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 11:34:02,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:34:02,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:34:03,659 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:35:59,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:35:59,237 INFO L272 AbstractInterpreter]: Visited 112 different actions 3993 times. Merged at 102 different actions 3375 times. Widened at 25 different actions 468 times. Found 488 fixpoints after 35 different actions. Largest state had 116 variables. [2018-11-10 11:35:59,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:59,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:35:59,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:59,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:35:59,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:59,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:35:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:59,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:35:59,402 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-10 11:35:59,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:35:59,466 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-10 11:35:59,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:35:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 11:35:59,486 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:35:59,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:35:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:35:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:35:59,487 INFO L87 Difference]: Start difference. First operand 7570 states and 9793 transitions. Second operand 4 states. [2018-11-10 11:35:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:59,860 INFO L93 Difference]: Finished difference Result 15046 states and 19463 transitions. [2018-11-10 11:35:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:35:59,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2018-11-10 11:35:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:35:59,880 INFO L225 Difference]: With dead ends: 15046 [2018-11-10 11:35:59,880 INFO L226 Difference]: Without dead ends: 11348 [2018-11-10 11:35:59,888 INFO L605 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-10 11:35:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2018-11-10 11:36:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 8698. [2018-11-10 11:36:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8698 states. [2018-11-10 11:36:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 11313 transitions. [2018-11-10 11:36:00,090 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 11313 transitions. Word has length 367 [2018-11-10 11:36:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:00,090 INFO L481 AbstractCegarLoop]: Abstraction has 8698 states and 11313 transitions. [2018-11-10 11:36:00,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:36:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 11313 transitions. [2018-11-10 11:36:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-10 11:36:00,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:00,100 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-10 11:36:00,100 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:00,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1666031329, now seen corresponding path program 2 times [2018-11-10 11:36:00,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:00,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:00,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:00,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:00,216 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-10 11:36:00,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:00,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:00,216 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 11:36:00,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 11:36:00,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:00,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:36:00,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:36:00,229 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 11:36:00,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 11:36:00,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:36:00,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:36:00,374 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-10 11:36:00,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:36:00,448 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-10 11:36:00,474 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:00,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-11-10 11:36:00,474 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:36:00,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:36:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:36:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:36:00,475 INFO L87 Difference]: Start difference. First operand 8698 states and 11313 transitions. Second operand 3 states. [2018-11-10 11:36:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:00,768 INFO L93 Difference]: Finished difference Result 17660 states and 22950 transitions. [2018-11-10 11:36:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:36:00,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-11-10 11:36:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:36:00,780 INFO L225 Difference]: With dead ends: 17660 [2018-11-10 11:36:00,780 INFO L226 Difference]: Without dead ends: 8978 [2018-11-10 11:36:00,792 INFO L605 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-10 11:36:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8978 states. [2018-11-10 11:36:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8978 to 8122. [2018-11-10 11:36:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2018-11-10 11:36:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 10161 transitions. [2018-11-10 11:36:00,922 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 10161 transitions. Word has length 381 [2018-11-10 11:36:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:36:00,922 INFO L481 AbstractCegarLoop]: Abstraction has 8122 states and 10161 transitions. [2018-11-10 11:36:00,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:36:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 10161 transitions. [2018-11-10 11:36:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-10 11:36:00,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:36:00,931 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-10 11:36:00,931 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:36:00,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1287142549, now seen corresponding path program 1 times [2018-11-10 11:36:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:36:00,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:00,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:36:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:00,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:36:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:01,051 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-10 11:36:01,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:01,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:36:01,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-11-10 11:36:01,051 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [276], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 11:36:01,054 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:36:01,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:36:01,706 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:38:05,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:38:05,680 INFO L272 AbstractInterpreter]: Visited 113 different actions 4096 times. Merged at 103 different actions 3441 times. Widened at 25 different actions 469 times. Found 520 fixpoints after 35 different actions. Largest state had 116 variables. [2018-11-10 11:38:05,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:05,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:38:05,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:05,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:38:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:05,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:38:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:05,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:05,830 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-10 11:38:05,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:38:05,891 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-10 11:38:05,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:38:05,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 11:38:05,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:38:05,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:38:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:38:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:38:05,907 INFO L87 Difference]: Start difference. First operand 8122 states and 10161 transitions. Second operand 4 states. [2018-11-10 11:38:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:06,194 INFO L93 Difference]: Finished difference Result 18459 states and 22997 transitions. [2018-11-10 11:38:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:38:06,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-10 11:38:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:06,210 INFO L225 Difference]: With dead ends: 18459 [2018-11-10 11:38:06,210 INFO L226 Difference]: Without dead ends: 10345 [2018-11-10 11:38:06,219 INFO L605 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-10 11:38:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10345 states. [2018-11-10 11:38:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10345 to 8545. [2018-11-10 11:38:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2018-11-10 11:38:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 10665 transitions. [2018-11-10 11:38:06,356 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 10665 transitions. Word has length 396 [2018-11-10 11:38:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:06,356 INFO L481 AbstractCegarLoop]: Abstraction has 8545 states and 10665 transitions. [2018-11-10 11:38:06,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:38:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 10665 transitions. [2018-11-10 11:38:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-10 11:38:06,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:06,364 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-10 11:38:06,364 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:06,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:06,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1461293286, now seen corresponding path program 1 times [2018-11-10 11:38:06,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:06,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:06,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:06,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:06,476 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-10 11:38:06,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:38:06,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:38:06,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:38:06,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:38:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:38:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:38:06,478 INFO L87 Difference]: Start difference. First operand 8545 states and 10665 transitions. Second operand 3 states. [2018-11-10 11:38:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:06,647 INFO L93 Difference]: Finished difference Result 16121 states and 19736 transitions. [2018-11-10 11:38:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:38:06,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-10 11:38:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:38:06,654 INFO L225 Difference]: With dead ends: 16121 [2018-11-10 11:38:06,654 INFO L226 Difference]: Without dead ends: 3939 [2018-11-10 11:38:06,663 INFO L605 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-10 11:38:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2018-11-10 11:38:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3721. [2018-11-10 11:38:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2018-11-10 11:38:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4601 transitions. [2018-11-10 11:38:06,716 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4601 transitions. Word has length 436 [2018-11-10 11:38:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:38:06,716 INFO L481 AbstractCegarLoop]: Abstraction has 3721 states and 4601 transitions. [2018-11-10 11:38:06,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:38:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4601 transitions. [2018-11-10 11:38:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2018-11-10 11:38:06,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:38:06,721 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 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, 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-10 11:38:06,722 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:38:06,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1842796121, now seen corresponding path program 1 times [2018-11-10 11:38:06,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:38:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:06,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:06,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:38:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1671 proven. 15 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2018-11-10 11:38:06,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:06,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:38:06,885 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 522 with the following transitions: [2018-11-10 11:38:06,885 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [287], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 11:38:06,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:38:06,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:38:07,449 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:40:20,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:40:20,571 INFO L272 AbstractInterpreter]: Visited 119 different actions 4372 times. Merged at 104 different actions 3643 times. Widened at 22 different actions 513 times. Found 590 fixpoints after 46 different actions. Largest state had 117 variables. [2018-11-10 11:40:20,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:40:20,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:20,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:40:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:20,582 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:40:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1105 proven. 0 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-10 11:40:20,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:40:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 1105 proven. 0 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-10 11:40:21,071 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:40:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-10 11:40:21,071 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:40:21,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:40:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:40:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:40:21,072 INFO L87 Difference]: Start difference. First operand 3721 states and 4601 transitions. Second operand 3 states. [2018-11-10 11:40:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:21,117 INFO L93 Difference]: Finished difference Result 4170 states and 5123 transitions. [2018-11-10 11:40:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:40:21,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 521 [2018-11-10 11:40:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:40:21,124 INFO L225 Difference]: With dead ends: 4170 [2018-11-10 11:40:21,124 INFO L226 Difference]: Without dead ends: 4090 [2018-11-10 11:40:21,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:40:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2018-11-10 11:40:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3643. [2018-11-10 11:40:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-11-10 11:40:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4505 transitions. [2018-11-10 11:40:21,183 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4505 transitions. Word has length 521 [2018-11-10 11:40:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:40:21,184 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 4505 transitions. [2018-11-10 11:40:21,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:40:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4505 transitions. [2018-11-10 11:40:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-11-10 11:40:21,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:40:21,191 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-10 11:40:21,191 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:40:21,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash -541874184, now seen corresponding path program 1 times [2018-11-10 11:40:21,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:40:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:40:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:21,378 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-10 11:40:21,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:21,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:40:21,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 636 with the following transitions: [2018-11-10 11:40:21,379 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [273], [276], [284], [287], [291], [293], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-11-10 11:40:21,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:40:21,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:40:21,860 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:42:11,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:42:11,446 INFO L272 AbstractInterpreter]: Visited 116 different actions 3760 times. Merged at 104 different actions 3211 times. Widened at 25 different actions 464 times. Found 422 fixpoints after 32 different actions. Largest state had 117 variables. [2018-11-10 11:42:11,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:42:11,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:42:11,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:42:11,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/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-10 11:42:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:42:11,458 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:42:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:42:11,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:42:11,648 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-10 11:42:11,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:42:11,779 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-10 11:42:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:42:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 11:42:11,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:42:11,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:42:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:42:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:42:11,796 INFO L87 Difference]: Start difference. First operand 3643 states and 4505 transitions. Second operand 4 states. [2018-11-10 11:42:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:42:11,903 INFO L93 Difference]: Finished difference Result 4529 states and 5600 transitions. [2018-11-10 11:42:11,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:42:11,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 635 [2018-11-10 11:42:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:42:11,904 INFO L225 Difference]: With dead ends: 4529 [2018-11-10 11:42:11,904 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:42:11,907 INFO L605 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-10 11:42:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:42:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:42:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:42:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:42:11,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 635 [2018-11-10 11:42:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:42:11,908 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:42:11,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:42:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:42:11,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:42:11,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:42:11,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:11,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 11:42:12,506 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 457 DAG size of output: 106 [2018-11-10 11:42:12,613 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-10 11:42:13,422 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2018-11-10 11:42:13,424 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 11:42:13,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:42:13,424 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:42:13,425 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L428 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L421 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0))) [2018-11-10 11:42:13,425 INFO L421 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-10 11:42:13,425 INFO L425 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-11-10 11:42:13,426 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 (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-11-10 11:42:13,426 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__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 563) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L108-2(lines 85 575) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-11-10 11:42:13,426 INFO L428 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-11-10 11:42:13,426 INFO L421 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2))) [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L428 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-11-10 11:42:13,427 INFO L421 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-10 11:42:13,427 INFO L421 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0))) [2018-11-10 11:42:13,427 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L421 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse1 (= ssl3_connect_~s__state~0 4400)) (.cse3 (= ssl3_connect_~s__state~0 4464)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse8 (not .cse2)) (.cse6 (<= ssl3_connect_~s__state~0 4352)) (.cse7 (<= 4352 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse14 (<= 4560 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4560)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= ssl3_connect_~s__state~0 4496)) (.cse10 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse4 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse8) (and .cse9 .cse4 .cse2) (and .cse10 .cse1 .cse4 .cse2) (and .cse3 .cse10 .cse2) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse0 .cse11) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse10 .cse5 .cse2) (and (= ssl3_connect_~s__state~0 4416) .cse4 .cse2) (and .cse11 .cse4 .cse2) (and .cse0 .cse9) (<= ssl3_connect_~blastFlag~0 0) (and (= ssl3_connect_~s__state~0 4432) .cse4 .cse2) (and .cse12 .cse10) (and .cse13 .cse4 .cse2) (and .cse0 .cse14 .cse15 .cse8) (and .cse10 .cse2 .cse16) (and .cse10 .cse6 .cse7 .cse2 .cse17) (and .cse12 .cse0 .cse2) (and .cse10 .cse9 .cse2) (and .cse10 .cse14 .cse2 .cse15 .cse17) (and .cse4 .cse2 .cse16) (and .cse10 .cse13 .cse2) (and .cse10 .cse11 .cse2)))) [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L421 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-11-10 11:42:13,428 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 (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-11-10 11:42:13,428 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L421 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-11-10 11:42:13,429 INFO L425 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L421 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-11-10 11:42:13,430 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-11-10 11:42:13,430 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L421 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-11-10 11:42:13,431 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L421 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-11-10 11:42:13,432 INFO L425 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L421 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-10 11:42:13,433 INFO L421 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (not (= |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-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-11-10 11:42:13,433 INFO L425 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-11-10 11:42:13,434 INFO L421 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (= main_~s~0 12292) [2018-11-10 11:42:13,434 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-10 11:42:13,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:42:13 BoogieIcfgContainer [2018-11-10 11:42:13,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:42:13,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:42:13,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:42:13,467 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:42:13,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:51" (3/4) ... [2018-11-10 11:42:13,470 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:42:13,487 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:42:13,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 11:42:13,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:42:13,495 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 11:42:13,496 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 11:42:13,496 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || blastFlag <= 0 [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) [2018-11-10 11:42:13,516 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) [2018-11-10 11:42:13,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 11:42:13,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-11-10 11:42:13,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-10 11:42:13,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 11:42:13,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) [2018-11-10 11:42:13,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) [2018-11-10 11:42:13,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-10 11:42:13,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) [2018-11-10 11:42:13,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(initial_state) == 12292) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) [2018-11-10 11:42:13,565 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_26360e6f-47af-4a97-9ffa-c061cf0b5bbb/bin-2019/utaipan/witness.graphml [2018-11-10 11:42:13,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:42:13,566 INFO L168 Benchmark]: Toolchain (without parser) took 503005.92 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 959.2 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 319.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,566 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:42:13,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,567 INFO L168 Benchmark]: Boogie Preprocessor took 29.81 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-10 11:42:13,570 INFO L168 Benchmark]: RCFGBuilder took 449.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,571 INFO L168 Benchmark]: TraceAbstraction took 502126.63 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,571 INFO L168 Benchmark]: Witness Printer took 98.53 ms. Allocated memory is still 5.4 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 4.2 kB). Peak memory consumption was 4.2 kB. Max. memory is 11.5 GB. [2018-11-10 11:42:13,572 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -205.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.81 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 449.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 502126.63 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 98.53 ms. Allocated memory is still 5.4 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 4.2 kB). Peak memory consumption was 4.2 kB. 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: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((!(\old(initial_state) == 12292) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___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: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 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, 502.0s OverallTime, 27 OverallIterations, 21 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 5636 SDtfs, 1934 SDslu, 3555 SDs, 0 SdLazy, 2787 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 5038 GetRequests, 4981 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8698occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 485.6s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9948913476874008 AbsIntWeakeningRatio, 0.4460227272727273 AbsIntAvgWeakeningVarsNumRemoved, 411.65340909090907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 6572 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 27745 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3389 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 9184 NumberOfCodeBlocks, 8905 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 11447 ConstructedInterpolants, 0 QuantifiedInterpolants, 6733523 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3737 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 37 InterpolantComputations, 25 PerfectInterpolantSequences, 50952/51088 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...