./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-635dfa2 [2018-12-02 05:41:20,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:41:20,304 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:41:20,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:41:20,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:41:20,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:41:20,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:41:20,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:41:20,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:41:20,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:41:20,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:41:20,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:41:20,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:41:20,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:41:20,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:41:20,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:41:20,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:41:20,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:41:20,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:41:20,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:41:20,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:41:20,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:41:20,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:41:20,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:41:20,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:41:20,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:41:20,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:41:20,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:41:20,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:41:20,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:41:20,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:41:20,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:41:20,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:41:20,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:41:20,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:41:20,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:41:20,326 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:41:20,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:41:20,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:41:20,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:41:20,334 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:41:20,334 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:41:20,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:41:20,334 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:41:20,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:41:20,335 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:41:20,335 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:41:20,335 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:41:20,335 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:41:20,335 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:41:20,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:41:20,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:41:20,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:41:20,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:41:20,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:41:20,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:41:20,338 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_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:20,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:41:20,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:41:20,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:41:20,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:41:20,366 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:41:20,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-02 05:41:20,403 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/data/6a61b6fb8/56c2d92b809346fcb898832f624364c0/FLAGa161690e6 [2018-12-02 05:41:20,872 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:41:20,872 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-02 05:41:20,877 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/data/6a61b6fb8/56c2d92b809346fcb898832f624364c0/FLAGa161690e6 [2018-12-02 05:41:20,886 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/data/6a61b6fb8/56c2d92b809346fcb898832f624364c0 [2018-12-02 05:41:20,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:41:20,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:41:20,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:41:20,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:41:20,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:41:20,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:20" (1/1) ... [2018-12-02 05:41:20,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:20, skipping insertion in model container [2018-12-02 05:41:20,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:41:20" (1/1) ... [2018-12-02 05:41:20,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:41:20,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:41:21,029 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:41:21,031 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:41:21,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:41:21,100 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:41:21,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21 WrapperNode [2018-12-02 05:41:21,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:41:21,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:41:21,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:41:21,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:41:21,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:41:21,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:41:21,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:41:21,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:41:21,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... [2018-12-02 05:41:21,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:41:21,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:41:21,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:41:21,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:41:21,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:41:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:41:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-02 05:41:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-02 05:41:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:41:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:41:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:41:21,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:41:21,248 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:41:21,249 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:41:21,477 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:41:21,477 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 05:41:21,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:21 BoogieIcfgContainer [2018-12-02 05:41:21,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:41:21,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:41:21,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:41:21,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:41:21,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:41:20" (1/3) ... [2018-12-02 05:41:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ae5657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:21, skipping insertion in model container [2018-12-02 05:41:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:41:21" (2/3) ... [2018-12-02 05:41:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ae5657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:41:21, skipping insertion in model container [2018-12-02 05:41:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:21" (3/3) ... [2018-12-02 05:41:21,483 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-12-02 05:41:21,492 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:41:21,498 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:41:21,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:41:21,535 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:41:21,535 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:41:21,536 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:41:21,536 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:41:21,536 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:41:21,536 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:41:21,536 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:41:21,536 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:41:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-02 05:41:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:41:21,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:21,554 INFO L402 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] [2018-12-02 05:41:21,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:21,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:21,559 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-02 05:41:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:41:21,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:21,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:21,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:21,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:21,714 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-02 05:41:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:21,776 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-02 05:41:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:21,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 05:41:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:21,787 INFO L225 Difference]: With dead ends: 377 [2018-12-02 05:41:21,787 INFO L226 Difference]: Without dead ends: 220 [2018-12-02 05:41:21,789 INFO L631 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-12-02 05:41:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-02 05:41:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-02 05:41:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-02 05:41:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-02 05:41:21,820 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-02 05:41:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-02 05:41:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-02 05:41:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:41:21,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:21,822 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:21,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-12-02 05:41:21,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:21,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:21,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:41:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:21,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:21,864 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-02 05:41:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:21,953 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-02 05:41:21,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:21,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-02 05:41:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:21,955 INFO L225 Difference]: With dead ends: 472 [2018-12-02 05:41:21,955 INFO L226 Difference]: Without dead ends: 264 [2018-12-02 05:41:21,956 INFO L631 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-12-02 05:41:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-02 05:41:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-12-02 05:41:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-02 05:41:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-02 05:41:21,969 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-02 05:41:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:21,970 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-02 05:41:21,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-02 05:41:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:41:21,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:21,972 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:21,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:21,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2018-12-02 05:41:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:21,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:41:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,015 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-02 05:41:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,135 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-02 05:41:22,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 05:41:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,136 INFO L225 Difference]: With dead ends: 598 [2018-12-02 05:41:22,136 INFO L226 Difference]: Without dead ends: 354 [2018-12-02 05:41:22,137 INFO L631 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-12-02 05:41:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-02 05:41:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-02 05:41:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-02 05:41:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-02 05:41:22,146 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-02 05:41:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,146 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-02 05:41:22,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-02 05:41:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:41:22,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,148 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,148 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,148 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2018-12-02 05:41:22,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:41:22,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,177 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-02 05:41:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,249 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-12-02 05:41:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 05:41:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,250 INFO L225 Difference]: With dead ends: 708 [2018-12-02 05:41:22,250 INFO L226 Difference]: Without dead ends: 384 [2018-12-02 05:41:22,251 INFO L631 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-12-02 05:41:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-12-02 05:41:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-12-02 05:41:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-02 05:41:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-02 05:41:22,259 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-02 05:41:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,259 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-02 05:41:22,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-02 05:41:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:41:22,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,260 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,261 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2018-12-02 05:41:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 05:41:22,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,289 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-02 05:41:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,389 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-02 05:41:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-02 05:41:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,390 INFO L225 Difference]: With dead ends: 842 [2018-12-02 05:41:22,390 INFO L226 Difference]: Without dead ends: 478 [2018-12-02 05:41:22,391 INFO L631 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-12-02 05:41:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-02 05:41:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-02 05:41:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-02 05:41:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-02 05:41:22,403 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-02 05:41:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,403 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-02 05:41:22,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-02 05:41:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 05:41:22,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,405 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2018-12-02 05:41:22,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 05:41:22,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,440 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-02 05:41:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,513 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-02 05:41:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-02 05:41:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,516 INFO L225 Difference]: With dead ends: 940 [2018-12-02 05:41:22,516 INFO L226 Difference]: Without dead ends: 500 [2018-12-02 05:41:22,517 INFO L631 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-12-02 05:41:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-02 05:41:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-02 05:41:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-02 05:41:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-02 05:41:22,531 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-02 05:41:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,532 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-02 05:41:22,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-02 05:41:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 05:41:22,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,534 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2018-12-02 05:41:22,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 05:41:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,575 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-02 05:41:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,604 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-02 05:41:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-02 05:41:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,607 INFO L225 Difference]: With dead ends: 976 [2018-12-02 05:41:22,607 INFO L226 Difference]: Without dead ends: 734 [2018-12-02 05:41:22,608 INFO L631 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-12-02 05:41:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-02 05:41:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-02 05:41:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-02 05:41:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-02 05:41:22,626 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-02 05:41:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,626 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-02 05:41:22,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-02 05:41:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:41:22,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,628 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,628 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2018-12-02 05:41:22,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 05:41:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,680 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-02 05:41:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,702 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-02 05:41:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-02 05:41:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,704 INFO L225 Difference]: With dead ends: 976 [2018-12-02 05:41:22,705 INFO L226 Difference]: Without dead ends: 974 [2018-12-02 05:41:22,705 INFO L631 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-12-02 05:41:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-02 05:41:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-02 05:41:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-02 05:41:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-02 05:41:22,718 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-02 05:41:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,719 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-02 05:41:22,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-02 05:41:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 05:41:22,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,721 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,721 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2018-12-02 05:41:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-02 05:41:22,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,747 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-02 05:41:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,852 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-02 05:41:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-12-02 05:41:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:22,856 INFO L225 Difference]: With dead ends: 2140 [2018-12-02 05:41:22,856 INFO L226 Difference]: Without dead ends: 1170 [2018-12-02 05:41:22,858 INFO L631 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-12-02 05:41:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-02 05:41:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-02 05:41:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-02 05:41:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-02 05:41:22,874 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2018-12-02 05:41:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:22,875 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-02 05:41:22,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-02 05:41:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-02 05:41:22,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:22,877 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:22,877 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:22,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2018-12-02 05:41:22,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:22,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-02 05:41:22,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:22,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:22,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:22,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:22,915 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-02 05:41:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:22,998 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-02 05:41:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:22,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-12-02 05:41:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,001 INFO L225 Difference]: With dead ends: 2354 [2018-12-02 05:41:23,001 INFO L226 Difference]: Without dead ends: 1236 [2018-12-02 05:41:23,003 INFO L631 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-12-02 05:41:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-02 05:41:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-02 05:41:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-02 05:41:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-02 05:41:23,019 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2018-12-02 05:41:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,019 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-02 05:41:23,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-02 05:41:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 05:41:23,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,021 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,022 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2018-12-02 05:41:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-02 05:41:23,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,070 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-02 05:41:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:23,169 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-02 05:41:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:23,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-02 05:41:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,172 INFO L225 Difference]: With dead ends: 2544 [2018-12-02 05:41:23,172 INFO L226 Difference]: Without dead ends: 1334 [2018-12-02 05:41:23,174 INFO L631 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-12-02 05:41:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-02 05:41:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-02 05:41:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-02 05:41:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-02 05:41:23,191 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2018-12-02 05:41:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,191 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-02 05:41:23,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-02 05:41:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-02 05:41:23,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,193 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,193 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2018-12-02 05:41:23,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 05:41:23,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,246 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-02 05:41:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:23,340 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-02 05:41:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:23,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-02 05:41:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,344 INFO L225 Difference]: With dead ends: 2752 [2018-12-02 05:41:23,344 INFO L226 Difference]: Without dead ends: 1442 [2018-12-02 05:41:23,345 INFO L631 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-12-02 05:41:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-02 05:41:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-02 05:41:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-02 05:41:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-02 05:41:23,369 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2018-12-02 05:41:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,369 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-02 05:41:23,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-02 05:41:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-02 05:41:23,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,372 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2018-12-02 05:41:23,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 05:41:23,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,422 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-02 05:41:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:23,513 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-02 05:41:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:23,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-02 05:41:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,516 INFO L225 Difference]: With dead ends: 2992 [2018-12-02 05:41:23,516 INFO L226 Difference]: Without dead ends: 1570 [2018-12-02 05:41:23,518 INFO L631 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-12-02 05:41:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-02 05:41:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-02 05:41:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-02 05:41:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-02 05:41:23,537 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2018-12-02 05:41:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,537 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-02 05:41:23,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-02 05:41:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 05:41:23,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,540 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,540 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2018-12-02 05:41:23,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-12-02 05:41:23,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,580 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-02 05:41:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:23,609 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-02 05:41:23,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:23,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-12-02 05:41:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,618 INFO L225 Difference]: With dead ends: 4646 [2018-12-02 05:41:23,619 INFO L226 Difference]: Without dead ends: 3100 [2018-12-02 05:41:23,621 INFO L631 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-12-02 05:41:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-02 05:41:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-02 05:41:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-02 05:41:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-02 05:41:23,659 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2018-12-02 05:41:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,659 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-02 05:41:23,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-02 05:41:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 05:41:23,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,663 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,663 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2018-12-02 05:41:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-12-02 05:41:23,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,715 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-02 05:41:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:23,812 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-02 05:41:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:23,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-12-02 05:41:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:23,821 INFO L225 Difference]: With dead ends: 6484 [2018-12-02 05:41:23,821 INFO L226 Difference]: Without dead ends: 3398 [2018-12-02 05:41:23,825 INFO L631 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-12-02 05:41:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-02 05:41:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-02 05:41:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-02 05:41:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-02 05:41:23,877 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2018-12-02 05:41:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:23,877 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-02 05:41:23,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-02 05:41:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-02 05:41:23,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:23,881 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:23,881 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:23,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2018-12-02 05:41:23,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:23,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-12-02 05:41:23,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:23,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:23,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:23,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:23,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:23,955 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-02 05:41:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:24,057 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-02 05:41:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:24,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-12-02 05:41:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:24,063 INFO L225 Difference]: With dead ends: 6900 [2018-12-02 05:41:24,063 INFO L226 Difference]: Without dead ends: 3530 [2018-12-02 05:41:24,066 INFO L631 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-12-02 05:41:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-02 05:41:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-02 05:41:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-02 05:41:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-02 05:41:24,108 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2018-12-02 05:41:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:24,108 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-02 05:41:24,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-02 05:41:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-02 05:41:24,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:24,113 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:24,113 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:24,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2018-12-02 05:41:24,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:24,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:24,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-02 05:41:24,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:24,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:24,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:24,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:24,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:24,160 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-02 05:41:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:24,276 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-02 05:41:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:24,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-02 05:41:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:24,283 INFO L225 Difference]: With dead ends: 7416 [2018-12-02 05:41:24,283 INFO L226 Difference]: Without dead ends: 3914 [2018-12-02 05:41:24,286 INFO L631 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-12-02 05:41:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-02 05:41:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-02 05:41:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-02 05:41:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-02 05:41:24,329 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2018-12-02 05:41:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:24,329 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-02 05:41:24,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-02 05:41:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-02 05:41:24,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:24,332 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:24,333 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2018-12-02 05:41:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-12-02 05:41:24,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:24,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:24,380 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-02 05:41:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:24,507 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-02 05:41:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:24,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-12-02 05:41:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:24,514 INFO L225 Difference]: With dead ends: 8048 [2018-12-02 05:41:24,514 INFO L226 Difference]: Without dead ends: 4234 [2018-12-02 05:41:24,516 INFO L631 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-12-02 05:41:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-02 05:41:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-02 05:41:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-02 05:41:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-02 05:41:24,556 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2018-12-02 05:41:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:24,556 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-02 05:41:24,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-02 05:41:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-02 05:41:24,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:24,560 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:24,560 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:24,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2018-12-02 05:41:24,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-12-02 05:41:24,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:24,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:24,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:24,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:24,624 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-02 05:41:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:24,674 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-02 05:41:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:24,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-12-02 05:41:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:24,684 INFO L225 Difference]: With dead ends: 11310 [2018-12-02 05:41:24,684 INFO L226 Difference]: Without dead ends: 7376 [2018-12-02 05:41:24,688 INFO L631 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-12-02 05:41:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-02 05:41:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-02 05:41:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-02 05:41:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-02 05:41:24,760 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2018-12-02 05:41:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:24,761 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-02 05:41:24,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-02 05:41:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-12-02 05:41:24,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:24,766 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:24,766 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:24,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2018-12-02 05:41:24,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:24,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-12-02 05:41:24,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:24,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:24,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:24,819 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-02 05:41:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:24,934 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-02 05:41:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:24,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-12-02 05:41:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:24,942 INFO L225 Difference]: With dead ends: 14744 [2018-12-02 05:41:24,942 INFO L226 Difference]: Without dead ends: 7382 [2018-12-02 05:41:24,948 INFO L631 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-12-02 05:41:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-02 05:41:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-02 05:41:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-02 05:41:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-02 05:41:25,029 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2018-12-02 05:41:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:25,030 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-02 05:41:25,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-02 05:41:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-02 05:41:25,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:25,036 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:25,036 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:25,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2018-12-02 05:41:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:25,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-02 05:41:25,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:25,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:25,161 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-12-02 05:41:25,162 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-02 05:41:25,186 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:41:25,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:41:25,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:41:25,604 INFO L272 AbstractInterpreter]: Visited 102 different actions 310 times. Merged at 84 different actions 180 times. Widened at 1 different actions 1 times. Performed 1641 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 16 different actions. Largest state had 114 variables. [2018-12-02 05:41:25,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:25,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:41:25,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:25,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:25,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:25,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:41:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:25,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-12-02 05:41:25,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-12-02 05:41:25,853 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:41:25,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-12-02 05:41:25,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:25,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:41:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:41:25,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:41:25,854 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2018-12-02 05:41:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:26,081 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2018-12-02 05:41:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:41:26,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2018-12-02 05:41:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:26,089 INFO L225 Difference]: With dead ends: 14866 [2018-12-02 05:41:26,089 INFO L226 Difference]: Without dead ends: 7500 [2018-12-02 05:41:26,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:41:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2018-12-02 05:41:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2018-12-02 05:41:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2018-12-02 05:41:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2018-12-02 05:41:26,191 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 339 [2018-12-02 05:41:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:26,191 INFO L480 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2018-12-02 05:41:26,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:41:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2018-12-02 05:41:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-02 05:41:26,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:26,196 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:26,196 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:26,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash 998396082, now seen corresponding path program 1 times [2018-12-02 05:41:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:26,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-02 05:41:26,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:26,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:26,272 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-12-02 05:41:26,272 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-02 05:41:26,274 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:41:26,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:41:26,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:41:26,542 INFO L272 AbstractInterpreter]: Visited 111 different actions 332 times. Merged at 92 different actions 190 times. Widened at 1 different actions 1 times. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 17 different actions. Largest state had 116 variables. [2018-12-02 05:41:26,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:26,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:41:26,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:26,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:26,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:26,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:41:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:26,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-02 05:41:26,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-02 05:41:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:41:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 05:41:26,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:41:26,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:41:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:41:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:41:26,790 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2018-12-02 05:41:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:27,067 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2018-12-02 05:41:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:41:27,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-12-02 05:41:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:27,079 INFO L225 Difference]: With dead ends: 14624 [2018-12-02 05:41:27,079 INFO L226 Difference]: Without dead ends: 11034 [2018-12-02 05:41:27,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 704 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-12-02 05:41:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-02 05:41:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-02 05:41:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-02 05:41:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-02 05:41:27,194 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 352 [2018-12-02 05:41:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:27,195 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-02 05:41:27,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:41:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-02 05:41:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-12-02 05:41:27,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:27,200 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:27,201 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:27,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 2 times [2018-12-02 05:41:27,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:27,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:27,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-12-02 05:41:27,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:27,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:27,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 05:41:27,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 05:41:27,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:27,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:27,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:41:27,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 05:41:27,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 05:41:27,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:41:27,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-02 05:41:27,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-02 05:41:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:41:27,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 05:41:27,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:27,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:41:27,425 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2018-12-02 05:41:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:27,532 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2018-12-02 05:41:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:27,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-12-02 05:41:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:27,540 INFO L225 Difference]: With dead ends: 16374 [2018-12-02 05:41:27,540 INFO L226 Difference]: Without dead ends: 7932 [2018-12-02 05:41:27,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:41:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2018-12-02 05:41:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2018-12-02 05:41:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2018-12-02 05:41:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2018-12-02 05:41:27,618 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 365 [2018-12-02 05:41:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:27,618 INFO L480 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2018-12-02 05:41:27,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2018-12-02 05:41:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-12-02 05:41:27,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:27,622 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:27,622 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:27,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash 776946245, now seen corresponding path program 1 times [2018-12-02 05:41:27,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:27,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:41:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:27,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-02 05:41:27,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:27,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:27,737 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2018-12-02 05:41:27,737 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-02 05:41:27,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:41:27,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:41:27,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:41:27,992 INFO L272 AbstractInterpreter]: Visited 112 different actions 341 times. Merged at 95 different actions 196 times. Widened at 3 different actions 3 times. Performed 1834 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1834 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 42 fixpoints after 19 different actions. Largest state had 116 variables. [2018-12-02 05:41:27,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:27,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:41:27,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:27,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:28,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:41:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:28,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-02 05:41:28,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-02 05:41:28,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:41:28,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 05:41:28,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:41:28,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:41:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:41:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:41:28,181 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 4 states. [2018-12-02 05:41:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:28,383 INFO L93 Difference]: Finished difference Result 17152 states and 21441 transitions. [2018-12-02 05:41:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:41:28,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-12-02 05:41:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:28,392 INFO L225 Difference]: With dead ends: 17152 [2018-12-02 05:41:28,392 INFO L226 Difference]: Without dead ends: 9478 [2018-12-02 05:41:28,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 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-12-02 05:41:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2018-12-02 05:41:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7985. [2018-12-02 05:41:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2018-12-02 05:41:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2018-12-02 05:41:28,485 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 379 [2018-12-02 05:41:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:28,485 INFO L480 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2018-12-02 05:41:28,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:41:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2018-12-02 05:41:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-02 05:41:28,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:28,490 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:28,491 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2018-12-02 05:41:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:28,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-02 05:41:28,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:41:28,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:41:28,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:41:28,601 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2018-12-02 05:41:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:28,736 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2018-12-02 05:41:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:28,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-12-02 05:41:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:28,741 INFO L225 Difference]: With dead ends: 15351 [2018-12-02 05:41:28,741 INFO L226 Difference]: Without dead ends: 3759 [2018-12-02 05:41:28,748 INFO L631 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-12-02 05:41:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-12-02 05:41:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2018-12-02 05:41:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2018-12-02 05:41:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2018-12-02 05:41:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2018-12-02 05:41:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:28,788 INFO L480 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2018-12-02 05:41:28,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2018-12-02 05:41:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-12-02 05:41:28,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:28,816 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:28,816 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:28,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2018-12-02 05:41:28,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:28,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:28,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:28,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:28,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-12-02 05:41:28,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:28,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:28,917 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 503 with the following transitions: [2018-12-02 05:41:28,917 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [283], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-02 05:41:28,919 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:41:28,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:41:29,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:41:29,190 INFO L272 AbstractInterpreter]: Visited 118 different actions 420 times. Merged at 95 different actions 254 times. Widened at 2 different actions 2 times. Performed 2141 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 57 fixpoints after 33 different actions. Largest state had 117 variables. [2018-12-02 05:41:29,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:29,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:41:29,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:29,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/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-12-02 05:41:29,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:29,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:41:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:29,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-12-02 05:41:29,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-12-02 05:41:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:41:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 05:41:29,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:41:29,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:41:29,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:41:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:41:29,519 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 3 states. [2018-12-02 05:41:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:29,537 INFO L93 Difference]: Finished difference Result 3600 states and 4449 transitions. [2018-12-02 05:41:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:41:29,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2018-12-02 05:41:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:29,540 INFO L225 Difference]: With dead ends: 3600 [2018-12-02 05:41:29,540 INFO L226 Difference]: Without dead ends: 3523 [2018-12-02 05:41:29,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 1004 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-12-02 05:41:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2018-12-02 05:41:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3449. [2018-12-02 05:41:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-12-02 05:41:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4260 transitions. [2018-12-02 05:41:29,568 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4260 transitions. Word has length 502 [2018-12-02 05:41:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:29,569 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4260 transitions. [2018-12-02 05:41:29,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:41:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4260 transitions. [2018-12-02 05:41:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2018-12-02 05:41:29,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:41:29,573 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 05:41:29,573 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:41:29,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:29,573 INFO L82 PathProgramCache]: Analyzing trace with hash -234514290, now seen corresponding path program 1 times [2018-12-02 05:41:29,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:41:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:29,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:41:29,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:41:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-12-02 05:41:29,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:29,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:41:29,699 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 615 with the following transitions: [2018-12-02 05:41:29,699 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [283], [287], [289], [294], [297], [305], [307], [309], [312], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-02 05:41:29,700 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:41:29,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:41:29,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:41:29,903 INFO L272 AbstractInterpreter]: Visited 115 different actions 338 times. Merged at 95 different actions 194 times. Widened at 1 different actions 1 times. Performed 1791 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1791 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 37 fixpoints after 17 different actions. Largest state had 117 variables. [2018-12-02 05:41:29,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:41:29,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:41:29,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:41:29,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:41:29,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:41:29,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:41:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:41:30,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:41:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-12-02 05:41:30,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:41:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-12-02 05:41:30,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:41:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 05:41:30,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:41:30,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:41:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:41:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:41:30,313 INFO L87 Difference]: Start difference. First operand 3449 states and 4260 transitions. Second operand 4 states. [2018-12-02 05:41:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:41:30,391 INFO L93 Difference]: Finished difference Result 3947 states and 4887 transitions. [2018-12-02 05:41:30,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:41:30,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 614 [2018-12-02 05:41:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:41:30,392 INFO L225 Difference]: With dead ends: 3947 [2018-12-02 05:41:30,392 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 05:41:30,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1228 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-12-02 05:41:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 05:41:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 05:41:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 05:41:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 05:41:30,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2018-12-02 05:41:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:41:30,396 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:41:30,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:41:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:41:30,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 05:41:30,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 05:41:30,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 05:41:30,676 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 104 [2018-12-02 05:41:31,328 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-12-02 05:41:31,330 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L451 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-12-02 05:41:31,330 INFO L444 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-12-02 05:41:31,330 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-12-02 05:41:31,331 INFO L444 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2))) [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2018-12-02 05:41:31,331 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L451 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-12-02 05:41:31,332 INFO L444 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L451 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 523) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-02 05:41:31,332 INFO L444 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L444 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (and .cse7 .cse15 .cse1)))) [2018-12-02 05:41:31,332 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-12-02 05:41:31,332 INFO L444 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L444 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L444 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-12-02 05:41:31,333 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 521) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-02 05:41:31,333 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L444 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 519) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-12-02 05:41:31,334 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L444 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-12-02 05:41:31,335 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 517) 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 (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-12-02 05:41:31,335 INFO L444 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-12-02 05:41:31,335 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 05:41:31,336 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-12-02 05:41:31,336 INFO L444 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-02 05:41:31,336 INFO L448 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-12-02 05:41:31,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:41:31 BoogieIcfgContainer [2018-12-02 05:41:31,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:41:31,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:41:31,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:41:31,355 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:41:31,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:41:21" (3/4) ... [2018-12-02 05:41:31,359 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 05:41:31,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 05:41:31,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-02 05:41:31,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 05:41:31,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 05:41:31,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 05:41:31,372 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 05:41:31,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-02 05:41:31,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((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) [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((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)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((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 <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((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 == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-12-02 05:41:31,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((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)) [2018-12-02 05:41:31,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-12-02 05:41:31,431 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98a693f2-f314-439d-a0f4-d2c7f70db0a7/bin-2019/utaipan/witness.graphml [2018-12-02 05:41:31,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:41:31,432 INFO L168 Benchmark]: Toolchain (without parser) took 10543.92 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -348.8 MB). Peak memory consumption was 963.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,432 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:41:31,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.37 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,433 INFO L168 Benchmark]: Boogie Preprocessor took 25.15 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-12-02 05:41:31,433 INFO L168 Benchmark]: RCFGBuilder took 335.01 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,433 INFO L168 Benchmark]: TraceAbstraction took 9876.86 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -264.0 MB). Peak memory consumption was 920.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,433 INFO L168 Benchmark]: Witness Printer took 76.02 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:41:31,434 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.37 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.15 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 335.01 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9876.86 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -264.0 MB). Peak memory consumption was 920.9 MB. Max. memory is 11.5 GB. * Witness Printer took 76.02 ms. Allocated memory is still 2.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((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) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 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 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((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)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((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 <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((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 == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((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, 138 locations, 1 error locations. SAFE Result, 9.8s OverallTime, 27 OverallIterations, 21 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5438 SDtfs, 1928 SDslu, 3156 SDs, 0 SdLazy, 2637 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5190 GetRequests, 5139 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 5368 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 691 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21514 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2304 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 9147 NumberOfCodeBlocks, 8892 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 11659 ConstructedInterpolants, 0 QuantifiedInterpolants, 6471569 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4347 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 39 InterpolantComputations, 27 PerfectInterpolantSequences, 50371/50495 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...