./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.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_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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 aa0b6fb4ce9f792dd8bac4a989726983813b4bce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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 aa0b6fb4ce9f792dd8bac4a989726983813b4bce ............................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:25:18,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:25:18,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:25:18,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:25:18,638 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:25:18,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:25:18,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:25:18,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:25:18,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:25:18,641 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:25:18,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:25:18,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:25:18,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:25:18,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:25:18,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:25:18,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:25:18,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:25:18,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:25:18,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:25:18,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:25:18,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:25:18,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:25:18,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:25:18,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:25:18,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:25:18,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:25:18,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:25:18,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:25:18,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:25:18,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:25:18,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:25:18,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:25:18,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:25:18,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:25:18,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:25:18,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:25:18,653 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:25:18,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:25:18,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:25:18,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:25:18,660 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:25:18,661 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:25:18,661 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:25:18,662 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:25:18,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:25:18,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:25:18,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:25:18,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:25:18,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:25:18,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:25:18,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:25:18,664 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:25:18,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:25:18,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:25:18,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:25:18,665 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_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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 -> aa0b6fb4ce9f792dd8bac4a989726983813b4bce [2018-12-08 17:25:18,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:25:18,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:25:18,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:25:18,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:25:18,696 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:25:18,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c [2018-12-08 17:25:18,734 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/94680cb8b/1dd419ce617247bb85af5e28f815db08/FLAG0560a328b [2018-12-08 17:25:19,080 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:25:19,080 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c [2018-12-08 17:25:19,089 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/94680cb8b/1dd419ce617247bb85af5e28f815db08/FLAG0560a328b [2018-12-08 17:25:19,100 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/94680cb8b/1dd419ce617247bb85af5e28f815db08 [2018-12-08 17:25:19,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:25:19,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:25:19,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:25:19,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:25:19,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:25:19,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19, skipping insertion in model container [2018-12-08 17:25:19,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:25:19,139 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:25:19,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:25:19,379 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:25:19,431 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:25:19,442 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:25:19,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19 WrapperNode [2018-12-08 17:25:19,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:25:19,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:25:19,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:25:19,443 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:25:19,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:25:19,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:25:19,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:25:19,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:25:19,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... [2018-12-08 17:25:19,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:25:19,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:25:19,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:25:19,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:25:19,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 17:25:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:25:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:25:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:25:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-08 17:25:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-08 17:25:19,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:25:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:25:19,733 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 17:25:19,733 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 17:25:20,099 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:25:20,099 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 17:25:20,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:25:20 BoogieIcfgContainer [2018-12-08 17:25:20,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:25:20,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:25:20,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:25:20,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:25:20,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:25:19" (1/3) ... [2018-12-08 17:25:20,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5270d826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:25:20, skipping insertion in model container [2018-12-08 17:25:20,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:19" (2/3) ... [2018-12-08 17:25:20,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5270d826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:25:20, skipping insertion in model container [2018-12-08 17:25:20,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:25:20" (3/3) ... [2018-12-08 17:25:20,104 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04_true-unreach-call.i.cil.c [2018-12-08 17:25:20,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:25:20,114 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:25:20,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:25:20,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:25:20,141 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:25:20,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:25:20,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:25:20,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:25:20,141 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:25:20,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:25:20,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:25:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-12-08 17:25:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 17:25:20,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:20,157 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, 1] [2018-12-08 17:25:20,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:20,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 500880985, now seen corresponding path program 1 times [2018-12-08 17:25:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:20,316 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-08 17:25:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:25:20,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:20,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:25:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:25:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:25:20,331 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2018-12-08 17:25:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:20,393 INFO L93 Difference]: Finished difference Result 379 states and 634 transitions. [2018-12-08 17:25:20,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:25:20,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 17:25:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:20,403 INFO L225 Difference]: With dead ends: 379 [2018-12-08 17:25:20,403 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 17:25:20,405 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-08 17:25:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 17:25:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-08 17:25:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-08 17:25:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2018-12-08 17:25:20,440 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2018-12-08 17:25:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:20,440 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2018-12-08 17:25:20,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:25:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2018-12-08 17:25:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:25:20,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:20,442 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, 1, 1] [2018-12-08 17:25:20,442 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:20,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1966298573, now seen corresponding path program 1 times [2018-12-08 17:25:20,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:20,512 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-08 17:25:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:20,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:25:20,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:20,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:25:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:25:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:25:20,515 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2018-12-08 17:25:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:20,545 INFO L93 Difference]: Finished difference Result 424 states and 634 transitions. [2018-12-08 17:25:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:25:20,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 17:25:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:20,547 INFO L225 Difference]: With dead ends: 424 [2018-12-08 17:25:20,547 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 17:25:20,548 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-08 17:25:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 17:25:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-12-08 17:25:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-08 17:25:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2018-12-08 17:25:20,561 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2018-12-08 17:25:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:20,561 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2018-12-08 17:25:20,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:25:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2018-12-08 17:25:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:25:20,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:20,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:25:20,563 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:20,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 207210029, now seen corresponding path program 1 times [2018-12-08 17:25:20,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:20,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:20,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:20,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:20,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:20,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:20,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:20,639 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2018-12-08 17:25:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:20,953 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2018-12-08 17:25:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:20,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 17:25:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:20,956 INFO L225 Difference]: With dead ends: 811 [2018-12-08 17:25:20,956 INFO L226 Difference]: Without dead ends: 505 [2018-12-08 17:25:20,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-08 17:25:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2018-12-08 17:25:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 17:25:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2018-12-08 17:25:20,977 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2018-12-08 17:25:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:20,977 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2018-12-08 17:25:20,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2018-12-08 17:25:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:25:20,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:20,980 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:25:20,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:20,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:20,980 INFO L82 PathProgramCache]: Analyzing trace with hash 73196523, now seen corresponding path program 1 times [2018-12-08 17:25:20,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:20,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:21,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:21,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:21,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:21,058 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2018-12-08 17:25:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:21,257 INFO L93 Difference]: Finished difference Result 811 states and 1223 transitions. [2018-12-08 17:25:21,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:21,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 17:25:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:21,260 INFO L225 Difference]: With dead ends: 811 [2018-12-08 17:25:21,260 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:21,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2018-12-08 17:25:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-08 17:25:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2018-12-08 17:25:21,276 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2018-12-08 17:25:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:21,276 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2018-12-08 17:25:21,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2018-12-08 17:25:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:25:21,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:21,278 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 17:25:21,279 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:21,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2123857804, now seen corresponding path program 1 times [2018-12-08 17:25:21,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:21,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:21,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:21,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:21,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:21,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:21,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:21,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:21,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:21,341 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2018-12-08 17:25:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:21,610 INFO L93 Difference]: Finished difference Result 933 states and 1414 transitions. [2018-12-08 17:25:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:21,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 17:25:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:21,612 INFO L225 Difference]: With dead ends: 933 [2018-12-08 17:25:21,612 INFO L226 Difference]: Without dead ends: 537 [2018-12-08 17:25:21,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-08 17:25:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2018-12-08 17:25:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2018-12-08 17:25:21,625 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2018-12-08 17:25:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:21,625 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2018-12-08 17:25:21,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2018-12-08 17:25:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:25:21,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:21,627 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2018-12-08 17:25:21,627 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:21,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -138627003, now seen corresponding path program 1 times [2018-12-08 17:25:21,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:21,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:21,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:21,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:21,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:21,682 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2018-12-08 17:25:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:21,936 INFO L93 Difference]: Finished difference Result 933 states and 1412 transitions. [2018-12-08 17:25:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:21,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 17:25:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:21,938 INFO L225 Difference]: With dead ends: 933 [2018-12-08 17:25:21,938 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 17:25:21,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 17:25:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 17:25:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2018-12-08 17:25:21,947 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2018-12-08 17:25:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2018-12-08 17:25:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2018-12-08 17:25:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:25:21,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:21,948 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:21,948 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:21,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1247607449, now seen corresponding path program 1 times [2018-12-08 17:25:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:21,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:21,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:21,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:21,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:21,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:21,994 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2018-12-08 17:25:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:22,270 INFO L93 Difference]: Finished difference Result 933 states and 1408 transitions. [2018-12-08 17:25:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:22,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 17:25:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:22,272 INFO L225 Difference]: With dead ends: 933 [2018-12-08 17:25:22,272 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 17:25:22,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 17:25:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 17:25:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2018-12-08 17:25:22,284 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2018-12-08 17:25:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:22,285 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2018-12-08 17:25:22,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2018-12-08 17:25:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:25:22,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:22,286 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1] [2018-12-08 17:25:22,286 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:22,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1167986301, now seen corresponding path program 1 times [2018-12-08 17:25:22,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:22,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:22,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:22,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:22,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:22,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:22,329 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2018-12-08 17:25:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:22,512 INFO L93 Difference]: Finished difference Result 853 states and 1283 transitions. [2018-12-08 17:25:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:22,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 17:25:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:22,514 INFO L225 Difference]: With dead ends: 853 [2018-12-08 17:25:22,514 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:22,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 17:25:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2018-12-08 17:25:22,526 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2018-12-08 17:25:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:22,526 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2018-12-08 17:25:22,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2018-12-08 17:25:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:25:22,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:22,527 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:22,527 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:22,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2018000549, now seen corresponding path program 1 times [2018-12-08 17:25:22,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:22,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:22,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:22,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:22,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:22,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:22,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:22,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:22,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:22,565 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2018-12-08 17:25:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:22,745 INFO L93 Difference]: Finished difference Result 853 states and 1279 transitions. [2018-12-08 17:25:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:22,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 17:25:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:22,746 INFO L225 Difference]: With dead ends: 853 [2018-12-08 17:25:22,746 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:22,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 17:25:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2018-12-08 17:25:22,754 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2018-12-08 17:25:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:22,754 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2018-12-08 17:25:22,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2018-12-08 17:25:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:25:22,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:22,755 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-08 17:25:22,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 33267782, now seen corresponding path program 1 times [2018-12-08 17:25:22,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:22,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:22,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:22,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:22,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:22,788 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2018-12-08 17:25:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:23,042 INFO L93 Difference]: Finished difference Result 933 states and 1396 transitions. [2018-12-08 17:25:23,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:23,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:25:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:23,044 INFO L225 Difference]: With dead ends: 933 [2018-12-08 17:25:23,044 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 17:25:23,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 17:25:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 17:25:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2018-12-08 17:25:23,054 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2018-12-08 17:25:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:23,054 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2018-12-08 17:25:23,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2018-12-08 17:25:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:25:23,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:23,055 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:23,055 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:23,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash 333328865, now seen corresponding path program 1 times [2018-12-08 17:25:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:23,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:23,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:23,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:23,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:23,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:23,102 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2018-12-08 17:25:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:23,379 INFO L93 Difference]: Finished difference Result 788 states and 1173 transitions. [2018-12-08 17:25:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:23,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:25:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:23,381 INFO L225 Difference]: With dead ends: 788 [2018-12-08 17:25:23,382 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 17:25:23,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 17:25:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 17:25:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2018-12-08 17:25:23,404 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2018-12-08 17:25:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:23,405 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2018-12-08 17:25:23,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2018-12-08 17:25:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:25:23,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:23,406 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-08 17:25:23,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:23,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1812099384, now seen corresponding path program 1 times [2018-12-08 17:25:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:23,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:23,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:23,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:23,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:23,466 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2018-12-08 17:25:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:23,643 INFO L93 Difference]: Finished difference Result 853 states and 1267 transitions. [2018-12-08 17:25:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:23,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:25:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:23,645 INFO L225 Difference]: With dead ends: 853 [2018-12-08 17:25:23,645 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:23,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 17:25:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2018-12-08 17:25:23,656 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2018-12-08 17:25:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:23,656 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2018-12-08 17:25:23,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2018-12-08 17:25:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:25:23,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:23,658 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:23,658 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:23,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1512038301, now seen corresponding path program 1 times [2018-12-08 17:25:23,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:23,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:23,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:23,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:23,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:23,709 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2018-12-08 17:25:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:23,864 INFO L93 Difference]: Finished difference Result 708 states and 1046 transitions. [2018-12-08 17:25:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:23,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 17:25:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:23,865 INFO L225 Difference]: With dead ends: 708 [2018-12-08 17:25:23,865 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:23,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 17:25:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2018-12-08 17:25:23,873 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2018-12-08 17:25:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:23,873 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2018-12-08 17:25:23,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2018-12-08 17:25:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 17:25:23,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:23,874 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-08 17:25:23,874 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:23,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1142274914, now seen corresponding path program 1 times [2018-12-08 17:25:23,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:23,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:23,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:23,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:23,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:23,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:23,916 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2018-12-08 17:25:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:24,137 INFO L93 Difference]: Finished difference Result 933 states and 1380 transitions. [2018-12-08 17:25:24,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:24,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 17:25:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:24,138 INFO L225 Difference]: With dead ends: 933 [2018-12-08 17:25:24,138 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 17:25:24,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 17:25:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 17:25:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2018-12-08 17:25:24,146 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2018-12-08 17:25:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:24,146 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2018-12-08 17:25:24,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2018-12-08 17:25:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 17:25:24,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:24,147 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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-08 17:25:24,147 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:24,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash -147702750, now seen corresponding path program 1 times [2018-12-08 17:25:24,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:24,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:24,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:24,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:24,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:24,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:24,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:24,182 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2018-12-08 17:25:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:24,408 INFO L93 Difference]: Finished difference Result 782 states and 1154 transitions. [2018-12-08 17:25:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:24,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 17:25:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:24,410 INFO L225 Difference]: With dead ends: 782 [2018-12-08 17:25:24,410 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 17:25:24,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 17:25:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2018-12-08 17:25:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2018-12-08 17:25:24,418 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2018-12-08 17:25:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:24,418 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2018-12-08 17:25:24,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2018-12-08 17:25:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 17:25:24,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:24,419 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-08 17:25:24,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:24,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash -229532384, now seen corresponding path program 1 times [2018-12-08 17:25:24,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:24,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:24,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:24,459 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2018-12-08 17:25:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:24,625 INFO L93 Difference]: Finished difference Result 853 states and 1251 transitions. [2018-12-08 17:25:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:24,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 17:25:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:24,627 INFO L225 Difference]: With dead ends: 853 [2018-12-08 17:25:24,627 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 17:25:24,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 17:25:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 17:25:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2018-12-08 17:25:24,639 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2018-12-08 17:25:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:24,639 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2018-12-08 17:25:24,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2018-12-08 17:25:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 17:25:24,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:24,640 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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-08 17:25:24,640 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:24,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:24,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1519510048, now seen corresponding path program 1 times [2018-12-08 17:25:24,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:24,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:24,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:24,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:24,687 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2018-12-08 17:25:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:24,850 INFO L93 Difference]: Finished difference Result 702 states and 1027 transitions. [2018-12-08 17:25:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:24,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 17:25:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:24,852 INFO L225 Difference]: With dead ends: 702 [2018-12-08 17:25:24,852 INFO L226 Difference]: Without dead ends: 449 [2018-12-08 17:25:24,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-08 17:25:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2018-12-08 17:25:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2018-12-08 17:25:24,862 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2018-12-08 17:25:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:24,863 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2018-12-08 17:25:24,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2018-12-08 17:25:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 17:25:24,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:24,864 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:24,864 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:24,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1218338273, now seen corresponding path program 1 times [2018-12-08 17:25:24,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:24,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:24,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:24,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:24,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:24,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:24,918 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2018-12-08 17:25:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,134 INFO L93 Difference]: Finished difference Result 909 states and 1335 transitions. [2018-12-08 17:25:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:25,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 17:25:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,135 INFO L225 Difference]: With dead ends: 909 [2018-12-08 17:25:25,135 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 17:25:25,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 17:25:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2018-12-08 17:25:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2018-12-08 17:25:25,144 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2018-12-08 17:25:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,144 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2018-12-08 17:25:25,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2018-12-08 17:25:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 17:25:25,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,145 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:25,145 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1641984995, now seen corresponding path program 1 times [2018-12-08 17:25:25,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:25,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:25,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:25,188 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2018-12-08 17:25:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,363 INFO L93 Difference]: Finished difference Result 829 states and 1210 transitions. [2018-12-08 17:25:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:25,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 17:25:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,365 INFO L225 Difference]: With dead ends: 829 [2018-12-08 17:25:25,365 INFO L226 Difference]: Without dead ends: 431 [2018-12-08 17:25:25,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-08 17:25:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2018-12-08 17:25:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2018-12-08 17:25:25,376 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2018-12-08 17:25:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,376 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2018-12-08 17:25:25,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2018-12-08 17:25:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 17:25:25,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,377 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-08 17:25:25,377 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 287084446, now seen corresponding path program 1 times [2018-12-08 17:25:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:25:25,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:25,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:25,415 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2018-12-08 17:25:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,619 INFO L93 Difference]: Finished difference Result 909 states and 1327 transitions. [2018-12-08 17:25:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:25,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 17:25:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,621 INFO L225 Difference]: With dead ends: 909 [2018-12-08 17:25:25,621 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 17:25:25,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 17:25:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2018-12-08 17:25:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:25:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2018-12-08 17:25:25,628 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2018-12-08 17:25:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,628 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2018-12-08 17:25:25,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2018-12-08 17:25:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 17:25:25,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,630 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-08 17:25:25,630 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 535230940, now seen corresponding path program 1 times [2018-12-08 17:25:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 17:25:25,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:25:25,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:25:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:25:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:25:25,658 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2018-12-08 17:25:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,680 INFO L93 Difference]: Finished difference Result 811 states and 1184 transitions. [2018-12-08 17:25:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:25:25,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-08 17:25:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,681 INFO L225 Difference]: With dead ends: 811 [2018-12-08 17:25:25,681 INFO L226 Difference]: Without dead ends: 560 [2018-12-08 17:25:25,682 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-08 17:25:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-12-08 17:25:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2018-12-08 17:25:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-08 17:25:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2018-12-08 17:25:25,691 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2018-12-08 17:25:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,691 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2018-12-08 17:25:25,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:25:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2018-12-08 17:25:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 17:25:25,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,692 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-08 17:25:25,692 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash -608380723, now seen corresponding path program 1 times [2018-12-08 17:25:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 17:25:25,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:25:25,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:25:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:25:25,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:25:25,716 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2018-12-08 17:25:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,742 INFO L93 Difference]: Finished difference Result 1109 states and 1618 transitions. [2018-12-08 17:25:25,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:25:25,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-08 17:25:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,744 INFO L225 Difference]: With dead ends: 1109 [2018-12-08 17:25:25,744 INFO L226 Difference]: Without dead ends: 709 [2018-12-08 17:25:25,744 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-08 17:25:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-08 17:25:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2018-12-08 17:25:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-12-08 17:25:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2018-12-08 17:25:25,754 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2018-12-08 17:25:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,754 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2018-12-08 17:25:25,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:25:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2018-12-08 17:25:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 17:25:25,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,756 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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, 1] [2018-12-08 17:25:25,756 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1632820368, now seen corresponding path program 1 times [2018-12-08 17:25:25,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-08 17:25:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:25:25,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:25:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:25:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:25:25,782 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 3 states. [2018-12-08 17:25:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:25,813 INFO L93 Difference]: Finished difference Result 860 states and 1252 transitions. [2018-12-08 17:25:25,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:25:25,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-08 17:25:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:25,816 INFO L225 Difference]: With dead ends: 860 [2018-12-08 17:25:25,816 INFO L226 Difference]: Without dead ends: 858 [2018-12-08 17:25:25,817 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-08 17:25:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-12-08 17:25:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2018-12-08 17:25:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-12-08 17:25:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1250 transitions. [2018-12-08 17:25:25,834 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1250 transitions. Word has length 104 [2018-12-08 17:25:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:25,834 INFO L480 AbstractCegarLoop]: Abstraction has 858 states and 1250 transitions. [2018-12-08 17:25:25,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:25:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1250 transitions. [2018-12-08 17:25:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 17:25:25,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:25,836 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-08 17:25:25,836 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:25,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1735850518, now seen corresponding path program 1 times [2018-12-08 17:25:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:25,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-08 17:25:25,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:25,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:25,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:25,892 INFO L87 Difference]: Start difference. First operand 858 states and 1250 transitions. Second operand 4 states. [2018-12-08 17:25:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:26,047 INFO L93 Difference]: Finished difference Result 1988 states and 2910 transitions. [2018-12-08 17:25:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:26,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-08 17:25:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:26,049 INFO L225 Difference]: With dead ends: 1988 [2018-12-08 17:25:26,049 INFO L226 Difference]: Without dead ends: 1143 [2018-12-08 17:25:26,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-12-08 17:25:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 990. [2018-12-08 17:25:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2018-12-08 17:25:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1478 transitions. [2018-12-08 17:25:26,062 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1478 transitions. Word has length 125 [2018-12-08 17:25:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:26,062 INFO L480 AbstractCegarLoop]: Abstraction has 990 states and 1478 transitions. [2018-12-08 17:25:26,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1478 transitions. [2018-12-08 17:25:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 17:25:26,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:26,063 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2018-12-08 17:25:26,063 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:26,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1540303170, now seen corresponding path program 1 times [2018-12-08 17:25:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:26,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:26,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 11 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 17:25:26,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:26,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:26,119 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-12-08 17:25:26,120 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:26,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:26,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:26,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:26,514 INFO L272 AbstractInterpreter]: Visited 66 different actions 203 times. Merged at 43 different actions 119 times. Never widened. Performed 1613 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1613 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 8 different actions. Largest state had 107 variables. [2018-12-08 17:25:26,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:26,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:26,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:26,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:26,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:26,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:26,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:26,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:26,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:26,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:26,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:26,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:26,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,663 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:26,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:26,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:26,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:26,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 17:25:26,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:26,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:26,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-08 17:25:26,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:26,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 17:25:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:26,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-08 17:25:26,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:26,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:25:26,789 INFO L87 Difference]: Start difference. First operand 990 states and 1478 transitions. Second operand 4 states. [2018-12-08 17:25:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:27,119 INFO L93 Difference]: Finished difference Result 2512 states and 3764 transitions. [2018-12-08 17:25:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:27,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-08 17:25:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:27,123 INFO L225 Difference]: With dead ends: 2512 [2018-12-08 17:25:27,123 INFO L226 Difference]: Without dead ends: 1535 [2018-12-08 17:25:27,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2018-12-08 17:25:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1110. [2018-12-08 17:25:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2018-12-08 17:25:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1682 transitions. [2018-12-08 17:25:27,147 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1682 transitions. Word has length 139 [2018-12-08 17:25:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:27,147 INFO L480 AbstractCegarLoop]: Abstraction has 1110 states and 1682 transitions. [2018-12-08 17:25:27,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1682 transitions. [2018-12-08 17:25:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 17:25:27,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:27,149 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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-08 17:25:27,149 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:27,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash -810465751, now seen corresponding path program 1 times [2018-12-08 17:25:27,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:27,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:27,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:27,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:27,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 125 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 17:25:27,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:27,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:27,212 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-12-08 17:25:27,213 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [89], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:27,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:27,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:27,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:27,402 INFO L272 AbstractInterpreter]: Visited 67 different actions 207 times. Merged at 43 different actions 119 times. Never widened. Performed 1625 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 9 different actions. Largest state had 107 variables. [2018-12-08 17:25:27,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:27,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:27,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:27,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:27,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:27,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:27,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:27,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:27,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:27,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:27,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:27,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:27,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:27,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:27,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:27,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:27,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 17:25:27,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:27,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:27,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-08 17:25:27,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:27,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 152 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 17:25:27,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-12-08 17:25:27,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:27,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:25:27,639 INFO L87 Difference]: Start difference. First operand 1110 states and 1682 transitions. Second operand 4 states. [2018-12-08 17:25:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:27,938 INFO L93 Difference]: Finished difference Result 2596 states and 3914 transitions. [2018-12-08 17:25:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:27,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-08 17:25:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:27,940 INFO L225 Difference]: With dead ends: 2596 [2018-12-08 17:25:27,940 INFO L226 Difference]: Without dead ends: 1499 [2018-12-08 17:25:27,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-12-08 17:25:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1116. [2018-12-08 17:25:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1688 transitions. [2018-12-08 17:25:27,961 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1688 transitions. Word has length 140 [2018-12-08 17:25:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:27,961 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1688 transitions. [2018-12-08 17:25:27,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1688 transitions. [2018-12-08 17:25:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 17:25:27,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:27,962 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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] [2018-12-08 17:25:27,963 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:27,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:27,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1616755050, now seen corresponding path program 2 times [2018-12-08 17:25:27,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:27,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:27,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 17:25:28,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:28,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:28,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:28,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:28,012 INFO L87 Difference]: Start difference. First operand 1116 states and 1688 transitions. Second operand 4 states. [2018-12-08 17:25:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:28,260 INFO L93 Difference]: Finished difference Result 2596 states and 3908 transitions. [2018-12-08 17:25:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:28,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 17:25:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:28,262 INFO L225 Difference]: With dead ends: 2596 [2018-12-08 17:25:28,262 INFO L226 Difference]: Without dead ends: 1493 [2018-12-08 17:25:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-12-08 17:25:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1116. [2018-12-08 17:25:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1682 transitions. [2018-12-08 17:25:28,283 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1682 transitions. Word has length 153 [2018-12-08 17:25:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:28,283 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1682 transitions. [2018-12-08 17:25:28,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1682 transitions. [2018-12-08 17:25:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 17:25:28,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:28,285 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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] [2018-12-08 17:25:28,285 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:28,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1659778808, now seen corresponding path program 1 times [2018-12-08 17:25:28,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:28,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:25:28,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-08 17:25:28,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:28,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:28,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:28,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:28,325 INFO L87 Difference]: Start difference. First operand 1116 states and 1682 transitions. Second operand 4 states. [2018-12-08 17:25:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:28,565 INFO L93 Difference]: Finished difference Result 2596 states and 3896 transitions. [2018-12-08 17:25:28,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:28,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 17:25:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:28,567 INFO L225 Difference]: With dead ends: 2596 [2018-12-08 17:25:28,568 INFO L226 Difference]: Without dead ends: 1493 [2018-12-08 17:25:28,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-12-08 17:25:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1116. [2018-12-08 17:25:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1676 transitions. [2018-12-08 17:25:28,589 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1676 transitions. Word has length 153 [2018-12-08 17:25:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:28,589 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1676 transitions. [2018-12-08 17:25:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1676 transitions. [2018-12-08 17:25:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 17:25:28,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:28,591 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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] [2018-12-08 17:25:28,591 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:28,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 11744047, now seen corresponding path program 1 times [2018-12-08 17:25:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-08 17:25:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:28,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:28,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:28,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:28,630 INFO L87 Difference]: Start difference. First operand 1116 states and 1676 transitions. Second operand 4 states. [2018-12-08 17:25:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:28,879 INFO L93 Difference]: Finished difference Result 2596 states and 3884 transitions. [2018-12-08 17:25:28,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:28,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-08 17:25:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:28,884 INFO L225 Difference]: With dead ends: 2596 [2018-12-08 17:25:28,884 INFO L226 Difference]: Without dead ends: 1493 [2018-12-08 17:25:28,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-12-08 17:25:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1116. [2018-12-08 17:25:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1670 transitions. [2018-12-08 17:25:28,920 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1670 transitions. Word has length 154 [2018-12-08 17:25:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:28,920 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1670 transitions. [2018-12-08 17:25:28,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1670 transitions. [2018-12-08 17:25:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 17:25:28,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:28,922 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 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] [2018-12-08 17:25:28,922 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:28,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1153835956, now seen corresponding path program 1 times [2018-12-08 17:25:28,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:28,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-08 17:25:28,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:28,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:28,999 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2018-12-08 17:25:28,999 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:29,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:29,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:29,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:29,175 INFO L272 AbstractInterpreter]: Visited 67 different actions 163 times. Merged at 44 different actions 82 times. Never widened. Performed 1456 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1456 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 8 different actions. Largest state had 107 variables. [2018-12-08 17:25:29,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:29,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:29,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:29,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:29,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:29,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:29,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:29,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:29,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:29,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:29,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:29,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:29,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,287 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:29,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:29,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:29,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:29,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:29,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:25:29,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:29,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:29,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-08 17:25:29,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:29,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 202 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 17:25:29,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:29,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 14 [2018-12-08 17:25:29,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:29,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:29,407 INFO L87 Difference]: Start difference. First operand 1116 states and 1670 transitions. Second operand 4 states. [2018-12-08 17:25:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:29,669 INFO L93 Difference]: Finished difference Result 2408 states and 3593 transitions. [2018-12-08 17:25:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:29,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-08 17:25:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:29,672 INFO L225 Difference]: With dead ends: 2408 [2018-12-08 17:25:29,672 INFO L226 Difference]: Without dead ends: 1493 [2018-12-08 17:25:29,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:25:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-12-08 17:25:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1116. [2018-12-08 17:25:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1664 transitions. [2018-12-08 17:25:29,701 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1664 transitions. Word has length 154 [2018-12-08 17:25:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:29,701 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1664 transitions. [2018-12-08 17:25:29,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1664 transitions. [2018-12-08 17:25:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 17:25:29,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:29,703 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:29,703 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:29,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:29,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1778620947, now seen corresponding path program 1 times [2018-12-08 17:25:29,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:29,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:29,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-08 17:25:29,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:29,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:29,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:29,764 INFO L87 Difference]: Start difference. First operand 1116 states and 1664 transitions. Second operand 4 states. [2018-12-08 17:25:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:29,995 INFO L93 Difference]: Finished difference Result 2596 states and 3860 transitions. [2018-12-08 17:25:29,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:29,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 17:25:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:29,997 INFO L225 Difference]: With dead ends: 2596 [2018-12-08 17:25:29,997 INFO L226 Difference]: Without dead ends: 1493 [2018-12-08 17:25:29,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-12-08 17:25:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1116. [2018-12-08 17:25:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1658 transitions. [2018-12-08 17:25:30,020 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1658 transitions. Word has length 155 [2018-12-08 17:25:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:30,020 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1658 transitions. [2018-12-08 17:25:30,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1658 transitions. [2018-12-08 17:25:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 17:25:30,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:30,021 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 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] [2018-12-08 17:25:30,021 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:30,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -117822163, now seen corresponding path program 1 times [2018-12-08 17:25:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:30,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 180 proven. 6 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-12-08 17:25:30,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:30,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:30,074 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-12-08 17:25:30,074 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [69], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:30,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:30,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:30,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:30,259 INFO L272 AbstractInterpreter]: Visited 68 different actions 215 times. Merged at 45 different actions 123 times. Never widened. Performed 1895 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1895 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 11 different actions. Largest state had 107 variables. [2018-12-08 17:25:30,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:30,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:30,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:30,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:30,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:30,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:30,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:30,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:30,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:30,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:30,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:30,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:30,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,378 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:30,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:30,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:30,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:30,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:30,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:25:30,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:30,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:30,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-08 17:25:30,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:30,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-08 17:25:30,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:30,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 14 [2018-12-08 17:25:30,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:30,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:30,516 INFO L87 Difference]: Start difference. First operand 1116 states and 1658 transitions. Second operand 4 states. [2018-12-08 17:25:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:30,774 INFO L93 Difference]: Finished difference Result 2391 states and 3550 transitions. [2018-12-08 17:25:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:30,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 17:25:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:30,777 INFO L225 Difference]: With dead ends: 2391 [2018-12-08 17:25:30,778 INFO L226 Difference]: Without dead ends: 1476 [2018-12-08 17:25:30,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:25:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2018-12-08 17:25:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1116. [2018-12-08 17:25:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1652 transitions. [2018-12-08 17:25:30,801 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1652 transitions. Word has length 155 [2018-12-08 17:25:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:30,802 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1652 transitions. [2018-12-08 17:25:30,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1652 transitions. [2018-12-08 17:25:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 17:25:30,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:30,803 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 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] [2018-12-08 17:25:30,803 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:30,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 781640436, now seen corresponding path program 1 times [2018-12-08 17:25:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:30,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-08 17:25:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:30,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:30,844 INFO L87 Difference]: Start difference. First operand 1116 states and 1652 transitions. Second operand 4 states. [2018-12-08 17:25:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:31,061 INFO L93 Difference]: Finished difference Result 2525 states and 3749 transitions. [2018-12-08 17:25:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:31,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 17:25:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:31,065 INFO L225 Difference]: With dead ends: 2525 [2018-12-08 17:25:31,065 INFO L226 Difference]: Without dead ends: 1422 [2018-12-08 17:25:31,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2018-12-08 17:25:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1116. [2018-12-08 17:25:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1646 transitions. [2018-12-08 17:25:31,097 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1646 transitions. Word has length 156 [2018-12-08 17:25:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:31,098 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1646 transitions. [2018-12-08 17:25:31,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1646 transitions. [2018-12-08 17:25:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 17:25:31,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:31,099 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2018-12-08 17:25:31,099 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:31,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -388427060, now seen corresponding path program 1 times [2018-12-08 17:25:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:25:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:31,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:31,150 INFO L87 Difference]: Start difference. First operand 1116 states and 1646 transitions. Second operand 4 states. [2018-12-08 17:25:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:31,367 INFO L93 Difference]: Finished difference Result 2525 states and 3737 transitions. [2018-12-08 17:25:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:31,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 17:25:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:31,369 INFO L225 Difference]: With dead ends: 2525 [2018-12-08 17:25:31,369 INFO L226 Difference]: Without dead ends: 1422 [2018-12-08 17:25:31,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2018-12-08 17:25:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1116. [2018-12-08 17:25:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1640 transitions. [2018-12-08 17:25:31,394 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1640 transitions. Word has length 157 [2018-12-08 17:25:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:31,394 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1640 transitions. [2018-12-08 17:25:31,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1640 transitions. [2018-12-08 17:25:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 17:25:31,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:31,395 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 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] [2018-12-08 17:25:31,395 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:31,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1775889581, now seen corresponding path program 1 times [2018-12-08 17:25:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:25:31,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:31,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:31,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:31,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:31,450 INFO L87 Difference]: Start difference. First operand 1116 states and 1640 transitions. Second operand 4 states. [2018-12-08 17:25:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:31,654 INFO L93 Difference]: Finished difference Result 2503 states and 3694 transitions. [2018-12-08 17:25:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:31,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-08 17:25:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:31,656 INFO L225 Difference]: With dead ends: 2503 [2018-12-08 17:25:31,656 INFO L226 Difference]: Without dead ends: 1400 [2018-12-08 17:25:31,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-12-08 17:25:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1116. [2018-12-08 17:25:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-12-08 17:25:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1634 transitions. [2018-12-08 17:25:31,680 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1634 transitions. Word has length 158 [2018-12-08 17:25:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:31,680 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1634 transitions. [2018-12-08 17:25:31,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1634 transitions. [2018-12-08 17:25:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 17:25:31,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:31,681 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 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] [2018-12-08 17:25:31,681 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:31,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -104526785, now seen corresponding path program 1 times [2018-12-08 17:25:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:31,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-08 17:25:31,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:31,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:31,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:31,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:31,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:31,733 INFO L87 Difference]: Start difference. First operand 1116 states and 1634 transitions. Second operand 4 states. [2018-12-08 17:25:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:32,009 INFO L93 Difference]: Finished difference Result 2764 states and 4076 transitions. [2018-12-08 17:25:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:32,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-08 17:25:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:32,011 INFO L225 Difference]: With dead ends: 2764 [2018-12-08 17:25:32,011 INFO L226 Difference]: Without dead ends: 1661 [2018-12-08 17:25:32,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2018-12-08 17:25:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1236. [2018-12-08 17:25:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-12-08 17:25:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1838 transitions. [2018-12-08 17:25:32,039 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1838 transitions. Word has length 161 [2018-12-08 17:25:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:32,039 INFO L480 AbstractCegarLoop]: Abstraction has 1236 states and 1838 transitions. [2018-12-08 17:25:32,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1838 transitions. [2018-12-08 17:25:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 17:25:32,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:32,040 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 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] [2018-12-08 17:25:32,040 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash -260586804, now seen corresponding path program 1 times [2018-12-08 17:25:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-08 17:25:32,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:32,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:32,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:32,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:32,080 INFO L87 Difference]: Start difference. First operand 1236 states and 1838 transitions. Second operand 4 states. [2018-12-08 17:25:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:32,328 INFO L93 Difference]: Finished difference Result 2848 states and 4226 transitions. [2018-12-08 17:25:32,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:32,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-08 17:25:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:32,331 INFO L225 Difference]: With dead ends: 2848 [2018-12-08 17:25:32,331 INFO L226 Difference]: Without dead ends: 1625 [2018-12-08 17:25:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-12-08 17:25:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1230. [2018-12-08 17:25:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-12-08 17:25:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1832 transitions. [2018-12-08 17:25:32,360 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1832 transitions. Word has length 162 [2018-12-08 17:25:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:32,360 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 1832 transitions. [2018-12-08 17:25:32,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1832 transitions. [2018-12-08 17:25:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 17:25:32,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:32,362 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 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-08 17:25:32,362 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:32,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:32,362 INFO L82 PathProgramCache]: Analyzing trace with hash -9432614, now seen corresponding path program 1 times [2018-12-08 17:25:32,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-08 17:25:32,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:32,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:32,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:32,401 INFO L87 Difference]: Start difference. First operand 1230 states and 1832 transitions. Second operand 4 states. [2018-12-08 17:25:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:32,535 INFO L93 Difference]: Finished difference Result 2515 states and 3736 transitions. [2018-12-08 17:25:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:32,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-08 17:25:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:32,537 INFO L225 Difference]: With dead ends: 2515 [2018-12-08 17:25:32,537 INFO L226 Difference]: Without dead ends: 1298 [2018-12-08 17:25:32,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-12-08 17:25:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1260. [2018-12-08 17:25:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1874 transitions. [2018-12-08 17:25:32,565 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1874 transitions. Word has length 164 [2018-12-08 17:25:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:32,565 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1874 transitions. [2018-12-08 17:25:32,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1874 transitions. [2018-12-08 17:25:32,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 17:25:32,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:32,567 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:32,567 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:32,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1865948583, now seen corresponding path program 2 times [2018-12-08 17:25:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-08 17:25:32,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:32,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:32,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:32,616 INFO L87 Difference]: Start difference. First operand 1260 states and 1874 transitions. Second operand 4 states. [2018-12-08 17:25:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:32,850 INFO L93 Difference]: Finished difference Result 2884 states and 4280 transitions. [2018-12-08 17:25:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:32,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-12-08 17:25:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:32,852 INFO L225 Difference]: With dead ends: 2884 [2018-12-08 17:25:32,853 INFO L226 Difference]: Without dead ends: 1637 [2018-12-08 17:25:32,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-08 17:25:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1260. [2018-12-08 17:25:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1868 transitions. [2018-12-08 17:25:32,883 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1868 transitions. Word has length 175 [2018-12-08 17:25:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:32,883 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1868 transitions. [2018-12-08 17:25:32,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1868 transitions. [2018-12-08 17:25:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 17:25:32,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:32,884 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:32,884 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:32,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1410585275, now seen corresponding path program 1 times [2018-12-08 17:25:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:25:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:32,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-08 17:25:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:32,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:32,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:32,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:32,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:32,925 INFO L87 Difference]: Start difference. First operand 1260 states and 1868 transitions. Second operand 4 states. [2018-12-08 17:25:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:33,159 INFO L93 Difference]: Finished difference Result 2884 states and 4268 transitions. [2018-12-08 17:25:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:33,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-12-08 17:25:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:33,161 INFO L225 Difference]: With dead ends: 2884 [2018-12-08 17:25:33,161 INFO L226 Difference]: Without dead ends: 1637 [2018-12-08 17:25:33,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-08 17:25:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1260. [2018-12-08 17:25:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1862 transitions. [2018-12-08 17:25:33,192 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1862 transitions. Word has length 175 [2018-12-08 17:25:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:33,192 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1862 transitions. [2018-12-08 17:25:33,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1862 transitions. [2018-12-08 17:25:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 17:25:33,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:33,193 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:33,193 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:33,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash -853191022, now seen corresponding path program 1 times [2018-12-08 17:25:33,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-08 17:25:33,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:33,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:33,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:33,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:33,238 INFO L87 Difference]: Start difference. First operand 1260 states and 1862 transitions. Second operand 4 states. [2018-12-08 17:25:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:33,476 INFO L93 Difference]: Finished difference Result 2884 states and 4256 transitions. [2018-12-08 17:25:33,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:33,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-08 17:25:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:33,479 INFO L225 Difference]: With dead ends: 2884 [2018-12-08 17:25:33,479 INFO L226 Difference]: Without dead ends: 1637 [2018-12-08 17:25:33,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-08 17:25:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1260. [2018-12-08 17:25:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1856 transitions. [2018-12-08 17:25:33,511 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1856 transitions. Word has length 176 [2018-12-08 17:25:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:33,511 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1856 transitions. [2018-12-08 17:25:33,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1856 transitions. [2018-12-08 17:25:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 17:25:33,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:33,512 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 3, 3, 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] [2018-12-08 17:25:33,513 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:33,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 288900887, now seen corresponding path program 1 times [2018-12-08 17:25:33,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 17:25:33,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:33,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:33,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:33,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:33,561 INFO L87 Difference]: Start difference. First operand 1260 states and 1856 transitions. Second operand 4 states. [2018-12-08 17:25:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:33,838 INFO L93 Difference]: Finished difference Result 2672 states and 3934 transitions. [2018-12-08 17:25:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:33,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-08 17:25:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:33,840 INFO L225 Difference]: With dead ends: 2672 [2018-12-08 17:25:33,840 INFO L226 Difference]: Without dead ends: 1637 [2018-12-08 17:25:33,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-08 17:25:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1260. [2018-12-08 17:25:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1850 transitions. [2018-12-08 17:25:33,871 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1850 transitions. Word has length 176 [2018-12-08 17:25:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:33,871 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1850 transitions. [2018-12-08 17:25:33,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1850 transitions. [2018-12-08 17:25:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 17:25:33,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:33,872 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:33,872 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:33,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1473162986, now seen corresponding path program 1 times [2018-12-08 17:25:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:33,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-08 17:25:33,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:33,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:33,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:33,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:33,924 INFO L87 Difference]: Start difference. First operand 1260 states and 1850 transitions. Second operand 4 states. [2018-12-08 17:25:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:34,165 INFO L93 Difference]: Finished difference Result 2884 states and 4232 transitions. [2018-12-08 17:25:34,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:34,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-08 17:25:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:34,167 INFO L225 Difference]: With dead ends: 2884 [2018-12-08 17:25:34,167 INFO L226 Difference]: Without dead ends: 1637 [2018-12-08 17:25:34,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-08 17:25:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1260. [2018-12-08 17:25:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1844 transitions. [2018-12-08 17:25:34,200 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1844 transitions. Word has length 177 [2018-12-08 17:25:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:34,200 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1844 transitions. [2018-12-08 17:25:34,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1844 transitions. [2018-12-08 17:25:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 17:25:34,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:34,201 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:25:34,201 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:34,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1161005526, now seen corresponding path program 1 times [2018-12-08 17:25:34,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 17:25:34,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:34,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:34,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:34,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:34,239 INFO L87 Difference]: Start difference. First operand 1260 states and 1844 transitions. Second operand 4 states. [2018-12-08 17:25:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:34,476 INFO L93 Difference]: Finished difference Result 2655 states and 3891 transitions. [2018-12-08 17:25:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:34,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-08 17:25:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:34,477 INFO L225 Difference]: With dead ends: 2655 [2018-12-08 17:25:34,477 INFO L226 Difference]: Without dead ends: 1620 [2018-12-08 17:25:34,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2018-12-08 17:25:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1260. [2018-12-08 17:25:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1838 transitions. [2018-12-08 17:25:34,511 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1838 transitions. Word has length 177 [2018-12-08 17:25:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:34,511 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1838 transitions. [2018-12-08 17:25:34,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1838 transitions. [2018-12-08 17:25:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 17:25:34,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:34,512 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 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] [2018-12-08 17:25:34,512 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:34,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1492272745, now seen corresponding path program 1 times [2018-12-08 17:25:34,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:34,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:34,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-08 17:25:34,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:34,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:34,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:34,557 INFO L87 Difference]: Start difference. First operand 1260 states and 1838 transitions. Second operand 4 states. [2018-12-08 17:25:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:34,812 INFO L93 Difference]: Finished difference Result 2813 states and 4121 transitions. [2018-12-08 17:25:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:34,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-08 17:25:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:34,813 INFO L225 Difference]: With dead ends: 2813 [2018-12-08 17:25:34,813 INFO L226 Difference]: Without dead ends: 1566 [2018-12-08 17:25:34,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2018-12-08 17:25:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1260. [2018-12-08 17:25:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1832 transitions. [2018-12-08 17:25:34,862 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1832 transitions. Word has length 178 [2018-12-08 17:25:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:34,863 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1832 transitions. [2018-12-08 17:25:34,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1832 transitions. [2018-12-08 17:25:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 17:25:34,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:34,864 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-12-08 17:25:34,865 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:34,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2134708361, now seen corresponding path program 1 times [2018-12-08 17:25:34,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:34,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:34,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:34,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 17:25:34,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:34,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:34,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:34,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:34,927 INFO L87 Difference]: Start difference. First operand 1260 states and 1832 transitions. Second operand 4 states. [2018-12-08 17:25:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:35,157 INFO L93 Difference]: Finished difference Result 2813 states and 4109 transitions. [2018-12-08 17:25:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:35,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-08 17:25:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:35,159 INFO L225 Difference]: With dead ends: 2813 [2018-12-08 17:25:35,159 INFO L226 Difference]: Without dead ends: 1566 [2018-12-08 17:25:35,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2018-12-08 17:25:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1260. [2018-12-08 17:25:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1826 transitions. [2018-12-08 17:25:35,196 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1826 transitions. Word has length 179 [2018-12-08 17:25:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:35,196 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1826 transitions. [2018-12-08 17:25:35,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1826 transitions. [2018-12-08 17:25:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-08 17:25:35,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:35,197 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 3, 3, 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] [2018-12-08 17:25:35,197 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:35,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash -868102858, now seen corresponding path program 1 times [2018-12-08 17:25:35,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:35,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:35,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:35,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:35,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-08 17:25:35,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:35,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:35,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:35,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:35,234 INFO L87 Difference]: Start difference. First operand 1260 states and 1826 transitions. Second operand 4 states. [2018-12-08 17:25:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:35,473 INFO L93 Difference]: Finished difference Result 2791 states and 4066 transitions. [2018-12-08 17:25:35,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:35,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-08 17:25:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:35,475 INFO L225 Difference]: With dead ends: 2791 [2018-12-08 17:25:35,475 INFO L226 Difference]: Without dead ends: 1544 [2018-12-08 17:25:35,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-12-08 17:25:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1260. [2018-12-08 17:25:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2018-12-08 17:25:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1820 transitions. [2018-12-08 17:25:35,511 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1820 transitions. Word has length 180 [2018-12-08 17:25:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:35,512 INFO L480 AbstractCegarLoop]: Abstraction has 1260 states and 1820 transitions. [2018-12-08 17:25:35,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1820 transitions. [2018-12-08 17:25:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 17:25:35,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:35,513 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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-08 17:25:35,513 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:35,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1044616573, now seen corresponding path program 1 times [2018-12-08 17:25:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:35,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:35,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:35,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 176 proven. 35 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-08 17:25:35,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:35,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:35,577 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-12-08 17:25:35,578 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:35,579 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:35,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:35,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:35,761 INFO L272 AbstractInterpreter]: Visited 75 different actions 227 times. Merged at 50 different actions 130 times. Never widened. Performed 2057 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2057 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 14 different actions. Largest state had 113 variables. [2018-12-08 17:25:35,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:35,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:35,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:35,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:35,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:35,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:35,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:35,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:35,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:35,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:35,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:35,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:35,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:35,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:35,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:35,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:35,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:35,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:35,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:35,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 176 proven. 35 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-08 17:25:35,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:35,921 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:35,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:35,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-08 17:25:35,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:35,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-08 17:25:35,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:35,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:25:35,949 INFO L87 Difference]: Start difference. First operand 1260 states and 1820 transitions. Second operand 4 states. [2018-12-08 17:25:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:36,203 INFO L93 Difference]: Finished difference Result 3046 states and 4442 transitions. [2018-12-08 17:25:36,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:36,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-08 17:25:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:36,206 INFO L225 Difference]: With dead ends: 3046 [2018-12-08 17:25:36,206 INFO L226 Difference]: Without dead ends: 1799 [2018-12-08 17:25:36,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 370 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:25:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-08 17:25:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1326. [2018-12-08 17:25:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-12-08 17:25:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1910 transitions. [2018-12-08 17:25:36,255 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1910 transitions. Word has length 186 [2018-12-08 17:25:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:36,255 INFO L480 AbstractCegarLoop]: Abstraction has 1326 states and 1910 transitions. [2018-12-08 17:25:36,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1910 transitions. [2018-12-08 17:25:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 17:25:36,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:36,256 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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-08 17:25:36,256 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:36,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash -64363873, now seen corresponding path program 1 times [2018-12-08 17:25:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:36,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 181 proven. 32 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-08 17:25:36,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:36,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:36,316 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-12-08 17:25:36,316 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [44], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:36,317 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:36,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:36,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:36,484 INFO L272 AbstractInterpreter]: Visited 74 different actions 223 times. Merged at 49 different actions 127 times. Never widened. Performed 1959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 14 different actions. Largest state had 110 variables. [2018-12-08 17:25:36,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:36,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:36,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:36,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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-08 17:25:36,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:36,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:36,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:36,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:36,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:36,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:36,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:36,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:36,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:36,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:36,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:36,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:36,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:36,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:36,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:36,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:36,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 181 proven. 32 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-08 17:25:36,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:36,644 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:36,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:36,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-08 17:25:36,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:36,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-08 17:25:36,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:36,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:25:36,671 INFO L87 Difference]: Start difference. First operand 1326 states and 1910 transitions. Second operand 4 states. [2018-12-08 17:25:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:36,916 INFO L93 Difference]: Finished difference Result 3116 states and 4525 transitions. [2018-12-08 17:25:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:36,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-08 17:25:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:36,918 INFO L225 Difference]: With dead ends: 3116 [2018-12-08 17:25:36,918 INFO L226 Difference]: Without dead ends: 1803 [2018-12-08 17:25:36,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 370 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:25:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-12-08 17:25:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1335. [2018-12-08 17:25:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2018-12-08 17:25:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1914 transitions. [2018-12-08 17:25:36,959 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1914 transitions. Word has length 186 [2018-12-08 17:25:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:36,959 INFO L480 AbstractCegarLoop]: Abstraction has 1335 states and 1914 transitions. [2018-12-08 17:25:36,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1914 transitions. [2018-12-08 17:25:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 17:25:36,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:36,960 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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-08 17:25:36,960 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:36,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1940887026, now seen corresponding path program 1 times [2018-12-08 17:25:36,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:36,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:36,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:36,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:36,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 186 proven. 29 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-12-08 17:25:37,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:37,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:37,020 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-08 17:25:37,020 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [49], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:37,022 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:37,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:37,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:37,184 INFO L272 AbstractInterpreter]: Visited 74 different actions 223 times. Merged at 49 different actions 127 times. Never widened. Performed 1737 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1737 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 14 different actions. Largest state had 110 variables. [2018-12-08 17:25:37,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:37,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:37,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:37,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:25:37,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:37,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:37,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:37,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:37,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:37,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:37,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:37,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:37,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:37,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:37,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:37,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:37,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 186 proven. 29 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-12-08 17:25:37,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:37,336 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:37,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-08 17:25:37,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-08 17:25:37,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:25:37,364 INFO L87 Difference]: Start difference. First operand 1335 states and 1914 transitions. Second operand 4 states. [2018-12-08 17:25:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:37,605 INFO L93 Difference]: Finished difference Result 3122 states and 4513 transitions. [2018-12-08 17:25:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:37,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-08 17:25:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:37,607 INFO L225 Difference]: With dead ends: 3122 [2018-12-08 17:25:37,607 INFO L226 Difference]: Without dead ends: 1803 [2018-12-08 17:25:37,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 372 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:25:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-12-08 17:25:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1341. [2018-12-08 17:25:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-08 17:25:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1914 transitions. [2018-12-08 17:25:37,649 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1914 transitions. Word has length 187 [2018-12-08 17:25:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:37,649 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 1914 transitions. [2018-12-08 17:25:37,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1914 transitions. [2018-12-08 17:25:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 17:25:37,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:37,651 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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] [2018-12-08 17:25:37,651 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:37,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1640825943, now seen corresponding path program 1 times [2018-12-08 17:25:37,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:37,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 122 proven. 17 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-12-08 17:25:37,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:37,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:37,710 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-12-08 17:25:37,710 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [246], [249], [251], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:37,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:37,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:37,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:37,859 INFO L272 AbstractInterpreter]: Visited 67 different actions 193 times. Merged at 43 different actions 105 times. Never widened. Performed 1696 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1696 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 14 different actions. Largest state had 104 variables. [2018-12-08 17:25:37,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:37,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:37,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:37,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:25:37,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:37,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:37,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:37,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:37,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:37,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:37,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:37,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:37,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:37,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:37,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:37,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:37,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:37,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:38,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 205 proven. 20 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-08 17:25:38,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:38,039 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:38,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-08 17:25:38,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:38,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 13 [2018-12-08 17:25:38,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:38,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:38,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:25:38,067 INFO L87 Difference]: Start difference. First operand 1341 states and 1914 transitions. Second operand 4 states. [2018-12-08 17:25:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:38,315 INFO L93 Difference]: Finished difference Result 2981 states and 4290 transitions. [2018-12-08 17:25:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:38,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-08 17:25:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:38,317 INFO L225 Difference]: With dead ends: 2981 [2018-12-08 17:25:38,317 INFO L226 Difference]: Without dead ends: 1881 [2018-12-08 17:25:38,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2018-12-08 17:25:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1437. [2018-12-08 17:25:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-12-08 17:25:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2046 transitions. [2018-12-08 17:25:38,364 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2046 transitions. Word has length 187 [2018-12-08 17:25:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:38,364 INFO L480 AbstractCegarLoop]: Abstraction has 1437 states and 2046 transitions. [2018-12-08 17:25:38,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2046 transitions. [2018-12-08 17:25:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 17:25:38,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:38,366 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 4, 4, 3, 3, 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-08 17:25:38,366 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:38,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1687734943, now seen corresponding path program 1 times [2018-12-08 17:25:38,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:38,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:38,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 193 proven. 26 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-12-08 17:25:38,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:38,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:38,421 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-08 17:25:38,421 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [54], [56], [61], [66], [69], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:38,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:38,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:38,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:38,584 INFO L272 AbstractInterpreter]: Visited 74 different actions 276 times. Merged at 50 different actions 172 times. Never widened. Performed 2205 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 16 different actions. Largest state had 110 variables. [2018-12-08 17:25:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:38,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:38,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:38,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:25:38,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:38,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:38,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:38,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:38,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:38,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:38,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:38,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:38,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:38,678 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:38,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:38,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:38,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:38,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 193 proven. 26 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-12-08 17:25:38,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:38,717 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:38,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:38,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-08 17:25:38,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:38,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-08 17:25:38,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:38,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:38,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:38,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:25:38,745 INFO L87 Difference]: Start difference. First operand 1437 states and 2046 transitions. Second operand 4 states. [2018-12-08 17:25:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:39,072 INFO L93 Difference]: Finished difference Result 3320 states and 4765 transitions. [2018-12-08 17:25:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:39,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-12-08 17:25:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:39,075 INFO L225 Difference]: With dead ends: 3320 [2018-12-08 17:25:39,075 INFO L226 Difference]: Without dead ends: 1899 [2018-12-08 17:25:39,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 376 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:25:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2018-12-08 17:25:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1443. [2018-12-08 17:25:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2018-12-08 17:25:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2040 transitions. [2018-12-08 17:25:39,146 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2040 transitions. Word has length 189 [2018-12-08 17:25:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:39,147 INFO L480 AbstractCegarLoop]: Abstraction has 1443 states and 2040 transitions. [2018-12-08 17:25:39,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2040 transitions. [2018-12-08 17:25:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 17:25:39,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:39,148 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 6, 4, 4, 3, 3, 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] [2018-12-08 17:25:39,148 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:39,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1317254689, now seen corresponding path program 1 times [2018-12-08 17:25:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:39,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 124 proven. 17 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2018-12-08 17:25:39,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:39,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:39,214 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-08 17:25:39,215 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [66], [69], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [246], [249], [251], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:39,216 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:39,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:39,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:39,323 INFO L272 AbstractInterpreter]: Visited 67 different actions 193 times. Merged at 43 different actions 105 times. Never widened. Performed 1515 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1515 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 14 different actions. Largest state had 104 variables. [2018-12-08 17:25:39,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:39,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:39,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:39,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:25:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:39,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:39,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:39,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:39,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:39,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:39,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:39,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:39,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:39,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:39,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:39,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:39,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:39,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:39,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:39,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:39,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 212 proven. 17 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-12-08 17:25:39,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:39,476 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:39,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:39,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-08 17:25:39,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:39,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 13 [2018-12-08 17:25:39,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:39,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:25:39,508 INFO L87 Difference]: Start difference. First operand 1443 states and 2040 transitions. Second operand 4 states. [2018-12-08 17:25:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:39,771 INFO L93 Difference]: Finished difference Result 3055 states and 4356 transitions. [2018-12-08 17:25:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:39,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-12-08 17:25:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:39,772 INFO L225 Difference]: With dead ends: 3055 [2018-12-08 17:25:39,773 INFO L226 Difference]: Without dead ends: 1870 [2018-12-08 17:25:39,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:25:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-12-08 17:25:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1449. [2018-12-08 17:25:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2018-12-08 17:25:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2040 transitions. [2018-12-08 17:25:39,822 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2040 transitions. Word has length 189 [2018-12-08 17:25:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:39,822 INFO L480 AbstractCegarLoop]: Abstraction has 1449 states and 2040 transitions. [2018-12-08 17:25:39,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2040 transitions. [2018-12-08 17:25:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-08 17:25:39,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:39,823 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 4, 4, 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] [2018-12-08 17:25:39,823 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:39,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1352891793, now seen corresponding path program 1 times [2018-12-08 17:25:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:39,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:39,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-12-08 17:25:39,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:39,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:25:39,896 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-12-08 17:25:39,896 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [59], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [321], [326], [328], [331], [333], [338], [340], [345], [348], [352], [485], [519], [521], [533], [539], [543], [544], [545], [547] [2018-12-08 17:25:39,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:25:39,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:25:40,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:25:40,034 INFO L272 AbstractInterpreter]: Visited 76 different actions 231 times. Merged at 50 different actions 130 times. Never widened. Performed 1833 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1833 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 15 different actions. Largest state had 113 variables. [2018-12-08 17:25:40,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:40,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:25:40,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:25:40,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:25:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:40,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:25:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:40,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:25:40,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 17:25:40,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-08 17:25:40,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-08 17:25:40,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 17:25:40,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:25:40,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:40,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:40,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 17:25:40,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-08 17:25:40,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 17:25:40,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:40,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:25:40,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 17:25:40,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-08 17:25:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-12-08 17:25:40,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:25:40,213 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:25:40,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:25:40,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-08 17:25:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-08 17:25:40,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:25:40,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-08 17:25:40,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:40,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:40,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:40,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:25:40,252 INFO L87 Difference]: Start difference. First operand 1449 states and 2040 transitions. Second operand 4 states. [2018-12-08 17:25:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:40,520 INFO L93 Difference]: Finished difference Result 3338 states and 4741 transitions. [2018-12-08 17:25:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:40,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-12-08 17:25:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:40,522 INFO L225 Difference]: With dead ends: 3338 [2018-12-08 17:25:40,522 INFO L226 Difference]: Without dead ends: 1905 [2018-12-08 17:25:40,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 404 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:25:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2018-12-08 17:25:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1455. [2018-12-08 17:25:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2018-12-08 17:25:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2034 transitions. [2018-12-08 17:25:40,573 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2034 transitions. Word has length 203 [2018-12-08 17:25:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:40,574 INFO L480 AbstractCegarLoop]: Abstraction has 1455 states and 2034 transitions. [2018-12-08 17:25:40,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2034 transitions. [2018-12-08 17:25:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 17:25:40,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:40,575 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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-08 17:25:40,575 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:40,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1410681918, now seen corresponding path program 1 times [2018-12-08 17:25:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:40,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:40,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-08 17:25:40,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:40,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:40,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:40,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:40,630 INFO L87 Difference]: Start difference. First operand 1455 states and 2034 transitions. Second operand 4 states. [2018-12-08 17:25:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:40,904 INFO L93 Difference]: Finished difference Result 3368 states and 4743 transitions. [2018-12-08 17:25:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:40,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-08 17:25:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:40,906 INFO L225 Difference]: With dead ends: 3368 [2018-12-08 17:25:40,906 INFO L226 Difference]: Without dead ends: 1929 [2018-12-08 17:25:40,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-12-08 17:25:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1581. [2018-12-08 17:25:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2018-12-08 17:25:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2202 transitions. [2018-12-08 17:25:40,961 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2202 transitions. Word has length 207 [2018-12-08 17:25:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:40,961 INFO L480 AbstractCegarLoop]: Abstraction has 1581 states and 2202 transitions. [2018-12-08 17:25:40,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2202 transitions. [2018-12-08 17:25:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 17:25:40,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:40,962 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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-08 17:25:40,963 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:40,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2142649344, now seen corresponding path program 1 times [2018-12-08 17:25:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:40,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-08 17:25:41,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:41,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:41,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:41,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:41,024 INFO L87 Difference]: Start difference. First operand 1581 states and 2202 transitions. Second operand 4 states. [2018-12-08 17:25:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:41,310 INFO L93 Difference]: Finished difference Result 3614 states and 5073 transitions. [2018-12-08 17:25:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:41,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-08 17:25:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:41,312 INFO L225 Difference]: With dead ends: 3614 [2018-12-08 17:25:41,312 INFO L226 Difference]: Without dead ends: 2049 [2018-12-08 17:25:41,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2018-12-08 17:25:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1575. [2018-12-08 17:25:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-12-08 17:25:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2196 transitions. [2018-12-08 17:25:41,368 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2196 transitions. Word has length 207 [2018-12-08 17:25:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:41,368 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2196 transitions. [2018-12-08 17:25:41,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2196 transitions. [2018-12-08 17:25:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-08 17:25:41,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:41,369 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 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-08 17:25:41,370 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:41,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1559052287, now seen corresponding path program 1 times [2018-12-08 17:25:41,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:41,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:41,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-08 17:25:41,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:41,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:41,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:41,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:41,420 INFO L87 Difference]: Start difference. First operand 1575 states and 2196 transitions. Second operand 4 states. [2018-12-08 17:25:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:41,685 INFO L93 Difference]: Finished difference Result 3572 states and 5013 transitions. [2018-12-08 17:25:41,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:41,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-12-08 17:25:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:41,687 INFO L225 Difference]: With dead ends: 3572 [2018-12-08 17:25:41,687 INFO L226 Difference]: Without dead ends: 2013 [2018-12-08 17:25:41,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-12-08 17:25:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1695. [2018-12-08 17:25:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2018-12-08 17:25:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2358 transitions. [2018-12-08 17:25:41,743 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2358 transitions. Word has length 208 [2018-12-08 17:25:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:41,744 INFO L480 AbstractCegarLoop]: Abstraction has 1695 states and 2358 transitions. [2018-12-08 17:25:41,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2358 transitions. [2018-12-08 17:25:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-08 17:25:41,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:41,745 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 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-08 17:25:41,745 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:41,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1519761283, now seen corresponding path program 1 times [2018-12-08 17:25:41,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:41,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:41,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-08 17:25:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:41,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:41,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:41,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:41,804 INFO L87 Difference]: Start difference. First operand 1695 states and 2358 transitions. Second operand 4 states. [2018-12-08 17:25:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:42,105 INFO L93 Difference]: Finished difference Result 3686 states and 5169 transitions. [2018-12-08 17:25:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:42,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2018-12-08 17:25:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:42,107 INFO L225 Difference]: With dead ends: 3686 [2018-12-08 17:25:42,107 INFO L226 Difference]: Without dead ends: 2007 [2018-12-08 17:25:42,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-12-08 17:25:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1569. [2018-12-08 17:25:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2018-12-08 17:25:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2190 transitions. [2018-12-08 17:25:42,166 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2190 transitions. Word has length 208 [2018-12-08 17:25:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:42,166 INFO L480 AbstractCegarLoop]: Abstraction has 1569 states and 2190 transitions. [2018-12-08 17:25:42,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2190 transitions. [2018-12-08 17:25:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 17:25:42,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:42,167 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2018-12-08 17:25:42,168 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:42,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1014536305, now seen corresponding path program 1 times [2018-12-08 17:25:42,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-12-08 17:25:42,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:42,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:42,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:42,237 INFO L87 Difference]: Start difference. First operand 1569 states and 2190 transitions. Second operand 4 states. [2018-12-08 17:25:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:42,433 INFO L93 Difference]: Finished difference Result 3220 states and 4496 transitions. [2018-12-08 17:25:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:42,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-12-08 17:25:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:42,435 INFO L225 Difference]: With dead ends: 3220 [2018-12-08 17:25:42,435 INFO L226 Difference]: Without dead ends: 1667 [2018-12-08 17:25:42,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-08 17:25:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1611. [2018-12-08 17:25:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-12-08 17:25:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2256 transitions. [2018-12-08 17:25:42,503 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2256 transitions. Word has length 213 [2018-12-08 17:25:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:42,504 INFO L480 AbstractCegarLoop]: Abstraction has 1611 states and 2256 transitions. [2018-12-08 17:25:42,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2256 transitions. [2018-12-08 17:25:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-08 17:25:42,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:42,505 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 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] [2018-12-08 17:25:42,505 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:42,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1717600696, now seen corresponding path program 1 times [2018-12-08 17:25:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:42,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:42,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:42,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:42,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:42,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:42,570 INFO L87 Difference]: Start difference. First operand 1611 states and 2256 transitions. Second operand 4 states. [2018-12-08 17:25:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:42,847 INFO L93 Difference]: Finished difference Result 3644 states and 5127 transitions. [2018-12-08 17:25:42,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:42,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-08 17:25:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:42,848 INFO L225 Difference]: With dead ends: 3644 [2018-12-08 17:25:42,848 INFO L226 Difference]: Without dead ends: 2049 [2018-12-08 17:25:42,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2018-12-08 17:25:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1725. [2018-12-08 17:25:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2018-12-08 17:25:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2400 transitions. [2018-12-08 17:25:42,912 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2400 transitions. Word has length 225 [2018-12-08 17:25:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:42,912 INFO L480 AbstractCegarLoop]: Abstraction has 1725 states and 2400 transitions. [2018-12-08 17:25:42,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2400 transitions. [2018-12-08 17:25:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-08 17:25:42,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:42,914 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 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] [2018-12-08 17:25:42,914 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:42,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash -161530250, now seen corresponding path program 1 times [2018-12-08 17:25:42,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:42,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:42,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:42,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:42,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:42,974 INFO L87 Difference]: Start difference. First operand 1725 states and 2400 transitions. Second operand 4 states. [2018-12-08 17:25:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:43,260 INFO L93 Difference]: Finished difference Result 3758 states and 5265 transitions. [2018-12-08 17:25:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:43,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-08 17:25:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:43,262 INFO L225 Difference]: With dead ends: 3758 [2018-12-08 17:25:43,262 INFO L226 Difference]: Without dead ends: 2049 [2018-12-08 17:25:43,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2018-12-08 17:25:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1611. [2018-12-08 17:25:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-12-08 17:25:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2250 transitions. [2018-12-08 17:25:43,324 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2250 transitions. Word has length 225 [2018-12-08 17:25:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:43,325 INFO L480 AbstractCegarLoop]: Abstraction has 1611 states and 2250 transitions. [2018-12-08 17:25:43,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2250 transitions. [2018-12-08 17:25:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 17:25:43,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:43,326 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 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] [2018-12-08 17:25:43,326 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:43,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1202855721, now seen corresponding path program 1 times [2018-12-08 17:25:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:43,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:43,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:43,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:43,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:43,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:43,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:43,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:43,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:43,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:43,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:43,384 INFO L87 Difference]: Start difference. First operand 1611 states and 2250 transitions. Second operand 4 states. [2018-12-08 17:25:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:43,649 INFO L93 Difference]: Finished difference Result 3622 states and 5078 transitions. [2018-12-08 17:25:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:43,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-12-08 17:25:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:43,650 INFO L225 Difference]: With dead ends: 3622 [2018-12-08 17:25:43,650 INFO L226 Difference]: Without dead ends: 2027 [2018-12-08 17:25:43,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2018-12-08 17:25:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1731. [2018-12-08 17:25:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-12-08 17:25:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2400 transitions. [2018-12-08 17:25:43,717 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2400 transitions. Word has length 226 [2018-12-08 17:25:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:43,717 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2400 transitions. [2018-12-08 17:25:43,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2400 transitions. [2018-12-08 17:25:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-08 17:25:43,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:43,718 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 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] [2018-12-08 17:25:43,718 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:43,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash 673627097, now seen corresponding path program 1 times [2018-12-08 17:25:43,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:43,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:43,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:43,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:43,791 INFO L87 Difference]: Start difference. First operand 1731 states and 2400 transitions. Second operand 4 states. [2018-12-08 17:25:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:44,055 INFO L93 Difference]: Finished difference Result 3742 states and 5222 transitions. [2018-12-08 17:25:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:44,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-12-08 17:25:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:44,056 INFO L225 Difference]: With dead ends: 3742 [2018-12-08 17:25:44,056 INFO L226 Difference]: Without dead ends: 2027 [2018-12-08 17:25:44,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2018-12-08 17:25:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1611. [2018-12-08 17:25:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-12-08 17:25:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2244 transitions. [2018-12-08 17:25:44,122 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2244 transitions. Word has length 226 [2018-12-08 17:25:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:44,122 INFO L480 AbstractCegarLoop]: Abstraction has 1611 states and 2244 transitions. [2018-12-08 17:25:44,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2244 transitions. [2018-12-08 17:25:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-08 17:25:44,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:44,123 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-08 17:25:44,123 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:44,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1486974047, now seen corresponding path program 1 times [2018-12-08 17:25:44,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:44,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:44,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:44,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:44,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:44,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:44,197 INFO L87 Difference]: Start difference. First operand 1611 states and 2244 transitions. Second operand 4 states. [2018-12-08 17:25:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:44,405 INFO L93 Difference]: Finished difference Result 3448 states and 4790 transitions. [2018-12-08 17:25:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:44,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-12-08 17:25:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:44,407 INFO L225 Difference]: With dead ends: 3448 [2018-12-08 17:25:44,407 INFO L226 Difference]: Without dead ends: 1853 [2018-12-08 17:25:44,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2018-12-08 17:25:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1785. [2018-12-08 17:25:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-12-08 17:25:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2484 transitions. [2018-12-08 17:25:44,472 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2484 transitions. Word has length 238 [2018-12-08 17:25:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:44,472 INFO L480 AbstractCegarLoop]: Abstraction has 1785 states and 2484 transitions. [2018-12-08 17:25:44,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2484 transitions. [2018-12-08 17:25:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-08 17:25:44,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:44,474 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-08 17:25:44,474 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:44,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1206922143, now seen corresponding path program 1 times [2018-12-08 17:25:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:44,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-08 17:25:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:44,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:44,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:44,531 INFO L87 Difference]: Start difference. First operand 1785 states and 2484 transitions. Second operand 4 states. [2018-12-08 17:25:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:44,831 INFO L93 Difference]: Finished difference Result 4028 states and 5643 transitions. [2018-12-08 17:25:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:44,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-12-08 17:25:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:44,833 INFO L225 Difference]: With dead ends: 4028 [2018-12-08 17:25:44,833 INFO L226 Difference]: Without dead ends: 2259 [2018-12-08 17:25:44,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-12-08 17:25:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1911. [2018-12-08 17:25:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2018-12-08 17:25:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2652 transitions. [2018-12-08 17:25:44,901 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2652 transitions. Word has length 238 [2018-12-08 17:25:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:44,901 INFO L480 AbstractCegarLoop]: Abstraction has 1911 states and 2652 transitions. [2018-12-08 17:25:44,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2652 transitions. [2018-12-08 17:25:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-08 17:25:44,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:44,903 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-08 17:25:44,903 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:44,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1938889569, now seen corresponding path program 1 times [2018-12-08 17:25:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:44,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-08 17:25:45,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:45,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:45,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:45,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:45,009 INFO L87 Difference]: Start difference. First operand 1911 states and 2652 transitions. Second operand 4 states. [2018-12-08 17:25:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:45,311 INFO L93 Difference]: Finished difference Result 4280 states and 5979 transitions. [2018-12-08 17:25:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:45,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-12-08 17:25:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:45,313 INFO L225 Difference]: With dead ends: 4280 [2018-12-08 17:25:45,313 INFO L226 Difference]: Without dead ends: 2385 [2018-12-08 17:25:45,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2018-12-08 17:25:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1911. [2018-12-08 17:25:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2018-12-08 17:25:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2652 transitions. [2018-12-08 17:25:45,385 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2652 transitions. Word has length 238 [2018-12-08 17:25:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:45,385 INFO L480 AbstractCegarLoop]: Abstraction has 1911 states and 2652 transitions. [2018-12-08 17:25:45,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2652 transitions. [2018-12-08 17:25:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-08 17:25:45,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:45,386 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 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] [2018-12-08 17:25:45,386 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:45,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash 462533442, now seen corresponding path program 1 times [2018-12-08 17:25:45,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:45,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:45,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:45,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-08 17:25:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:45,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:45,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:45,471 INFO L87 Difference]: Start difference. First operand 1911 states and 2652 transitions. Second operand 4 states. [2018-12-08 17:25:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:45,768 INFO L93 Difference]: Finished difference Result 4244 states and 5925 transitions. [2018-12-08 17:25:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:45,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-12-08 17:25:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:45,770 INFO L225 Difference]: With dead ends: 4244 [2018-12-08 17:25:45,770 INFO L226 Difference]: Without dead ends: 2349 [2018-12-08 17:25:45,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2018-12-08 17:25:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2031. [2018-12-08 17:25:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2018-12-08 17:25:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2814 transitions. [2018-12-08 17:25:45,843 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2814 transitions. Word has length 239 [2018-12-08 17:25:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:45,843 INFO L480 AbstractCegarLoop]: Abstraction has 2031 states and 2814 transitions. [2018-12-08 17:25:45,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2814 transitions. [2018-12-08 17:25:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-08 17:25:45,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:45,844 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 4, 4, 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] [2018-12-08 17:25:45,844 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:45,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash -753620284, now seen corresponding path program 1 times [2018-12-08 17:25:45,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:45,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:45,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:45,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-08 17:25:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:45,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:45,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:45,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:45,943 INFO L87 Difference]: Start difference. First operand 2031 states and 2814 transitions. Second operand 4 states. [2018-12-08 17:25:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:46,251 INFO L93 Difference]: Finished difference Result 4358 states and 6081 transitions. [2018-12-08 17:25:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:46,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-12-08 17:25:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:46,253 INFO L225 Difference]: With dead ends: 4358 [2018-12-08 17:25:46,254 INFO L226 Difference]: Without dead ends: 2343 [2018-12-08 17:25:46,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2018-12-08 17:25:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1905. [2018-12-08 17:25:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2018-12-08 17:25:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2646 transitions. [2018-12-08 17:25:46,327 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2646 transitions. Word has length 239 [2018-12-08 17:25:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:46,327 INFO L480 AbstractCegarLoop]: Abstraction has 1905 states and 2646 transitions. [2018-12-08 17:25:46,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2646 transitions. [2018-12-08 17:25:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-08 17:25:46,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:46,328 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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-08 17:25:46,329 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:46,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1469277762, now seen corresponding path program 1 times [2018-12-08 17:25:46,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:46,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-08 17:25:46,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:46,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:46,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:46,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:46,396 INFO L87 Difference]: Start difference. First operand 1905 states and 2646 transitions. Second operand 4 states. [2018-12-08 17:25:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:46,652 INFO L93 Difference]: Finished difference Result 3958 states and 5516 transitions. [2018-12-08 17:25:46,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:46,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2018-12-08 17:25:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:46,654 INFO L225 Difference]: With dead ends: 3958 [2018-12-08 17:25:46,654 INFO L226 Difference]: Without dead ends: 2069 [2018-12-08 17:25:46,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-12-08 17:25:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1983. [2018-12-08 17:25:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-12-08 17:25:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2784 transitions. [2018-12-08 17:25:46,728 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2784 transitions. Word has length 243 [2018-12-08 17:25:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:46,729 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 2784 transitions. [2018-12-08 17:25:46,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2784 transitions. [2018-12-08 17:25:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-08 17:25:46,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:46,730 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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-08 17:25:46,730 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:46,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1672456041, now seen corresponding path program 1 times [2018-12-08 17:25:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:46,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:46,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-08 17:25:46,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:46,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:46,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:46,823 INFO L87 Difference]: Start difference. First operand 1983 states and 2784 transitions. Second operand 4 states. [2018-12-08 17:25:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:47,168 INFO L93 Difference]: Finished difference Result 4388 states and 6183 transitions. [2018-12-08 17:25:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:47,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-12-08 17:25:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:47,170 INFO L225 Difference]: With dead ends: 4388 [2018-12-08 17:25:47,170 INFO L226 Difference]: Without dead ends: 2421 [2018-12-08 17:25:47,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-12-08 17:25:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2097. [2018-12-08 17:25:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2018-12-08 17:25:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2928 transitions. [2018-12-08 17:25:47,248 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2928 transitions. Word has length 256 [2018-12-08 17:25:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:47,248 INFO L480 AbstractCegarLoop]: Abstraction has 2097 states and 2928 transitions. [2018-12-08 17:25:47,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2928 transitions. [2018-12-08 17:25:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-08 17:25:47,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:47,249 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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-08 17:25:47,249 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:47,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 743380309, now seen corresponding path program 1 times [2018-12-08 17:25:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:47,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:47,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-08 17:25:47,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:47,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:47,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:47,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:47,346 INFO L87 Difference]: Start difference. First operand 2097 states and 2928 transitions. Second operand 4 states. [2018-12-08 17:25:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:47,708 INFO L93 Difference]: Finished difference Result 4502 states and 6321 transitions. [2018-12-08 17:25:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:47,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-12-08 17:25:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:47,710 INFO L225 Difference]: With dead ends: 4502 [2018-12-08 17:25:47,710 INFO L226 Difference]: Without dead ends: 2421 [2018-12-08 17:25:47,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-12-08 17:25:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1983. [2018-12-08 17:25:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-12-08 17:25:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2778 transitions. [2018-12-08 17:25:47,791 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2778 transitions. Word has length 256 [2018-12-08 17:25:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:47,791 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 2778 transitions. [2018-12-08 17:25:47,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2778 transitions. [2018-12-08 17:25:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-08 17:25:47,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:47,792 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 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-08 17:25:47,792 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:47,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1079567832, now seen corresponding path program 1 times [2018-12-08 17:25:47,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:47,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:47,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-08 17:25:47,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:47,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:47,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:47,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:47,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:47,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:47,879 INFO L87 Difference]: Start difference. First operand 1983 states and 2778 transitions. Second operand 4 states. [2018-12-08 17:25:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:48,202 INFO L93 Difference]: Finished difference Result 4366 states and 6134 transitions. [2018-12-08 17:25:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:48,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-12-08 17:25:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:48,204 INFO L225 Difference]: With dead ends: 4366 [2018-12-08 17:25:48,204 INFO L226 Difference]: Without dead ends: 2399 [2018-12-08 17:25:48,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2018-12-08 17:25:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2103. [2018-12-08 17:25:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2018-12-08 17:25:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2928 transitions. [2018-12-08 17:25:48,284 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2928 transitions. Word has length 257 [2018-12-08 17:25:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:48,284 INFO L480 AbstractCegarLoop]: Abstraction has 2103 states and 2928 transitions. [2018-12-08 17:25:48,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2928 transitions. [2018-12-08 17:25:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-08 17:25:48,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:48,286 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 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-08 17:25:48,286 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:48,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1338916646, now seen corresponding path program 1 times [2018-12-08 17:25:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:48,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:48,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-08 17:25:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:48,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:48,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:48,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:48,373 INFO L87 Difference]: Start difference. First operand 2103 states and 2928 transitions. Second operand 4 states. [2018-12-08 17:25:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:48,684 INFO L93 Difference]: Finished difference Result 4486 states and 6278 transitions. [2018-12-08 17:25:48,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:48,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-12-08 17:25:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:48,686 INFO L225 Difference]: With dead ends: 4486 [2018-12-08 17:25:48,686 INFO L226 Difference]: Without dead ends: 2399 [2018-12-08 17:25:48,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2018-12-08 17:25:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1983. [2018-12-08 17:25:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-12-08 17:25:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2772 transitions. [2018-12-08 17:25:48,768 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2772 transitions. Word has length 257 [2018-12-08 17:25:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:48,768 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 2772 transitions. [2018-12-08 17:25:48,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2772 transitions. [2018-12-08 17:25:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-08 17:25:48,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:48,769 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:25:48,769 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:48,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash -452866657, now seen corresponding path program 1 times [2018-12-08 17:25:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:48,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:25:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-08 17:25:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:25:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:25:48,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:25:48,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:25:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:25:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:25:48,848 INFO L87 Difference]: Start difference. First operand 1983 states and 2772 transitions. Second operand 4 states. [2018-12-08 17:25:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:25:49,095 INFO L93 Difference]: Finished difference Result 4258 states and 5954 transitions. [2018-12-08 17:25:49,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:25:49,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2018-12-08 17:25:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:25:49,097 INFO L225 Difference]: With dead ends: 4258 [2018-12-08 17:25:49,097 INFO L226 Difference]: Without dead ends: 2291 [2018-12-08 17:25:49,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:25:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2018-12-08 17:25:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2193. [2018-12-08 17:25:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-12-08 17:25:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3084 transitions. [2018-12-08 17:25:49,180 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3084 transitions. Word has length 274 [2018-12-08 17:25:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:25:49,180 INFO L480 AbstractCegarLoop]: Abstraction has 2193 states and 3084 transitions. [2018-12-08 17:25:49,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:25:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3084 transitions. [2018-12-08 17:25:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-08 17:25:49,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:25:49,181 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:25:49,181 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:25:49,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:25:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1975391965, now seen corresponding path program 1 times [2018-12-08 17:25:49,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:25:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:25:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:25:49,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:25:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:25:50,537 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:25:50,584 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20494 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 17:25:50,584 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 17:25:50,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:25:50 BoogieIcfgContainer [2018-12-08 17:25:50,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:25:50,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:25:50,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:25:50,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:25:50,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:25:20" (3/4) ... [2018-12-08 17:25:50,652 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 17:25:50,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:25:50,653 INFO L168 Benchmark]: Toolchain (without parser) took 31550.85 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -255.5 MB). Peak memory consumption was 790.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:50,654 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:25:50,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:50,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.45 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-08 17:25:50,655 INFO L168 Benchmark]: Boogie Preprocessor took 46.10 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:50,655 INFO L168 Benchmark]: RCFGBuilder took 586.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:50,655 INFO L168 Benchmark]: TraceAbstraction took 30548.26 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -174.3 MB). Peak memory consumption was 734.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:50,655 INFO L168 Benchmark]: Witness Printer took 3.84 ms. Allocated memory is still 2.1 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:25:50,656 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.10 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 586.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30548.26 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -174.3 MB). Peak memory consumption was 734.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.84 ms. Allocated memory is still 2.1 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20494 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1334. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20550, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20496:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20545:0}, SSLv3_client_data={20496:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20496:0}, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=12292, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1249] EXPR s->version VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->version=0, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->init_buf={-2:3}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=12292, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20545:0}, s={20545:0}, s->state=4368, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4368, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4384, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->hit=0, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1330] s->init_num = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4384, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20543, (s->s3)->tmp.new_cipher={20516:0}, blastFlag=2, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=10, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4448 [L1392] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=5, s={20545:0}, s={20545:0}, s->state=4448, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1178] COND TRUE s->state == 4448 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(ret <= 0) [L1402] EXPR s->s3 [L1402] (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1402] COND FALSE !((s->s3)->tmp.cert_req) [L1405] s->state = 4480 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1407] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4448, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1178] COND FALSE !(s->state == 4448) [L1181] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1181] COND FALSE !(s->state == 4449) [L1184] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1184] COND FALSE !(s->state == 4464) [L1187] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1187] COND FALSE !(s->state == 4465) [L1190] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1190] COND FALSE !(s->state == 4466) [L1193] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1193] COND FALSE !(s->state == 4467) [L1196] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=1, s={20545:0}, s={20545:0}, s->state=4480, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1196] COND TRUE s->state == 4480 [L1424] ret = __VERIFIER_nondet_int() [L1425] COND FALSE !(ret <= 0) [L1430] EXPR s->s3 [L1430] EXPR (s->s3)->tmp.new_cipher [L1430] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1430] l = ((s->s3)->tmp.new_cipher)->algorithms [L1431] EXPR s->s3 [L1431] EXPR (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1431] COND FALSE !((s->s3)->tmp.cert_req == 1) [L1434] s->state = 4512 [L1435] EXPR s->s3 [L1435] (s->s3)->change_cipher_spec = 0 [L1437] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4480, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1178] COND FALSE !(s->state == 4448) [L1181] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1181] COND FALSE !(s->state == 4449) [L1184] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1184] COND FALSE !(s->state == 4464) [L1187] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1187] COND FALSE !(s->state == 4465) [L1190] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1190] COND FALSE !(s->state == 4466) [L1193] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1193] COND FALSE !(s->state == 4467) [L1196] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1196] COND FALSE !(s->state == 4480) [L1199] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1199] COND FALSE !(s->state == 4481) [L1202] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1202] COND FALSE !(s->state == 4496) [L1205] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1205] COND FALSE !(s->state == 4497) [L1208] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=6, s={20545:0}, s={20545:0}, s->state=4512, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1208] COND TRUE s->state == 4512 [L1453] ret = __VERIFIER_nondet_int() [L1454] COND FALSE !(ret <= 0) [L1459] s->state = 4528 [L1460] s->init_num = 0 [L1461] EXPR s->session [L1461] EXPR s->s3 [L1461] EXPR (s->s3)->tmp.new_cipher [L1461] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1462] EXPR s->s3 [L1462] EXPR (s->s3)->tmp.new_compression VAL [={1:0}, (s->s3)->tmp.new_compression={0:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1462] COND TRUE (unsigned long )(s->s3)->tmp.new_compression == (unsigned long )((void *)0) [L1463] EXPR s->session [L1463] (s->session)->compress_meth = 0 [L1467] COND FALSE !(! tmp___7) VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1473] COND FALSE !(! tmp___8) VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4512, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4400, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20543, (s->s3)->tmp.new_cipher={20516:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND FALSE !(blastFlag == 2) VAL [={1:0}, blastFlag=4, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1341] COND TRUE blastFlag == 4 [L1342] blastFlag = 5 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4400, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=1, s={20545:0}, s={20545:0}, s->state=4416, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND FALSE !(blastFlag == 3) VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20489, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->s3={20545:-394}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4416, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=11, s={20545:0}, s={20545:0}, s->state=4432, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 5 VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=0, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] [L1643] __VERIFIER_error() VAL [={1:0}, blastFlag=5, init=1, l=20543, ret=0, s={20545:0}, s={20545:0}, skip=0, SSLv3_client_data={20496:0}, state=4432, tmp=0, tmp___0={20545:84}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=1, tmp___8=1, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. UNSAFE Result, 30.5s OverallTime, 75 OverallIterations, 12 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15897 SDtfs, 6166 SDslu, 21717 SDs, 0 SdLazy, 14246 SolverSat, 672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4320 GetRequests, 3918 SyntacticMatches, 114 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2193occurred in iteration=74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 74 MinimizatonAttempts, 19211 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 13785 NumberOfCodeBlocks, 13785 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 15330 ConstructedInterpolants, 0 QuantifiedInterpolants, 5421943 SizeOfPredicates, 55 NumberOfNonLiveVariables, 8814 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 96 InterpolantComputations, 74 PerfectInterpolantSequences, 34421/34830 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:25:52,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:25:52,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:25:52,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:25:52,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:25:52,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:25:52,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:25:52,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:25:52,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:25:52,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:25:52,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:25:52,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:25:52,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:25:52,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:25:52,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:25:52,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:25:52,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:25:52,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:25:52,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:25:52,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:25:52,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:25:52,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:25:52,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:25:52,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:25:52,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:25:52,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:25:52,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:25:52,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:25:52,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:25:52,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:25:52,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:25:52,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:25:52,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:25:52,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:25:52,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:25:52,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:25:52,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 17:25:52,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:25:52,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:25:52,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:25:52,113 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:25:52,114 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:25:52,114 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:25:52,114 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:25:52,114 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:25:52,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:25:52,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:25:52,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:25:52,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:25:52,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:25:52,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:25:52,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:25:52,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:25:52,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:25:52,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:25:52,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:25:52,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:25:52,118 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 17:25:52,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:25:52,118 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 17:25:52,119 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 17:25:52,119 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_d01fc829-96e9-4fc0-9346-4d5e17894d3e/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 -> aa0b6fb4ce9f792dd8bac4a989726983813b4bce [2018-12-08 17:25:52,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:25:52,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:25:52,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:25:52,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:25:52,147 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:25:52,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c [2018-12-08 17:25:52,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/a659533bd/2850916b05c945bebae30957c114fccd/FLAG738496f06 [2018-12-08 17:25:52,612 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:25:52,613 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/sv-benchmarks/c/ssh/s3_clnt.blast.04_true-unreach-call.i.cil.c [2018-12-08 17:25:52,621 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/a659533bd/2850916b05c945bebae30957c114fccd/FLAG738496f06 [2018-12-08 17:25:52,629 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d01fc829-96e9-4fc0-9346-4d5e17894d3e/bin-2019/utaipan/data/a659533bd/2850916b05c945bebae30957c114fccd [2018-12-08 17:25:52,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:25:52,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:25:52,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:25:52,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:25:52,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:25:52,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:25:52" (1/1) ... [2018-12-08 17:25:52,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c700c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:25:52, skipping insertion in model container [2018-12-08 17:25:52,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:25:52" (1/1) ... [2018-12-08 17:25:52,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:25:52,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:25:52,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:25:52,890 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:25:52,986 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:25:52,987 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 17:25:52,989 INFO L168 Benchmark]: Toolchain (without parser) took 358.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:52,991 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:25:52,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:25:52,992 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...