java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:25:31,665 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:25:31,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:25:31,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:25:31,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:25:31,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:25:31,682 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:25:31,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:25:31,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:25:31,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:25:31,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:25:31,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:25:31,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:25:31,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:25:31,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:25:31,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:25:31,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:25:31,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:25:31,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:25:31,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:25:31,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:25:31,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:25:31,704 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:25:31,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:25:31,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:25:31,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:25:31,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:25:31,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:25:31,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:25:31,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:25:31,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:25:31,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:25:31,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:25:31,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:25:31,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:25:31,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:25:31,714 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:25:31,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:25:31,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:25:31,738 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:25:31,738 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:25:31,738 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:25:31,738 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:25:31,744 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:25:31,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:25:31,744 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:25:31,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:25:31,745 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:25:31,745 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:25:31,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:25:31,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:25:31,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:25:31,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:25:31,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:25:31,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:25:31,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:25:31,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:25:31,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:25:31,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:25:31,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:25:31,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:25:31,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:25:31,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:25:31,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:25:31,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:25:31,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:25:31,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:25:31,750 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:25:31,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:25:31,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:25:31,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:25:31,750 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:25:31,751 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:25:31,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:25:31,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:25:31,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:25:31,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:25:31,823 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:25:31,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-07 10:25:31,898 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9df2d9a/e06c9b2e6ff2482ca910516fd80b13fb/FLAG5b19209cb [2018-11-07 10:25:32,479 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:25:32,480 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-07 10:25:32,517 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9df2d9a/e06c9b2e6ff2482ca910516fd80b13fb/FLAG5b19209cb [2018-11-07 10:25:32,539 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9df2d9a/e06c9b2e6ff2482ca910516fd80b13fb [2018-11-07 10:25:32,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:25:32,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:25:32,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:32,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:25:32,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:25:32,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:32" (1/1) ... [2018-11-07 10:25:32,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e3c491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:32, skipping insertion in model container [2018-11-07 10:25:32,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:25:32" (1/1) ... [2018-11-07 10:25:32,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:25:32,657 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:25:33,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:33,675 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:25:34,290 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:25:34,313 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:25:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34 WrapperNode [2018-11-07 10:25:34,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:25:34,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:34,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:25:34,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:25:34,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:25:34,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:25:34,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:25:34,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:25:34,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... [2018-11-07 10:25:34,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:25:34,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:25:34,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:25:34,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:25:34,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:25:34,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-07 10:25:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:25:34,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:25:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 10:25:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-07 10:25:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:25:34,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:25:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:25:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:25:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:25:34,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:25:34,638 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-07 10:25:34,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-07 10:25:34,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:25:35,209 WARN L671 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-07 10:25:35,210 WARN L636 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-07 10:25:36,812 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:25:36,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:36 BoogieIcfgContainer [2018-11-07 10:25:36,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:25:36,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:25:36,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:25:36,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:25:36,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:25:32" (1/3) ... [2018-11-07 10:25:36,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282bb3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:36, skipping insertion in model container [2018-11-07 10:25:36,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:25:34" (2/3) ... [2018-11-07 10:25:36,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282bb3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:25:36, skipping insertion in model container [2018-11-07 10:25:36,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:25:36" (3/3) ... [2018-11-07 10:25:36,822 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-07 10:25:36,832 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:25:36,841 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:25:36,860 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:25:36,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:25:36,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:25:36,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:25:36,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:25:36,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:25:36,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:25:36,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:25:36,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:25:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2018-11-07 10:25:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 10:25:36,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:36,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:36,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:36,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -622699886, now seen corresponding path program 1 times [2018-11-07 10:25:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:37,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:37,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:25:37,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:37,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:25:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:25:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:37,521 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2018-11-07 10:25:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:37,739 INFO L93 Difference]: Finished difference Result 908 states and 1160 transitions. [2018-11-07 10:25:37,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:25:37,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-07 10:25:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:37,774 INFO L225 Difference]: With dead ends: 908 [2018-11-07 10:25:37,775 INFO L226 Difference]: Without dead ends: 556 [2018-11-07 10:25:37,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-11-07 10:25:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2018-11-07 10:25:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-11-07 10:25:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 660 transitions. [2018-11-07 10:25:37,884 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 660 transitions. Word has length 94 [2018-11-07 10:25:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:37,885 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 660 transitions. [2018-11-07 10:25:37,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:25:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 660 transitions. [2018-11-07 10:25:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 10:25:37,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:37,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:37,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:37,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:37,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1096017335, now seen corresponding path program 1 times [2018-11-07 10:25:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:37,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:37,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:38,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:38,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:38,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:38,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:38,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:38,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:38,287 INFO L87 Difference]: Start difference. First operand 556 states and 660 transitions. Second operand 4 states. [2018-11-07 10:25:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:39,374 INFO L93 Difference]: Finished difference Result 866 states and 1041 transitions. [2018-11-07 10:25:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:39,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-07 10:25:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:39,379 INFO L225 Difference]: With dead ends: 866 [2018-11-07 10:25:39,379 INFO L226 Difference]: Without dead ends: 617 [2018-11-07 10:25:39,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-07 10:25:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 587. [2018-11-07 10:25:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-07 10:25:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2018-11-07 10:25:39,415 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 123 [2018-11-07 10:25:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:39,416 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2018-11-07 10:25:39,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2018-11-07 10:25:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 10:25:39,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:39,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:39,420 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:39,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 722301852, now seen corresponding path program 1 times [2018-11-07 10:25:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:39,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:25:39,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:39,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:25:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:25:39,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:25:39,783 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2018-11-07 10:25:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:41,012 INFO L93 Difference]: Finished difference Result 1226 states and 1490 transitions. [2018-11-07 10:25:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:25:41,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-07 10:25:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:41,026 INFO L225 Difference]: With dead ends: 1226 [2018-11-07 10:25:41,026 INFO L226 Difference]: Without dead ends: 946 [2018-11-07 10:25:41,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-11-07 10:25:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 591. [2018-11-07 10:25:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-11-07 10:25:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2018-11-07 10:25:41,067 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 133 [2018-11-07 10:25:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:41,068 INFO L480 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2018-11-07 10:25:41,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:25:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2018-11-07 10:25:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 10:25:41,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:41,071 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:41,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:41,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash 430084978, now seen corresponding path program 1 times [2018-11-07 10:25:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:41,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:41,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:41,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:41,442 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 4 states. [2018-11-07 10:25:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:42,350 INFO L93 Difference]: Finished difference Result 923 states and 1116 transitions. [2018-11-07 10:25:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:42,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-07 10:25:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:42,356 INFO L225 Difference]: With dead ends: 923 [2018-11-07 10:25:42,356 INFO L226 Difference]: Without dead ends: 639 [2018-11-07 10:25:42,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-07 10:25:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 600. [2018-11-07 10:25:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-07 10:25:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 717 transitions. [2018-11-07 10:25:42,380 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 717 transitions. Word has length 151 [2018-11-07 10:25:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 717 transitions. [2018-11-07 10:25:42,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 717 transitions. [2018-11-07 10:25:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 10:25:42,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:42,385 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:42,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:42,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash 100694125, now seen corresponding path program 1 times [2018-11-07 10:25:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:42,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:42,388 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:25:42,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:42,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:42,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:42,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:42,786 INFO L87 Difference]: Start difference. First operand 600 states and 717 transitions. Second operand 4 states. [2018-11-07 10:25:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:44,149 INFO L93 Difference]: Finished difference Result 932 states and 1125 transitions. [2018-11-07 10:25:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-07 10:25:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:44,156 INFO L225 Difference]: With dead ends: 932 [2018-11-07 10:25:44,156 INFO L226 Difference]: Without dead ends: 639 [2018-11-07 10:25:44,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-07 10:25:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 602. [2018-11-07 10:25:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-07 10:25:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 719 transitions. [2018-11-07 10:25:44,174 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 719 transitions. Word has length 153 [2018-11-07 10:25:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:44,175 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 719 transitions. [2018-11-07 10:25:44,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 719 transitions. [2018-11-07 10:25:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 10:25:44,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:44,177 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:44,178 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:44,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -290554180, now seen corresponding path program 1 times [2018-11-07 10:25:44,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:44,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:44,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:44,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:44,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-07 10:25:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:25:44,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:44,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:25:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:25:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:44,343 INFO L87 Difference]: Start difference. First operand 602 states and 719 transitions. Second operand 3 states. [2018-11-07 10:25:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:44,433 INFO L93 Difference]: Finished difference Result 1190 states and 1440 transitions. [2018-11-07 10:25:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:25:44,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-07 10:25:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:44,438 INFO L225 Difference]: With dead ends: 1190 [2018-11-07 10:25:44,438 INFO L226 Difference]: Without dead ends: 895 [2018-11-07 10:25:44,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-11-07 10:25:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2018-11-07 10:25:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-07 10:25:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1076 transitions. [2018-11-07 10:25:44,461 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1076 transitions. Word has length 154 [2018-11-07 10:25:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:44,461 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1076 transitions. [2018-11-07 10:25:44,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:25:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1076 transitions. [2018-11-07 10:25:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 10:25:44,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:44,466 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:44,466 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:44,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash -556732237, now seen corresponding path program 1 times [2018-11-07 10:25:44,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:44,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:44,468 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-07 10:25:44,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:25:44,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:44,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:25:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:25:44,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:44,631 INFO L87 Difference]: Start difference. First operand 895 states and 1076 transitions. Second operand 3 states. [2018-11-07 10:25:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:44,969 INFO L93 Difference]: Finished difference Result 1190 states and 1437 transitions. [2018-11-07 10:25:44,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:25:44,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-07 10:25:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:44,976 INFO L225 Difference]: With dead ends: 1190 [2018-11-07 10:25:44,977 INFO L226 Difference]: Without dead ends: 1188 [2018-11-07 10:25:44,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-11-07 10:25:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2018-11-07 10:25:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2018-11-07 10:25:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1434 transitions. [2018-11-07 10:25:45,009 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1434 transitions. Word has length 190 [2018-11-07 10:25:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:45,009 INFO L480 AbstractCegarLoop]: Abstraction has 1188 states and 1434 transitions. [2018-11-07 10:25:45,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:25:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1434 transitions. [2018-11-07 10:25:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 10:25:45,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:45,015 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:45,015 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:45,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 711607080, now seen corresponding path program 1 times [2018-11-07 10:25:45,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:45,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:45,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:45,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:45,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:25:45,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:25:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:25:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:45,190 INFO L87 Difference]: Start difference. First operand 1188 states and 1434 transitions. Second operand 3 states. [2018-11-07 10:25:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:45,397 INFO L93 Difference]: Finished difference Result 2062 states and 2502 transitions. [2018-11-07 10:25:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:25:45,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-11-07 10:25:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:45,404 INFO L225 Difference]: With dead ends: 2062 [2018-11-07 10:25:45,404 INFO L226 Difference]: Without dead ends: 1181 [2018-11-07 10:25:45,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:25:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-11-07 10:25:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2018-11-07 10:25:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-07 10:25:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1420 transitions. [2018-11-07 10:25:45,432 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1420 transitions. Word has length 229 [2018-11-07 10:25:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:45,433 INFO L480 AbstractCegarLoop]: Abstraction has 1181 states and 1420 transitions. [2018-11-07 10:25:45,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:25:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1420 transitions. [2018-11-07 10:25:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-07 10:25:45,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:45,438 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:45,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:45,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash 227512926, now seen corresponding path program 1 times [2018-11-07 10:25:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:45,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:45,810 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:45,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:45,812 INFO L87 Difference]: Start difference. First operand 1181 states and 1420 transitions. Second operand 4 states. [2018-11-07 10:25:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:46,783 INFO L93 Difference]: Finished difference Result 2646 states and 3219 transitions. [2018-11-07 10:25:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:46,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-11-07 10:25:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:46,793 INFO L225 Difference]: With dead ends: 2646 [2018-11-07 10:25:46,793 INFO L226 Difference]: Without dead ends: 1531 [2018-11-07 10:25:46,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-11-07 10:25:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1353. [2018-11-07 10:25:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-11-07 10:25:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1664 transitions. [2018-11-07 10:25:46,829 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1664 transitions. Word has length 233 [2018-11-07 10:25:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:46,829 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1664 transitions. [2018-11-07 10:25:46,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1664 transitions. [2018-11-07 10:25:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 10:25:46,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:46,835 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:46,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:46,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1502014595, now seen corresponding path program 1 times [2018-11-07 10:25:46,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:46,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:47,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:47,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:25:47,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:47,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:25:47,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:25:47,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:25:47,628 INFO L87 Difference]: Start difference. First operand 1353 states and 1664 transitions. Second operand 6 states. [2018-11-07 10:25:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:48,895 INFO L93 Difference]: Finished difference Result 4368 states and 5386 transitions. [2018-11-07 10:25:48,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:25:48,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2018-11-07 10:25:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:48,908 INFO L225 Difference]: With dead ends: 4368 [2018-11-07 10:25:48,908 INFO L226 Difference]: Without dead ends: 3081 [2018-11-07 10:25:48,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-11-07 10:25:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 1369. [2018-11-07 10:25:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-07 10:25:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1680 transitions. [2018-11-07 10:25:48,964 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1680 transitions. Word has length 243 [2018-11-07 10:25:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:48,965 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 1680 transitions. [2018-11-07 10:25:48,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:25:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1680 transitions. [2018-11-07 10:25:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 10:25:48,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:48,971 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:48,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:48,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash 147785497, now seen corresponding path program 1 times [2018-11-07 10:25:48,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:48,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-07 10:25:49,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:49,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:49,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:49,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:49,373 INFO L87 Difference]: Start difference. First operand 1369 states and 1680 transitions. Second operand 4 states. [2018-11-07 10:25:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:49,992 INFO L93 Difference]: Finished difference Result 3350 states and 4149 transitions. [2018-11-07 10:25:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-07 10:25:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:50,007 INFO L225 Difference]: With dead ends: 3350 [2018-11-07 10:25:50,007 INFO L226 Difference]: Without dead ends: 2047 [2018-11-07 10:25:50,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-11-07 10:25:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1513. [2018-11-07 10:25:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-11-07 10:25:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1880 transitions. [2018-11-07 10:25:50,064 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1880 transitions. Word has length 261 [2018-11-07 10:25:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:50,064 INFO L480 AbstractCegarLoop]: Abstraction has 1513 states and 1880 transitions. [2018-11-07 10:25:50,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1880 transitions. [2018-11-07 10:25:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-07 10:25:50,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:50,071 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:50,071 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 329607865, now seen corresponding path program 1 times [2018-11-07 10:25:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:50,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:50,448 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:50,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:50,449 INFO L87 Difference]: Start difference. First operand 1513 states and 1880 transitions. Second operand 4 states. [2018-11-07 10:25:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:51,054 INFO L93 Difference]: Finished difference Result 3258 states and 4063 transitions. [2018-11-07 10:25:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:51,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-07 10:25:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:51,064 INFO L225 Difference]: With dead ends: 3258 [2018-11-07 10:25:51,064 INFO L226 Difference]: Without dead ends: 1811 [2018-11-07 10:25:51,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-07 10:25:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1549. [2018-11-07 10:25:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-11-07 10:25:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1920 transitions. [2018-11-07 10:25:51,110 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1920 transitions. Word has length 261 [2018-11-07 10:25:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:51,111 INFO L480 AbstractCegarLoop]: Abstraction has 1549 states and 1920 transitions. [2018-11-07 10:25:51,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1920 transitions. [2018-11-07 10:25:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 10:25:51,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:51,117 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:51,117 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:51,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 310860276, now seen corresponding path program 1 times [2018-11-07 10:25:51,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:51,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:51,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:51,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:51,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:51,309 INFO L87 Difference]: Start difference. First operand 1549 states and 1920 transitions. Second operand 4 states. [2018-11-07 10:25:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:51,925 INFO L93 Difference]: Finished difference Result 3294 states and 4099 transitions. [2018-11-07 10:25:51,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:51,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-11-07 10:25:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:51,934 INFO L225 Difference]: With dead ends: 3294 [2018-11-07 10:25:51,934 INFO L226 Difference]: Without dead ends: 1811 [2018-11-07 10:25:51,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-07 10:25:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1557. [2018-11-07 10:25:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2018-11-07 10:25:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1928 transitions. [2018-11-07 10:25:51,981 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1928 transitions. Word has length 263 [2018-11-07 10:25:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:51,981 INFO L480 AbstractCegarLoop]: Abstraction has 1557 states and 1928 transitions. [2018-11-07 10:25:51,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1928 transitions. [2018-11-07 10:25:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-07 10:25:51,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:51,988 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:51,988 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:51,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 397866307, now seen corresponding path program 1 times [2018-11-07 10:25:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:51,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 249 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 10:25:52,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:52,231 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:52,232 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-07 10:25:52,233 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [31], [32], [33], [34], [35], [36], [37], [38], [39], [42], [43], [44], [58], [59], [60], [71], [75], [81], [83], [84], [85], [90], [91], [96], [97], [102], [103], [108], [109], [114], [115], [118], [120], [121], [126], [127], [130], [132], [133], [138], [139], [142], [144], [145], [150], [151], [154], [156], [157], [162], [163], [168], [169], [174], [175], [178], [337], [338], [341], [349], [350], [351], [352], [353], [356], [361], [364], [366], [372], [373], [376], [377], [379], [380], [382], [384], [385], [386], [391], [394], [402], [404], [405], [407], [410], [418], [419], [420], [421], [426], [442], [445], [678], [679], [719], [721], [735], [738], [739], [740], [741], [742], [743], [744], [745], [746], [747], [748], [752], [753], [754], [756] [2018-11-07 10:25:52,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:52,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:52,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:52,962 INFO L272 AbstractInterpreter]: Visited 140 different actions 321 times. Merged at 61 different actions 165 times. Never widened. Found 15 fixpoints after 12 different actions. Largest state had 96 variables. [2018-11-07 10:25:53,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:53,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:53,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:53,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:53,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:53,035 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:53,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:53,298 INFO L477 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 13 treesize of output 10 [2018-11-07 10:25:53,315 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-07 10:25:53,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-07 10:25:53,358 INFO L477 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 23 treesize of output 18 [2018-11-07 10:25:53,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:53,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:53,426 INFO L477 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-11-07 10:25:53,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-07 10:25:53,796 INFO L477 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-11-07 10:25:53,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:53,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:53,860 INFO L477 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-11-07 10:25:53,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:53,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-11-07 10:25:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:54,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:54,710 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:25:54,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-11-07 10:25:54,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:54,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:25:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:25:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:25:54,711 INFO L87 Difference]: Start difference. First operand 1557 states and 1928 transitions. Second operand 5 states. [2018-11-07 10:25:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:55,750 INFO L93 Difference]: Finished difference Result 3306 states and 4107 transitions. [2018-11-07 10:25:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:55,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-11-07 10:25:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:55,762 INFO L225 Difference]: With dead ends: 3306 [2018-11-07 10:25:55,762 INFO L226 Difference]: Without dead ends: 1815 [2018-11-07 10:25:55,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 529 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-11-07 10:25:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1597. [2018-11-07 10:25:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1597 states. [2018-11-07 10:25:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 1984 transitions. [2018-11-07 10:25:55,821 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 1984 transitions. Word has length 264 [2018-11-07 10:25:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:55,822 INFO L480 AbstractCegarLoop]: Abstraction has 1597 states and 1984 transitions. [2018-11-07 10:25:55,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:25:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1984 transitions. [2018-11-07 10:25:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-07 10:25:55,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:55,826 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:55,827 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:55,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1940932229, now seen corresponding path program 1 times [2018-11-07 10:25:55,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:55,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:55,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:56,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:56,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:56,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:56,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:56,163 INFO L87 Difference]: Start difference. First operand 1597 states and 1984 transitions. Second operand 4 states. [2018-11-07 10:25:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:56,795 INFO L93 Difference]: Finished difference Result 3334 states and 4147 transitions. [2018-11-07 10:25:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:56,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-11-07 10:25:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:56,805 INFO L225 Difference]: With dead ends: 3334 [2018-11-07 10:25:56,806 INFO L226 Difference]: Without dead ends: 1803 [2018-11-07 10:25:56,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-07 10:25:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1597. [2018-11-07 10:25:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1597 states. [2018-11-07 10:25:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 1980 transitions. [2018-11-07 10:25:56,852 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 1980 transitions. Word has length 265 [2018-11-07 10:25:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:56,853 INFO L480 AbstractCegarLoop]: Abstraction has 1597 states and 1980 transitions. [2018-11-07 10:25:56,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1980 transitions. [2018-11-07 10:25:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-07 10:25:56,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:56,857 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:56,858 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:56,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1669524911, now seen corresponding path program 1 times [2018-11-07 10:25:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:56,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:57,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:57,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:57,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:57,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:57,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:57,053 INFO L87 Difference]: Start difference. First operand 1597 states and 1980 transitions. Second operand 4 states. [2018-11-07 10:25:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:57,477 INFO L93 Difference]: Finished difference Result 3334 states and 4139 transitions. [2018-11-07 10:25:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:25:57,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-11-07 10:25:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:57,488 INFO L225 Difference]: With dead ends: 3334 [2018-11-07 10:25:57,488 INFO L226 Difference]: Without dead ends: 1803 [2018-11-07 10:25:57,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:25:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-07 10:25:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1597. [2018-11-07 10:25:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1597 states. [2018-11-07 10:25:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 1976 transitions. [2018-11-07 10:25:57,534 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 1976 transitions. Word has length 265 [2018-11-07 10:25:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:57,535 INFO L480 AbstractCegarLoop]: Abstraction has 1597 states and 1976 transitions. [2018-11-07 10:25:57,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:25:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1976 transitions. [2018-11-07 10:25:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-07 10:25:57,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:57,540 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:57,540 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:57,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 824806568, now seen corresponding path program 1 times [2018-11-07 10:25:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:57,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:57,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:57,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 251 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-07 10:25:58,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:58,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:25:58,194 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-11-07 10:25:58,194 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [31], [32], [33], [34], [35], [36], [37], [38], [39], [42], [43], [44], [58], [59], [60], [71], [75], [81], [83], [84], [85], [90], [91], [96], [97], [102], [103], [108], [109], [114], [115], [118], [120], [121], [126], [127], [130], [132], [133], [136], [138], [139], [142], [144], [145], [150], [151], [154], [156], [157], [162], [163], [168], [169], [174], [175], [178], [337], [338], [341], [349], [350], [351], [352], [353], [356], [361], [364], [366], [372], [373], [376], [377], [379], [380], [382], [384], [385], [386], [391], [394], [402], [404], [405], [407], [410], [418], [419], [420], [421], [426], [442], [445], [678], [679], [719], [721], [735], [738], [739], [740], [741], [742], [743], [744], [745], [746], [747], [748], [752], [753], [754], [756] [2018-11-07 10:25:58,200 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:25:58,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:25:58,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:25:58,518 INFO L272 AbstractInterpreter]: Visited 141 different actions 325 times. Merged at 61 different actions 165 times. Never widened. Found 19 fixpoints after 13 different actions. Largest state had 96 variables. [2018-11-07 10:25:58,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:58,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:25:58,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:25:58,558 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:25:58,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:58,575 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:25:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:58,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:25:58,703 INFO L477 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 13 treesize of output 10 [2018-11-07 10:25:58,707 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-07 10:25:58,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-07 10:25:58,737 INFO L477 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 23 treesize of output 18 [2018-11-07 10:25:58,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:58,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:58,744 INFO L477 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-11-07 10:25:58,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-07 10:25:58,777 INFO L477 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-11-07 10:25:58,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:58,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:25:58,789 INFO L477 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-11-07 10:25:58,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:25:58,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-11-07 10:25:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:58,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:25:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:25:59,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-11-07 10:25:59,078 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:59,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:25:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:25:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:25:59,079 INFO L87 Difference]: Start difference. First operand 1597 states and 1976 transitions. Second operand 5 states. [2018-11-07 10:25:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:25:59,544 INFO L93 Difference]: Finished difference Result 3310 states and 4101 transitions. [2018-11-07 10:25:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:25:59,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-11-07 10:25:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:25:59,554 INFO L225 Difference]: With dead ends: 3310 [2018-11-07 10:25:59,555 INFO L226 Difference]: Without dead ends: 1779 [2018-11-07 10:25:59,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 533 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:25:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2018-11-07 10:25:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1605. [2018-11-07 10:25:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-11-07 10:25:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1984 transitions. [2018-11-07 10:25:59,602 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1984 transitions. Word has length 266 [2018-11-07 10:25:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:25:59,602 INFO L480 AbstractCegarLoop]: Abstraction has 1605 states and 1984 transitions. [2018-11-07 10:25:59,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:25:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1984 transitions. [2018-11-07 10:25:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-07 10:25:59,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:25:59,607 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:25:59,607 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:25:59,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:25:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash -423557654, now seen corresponding path program 1 times [2018-11-07 10:25:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:25:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:25:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:25:59,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:25:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:25:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:25:59,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:25:59,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:25:59,850 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:25:59,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:25:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:25:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:25:59,851 INFO L87 Difference]: Start difference. First operand 1605 states and 1984 transitions. Second operand 4 states. [2018-11-07 10:26:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:00,142 INFO L93 Difference]: Finished difference Result 3262 states and 4041 transitions. [2018-11-07 10:26:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:26:00,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-07 10:26:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:00,154 INFO L225 Difference]: With dead ends: 3262 [2018-11-07 10:26:00,154 INFO L226 Difference]: Without dead ends: 1723 [2018-11-07 10:26:00,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-07 10:26:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1605. [2018-11-07 10:26:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-11-07 10:26:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1980 transitions. [2018-11-07 10:26:00,203 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1980 transitions. Word has length 267 [2018-11-07 10:26:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:00,203 INFO L480 AbstractCegarLoop]: Abstraction has 1605 states and 1980 transitions. [2018-11-07 10:26:00,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:26:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1980 transitions. [2018-11-07 10:26:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-07 10:26:00,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:00,209 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:00,209 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:00,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1585192447, now seen corresponding path program 1 times [2018-11-07 10:26:00,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:00,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:00,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:00,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:00,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:26:00,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:00,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:26:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:26:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:26:00,412 INFO L87 Difference]: Start difference. First operand 1605 states and 1980 transitions. Second operand 4 states. [2018-11-07 10:26:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:00,885 INFO L93 Difference]: Finished difference Result 3262 states and 4033 transitions. [2018-11-07 10:26:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:26:00,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-07 10:26:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:00,892 INFO L225 Difference]: With dead ends: 3262 [2018-11-07 10:26:00,893 INFO L226 Difference]: Without dead ends: 1723 [2018-11-07 10:26:00,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-07 10:26:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1613. [2018-11-07 10:26:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-11-07 10:26:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 1988 transitions. [2018-11-07 10:26:00,937 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 1988 transitions. Word has length 267 [2018-11-07 10:26:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 1613 states and 1988 transitions. [2018-11-07 10:26:00,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:26:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1988 transitions. [2018-11-07 10:26:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-07 10:26:00,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:00,942 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:00,942 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1582067450, now seen corresponding path program 1 times [2018-11-07 10:26:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:00,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:00,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:01,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:01,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:26:01,305 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:01,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:26:01,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:26:01,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:26:01,307 INFO L87 Difference]: Start difference. First operand 1613 states and 1988 transitions. Second operand 4 states. [2018-11-07 10:26:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:02,057 INFO L93 Difference]: Finished difference Result 3242 states and 4003 transitions. [2018-11-07 10:26:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:26:02,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-11-07 10:26:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:02,063 INFO L225 Difference]: With dead ends: 3242 [2018-11-07 10:26:02,063 INFO L226 Difference]: Without dead ends: 1695 [2018-11-07 10:26:02,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:26:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2018-11-07 10:26:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1621. [2018-11-07 10:26:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2018-11-07 10:26:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1996 transitions. [2018-11-07 10:26:02,105 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1996 transitions. Word has length 269 [2018-11-07 10:26:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:02,105 INFO L480 AbstractCegarLoop]: Abstraction has 1621 states and 1996 transitions. [2018-11-07 10:26:02,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:26:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1996 transitions. [2018-11-07 10:26:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 10:26:02,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:02,110 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:02,110 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:02,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash -762461346, now seen corresponding path program 1 times [2018-11-07 10:26:02,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:02,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:02,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:02,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:26:02,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:02,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:26:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:26:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:26:02,361 INFO L87 Difference]: Start difference. First operand 1621 states and 1996 transitions. Second operand 6 states. [2018-11-07 10:26:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:03,009 INFO L93 Difference]: Finished difference Result 4784 states and 5874 transitions. [2018-11-07 10:26:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:26:03,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2018-11-07 10:26:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:03,018 INFO L225 Difference]: With dead ends: 4784 [2018-11-07 10:26:03,019 INFO L226 Difference]: Without dead ends: 3229 [2018-11-07 10:26:03,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:26:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-11-07 10:26:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 1621. [2018-11-07 10:26:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2018-11-07 10:26:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1992 transitions. [2018-11-07 10:26:03,070 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1992 transitions. Word has length 271 [2018-11-07 10:26:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:03,070 INFO L480 AbstractCegarLoop]: Abstraction has 1621 states and 1992 transitions. [2018-11-07 10:26:03,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:26:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1992 transitions. [2018-11-07 10:26:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-07 10:26:03,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:03,075 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:03,075 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:03,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1195631271, now seen corresponding path program 1 times [2018-11-07 10:26:03,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:03,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:03,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:26:03,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:03,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:26:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:26:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:26:03,327 INFO L87 Difference]: Start difference. First operand 1621 states and 1992 transitions. Second operand 6 states. [2018-11-07 10:26:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:04,344 INFO L93 Difference]: Finished difference Result 4784 states and 5866 transitions. [2018-11-07 10:26:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:26:04,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2018-11-07 10:26:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:04,355 INFO L225 Difference]: With dead ends: 4784 [2018-11-07 10:26:04,355 INFO L226 Difference]: Without dead ends: 3229 [2018-11-07 10:26:04,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:26:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-11-07 10:26:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 1621. [2018-11-07 10:26:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2018-11-07 10:26:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1988 transitions. [2018-11-07 10:26:04,408 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1988 transitions. Word has length 273 [2018-11-07 10:26:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:04,408 INFO L480 AbstractCegarLoop]: Abstraction has 1621 states and 1988 transitions. [2018-11-07 10:26:04,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:26:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1988 transitions. [2018-11-07 10:26:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 10:26:04,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:04,413 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:04,413 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:04,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 941268606, now seen corresponding path program 1 times [2018-11-07 10:26:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:04,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:04,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:04,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 249 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 10:26:05,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:05,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:05,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-11-07 10:26:05,133 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [31], [32], [33], [34], [35], [36], [37], [38], [39], [42], [43], [44], [58], [59], [60], [71], [75], [81], [83], [84], [85], [90], [91], [96], [97], [102], [103], [108], [109], [114], [115], [118], [120], [121], [126], [127], [130], [132], [133], [138], [139], [142], [144], [145], [150], [151], [154], [156], [157], [162], [163], [168], [169], [174], [175], [178], [337], [338], [341], [349], [350], [351], [352], [353], [356], [361], [364], [366], [372], [373], [376], [377], [379], [380], [382], [384], [385], [386], [391], [394], [402], [404], [405], [407], [410], [418], [419], [420], [421], [426], [442], [445], [678], [679], [682], [685], [686], [696], [700], [701], [704], [705], [706], [707], [708], [719], [721], [735], [738], [739], [740], [741], [742], [743], [744], [745], [746], [747], [748], [752], [753], [754], [756] [2018-11-07 10:26:05,144 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:05,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:05,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:26:05,505 INFO L272 AbstractInterpreter]: Visited 151 different actions 354 times. Merged at 71 different actions 185 times. Never widened. Found 18 fixpoints after 13 different actions. Largest state had 99 variables. [2018-11-07 10:26:05,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:05,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:26:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:05,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:26:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:05,561 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:05,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:05,716 INFO L477 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 13 treesize of output 10 [2018-11-07 10:26:05,732 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-07 10:26:05,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-07 10:26:05,943 INFO L477 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 23 treesize of output 18 [2018-11-07 10:26:05,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:26:05,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:26:05,965 INFO L477 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-11-07 10:26:05,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:05,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-07 10:26:05,997 INFO L477 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-11-07 10:26:06,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:26:06,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:26:06,009 INFO L477 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-11-07 10:26:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-11-07 10:26:06,036 INFO L477 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 13 treesize of output 10 [2018-11-07 10:26:06,043 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-07 10:26:06,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-07 10:26:06,066 INFO L477 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 19 treesize of output 15 [2018-11-07 10:26:06,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-07 10:26:06,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:26:06,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-07 10:26:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:06,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-07 10:26:06,941 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:26:06,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [5] total 14 [2018-11-07 10:26:06,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:06,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:26:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:26:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:26:06,943 INFO L87 Difference]: Start difference. First operand 1621 states and 1988 transitions. Second operand 7 states. [2018-11-07 10:26:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:07,868 INFO L93 Difference]: Finished difference Result 4866 states and 5951 transitions. [2018-11-07 10:26:07,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:26:07,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-11-07 10:26:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:07,875 INFO L225 Difference]: With dead ends: 4866 [2018-11-07 10:26:07,875 INFO L226 Difference]: Without dead ends: 3311 [2018-11-07 10:26:07,878 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 549 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-07 10:26:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2018-11-07 10:26:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 1621. [2018-11-07 10:26:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2018-11-07 10:26:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1984 transitions. [2018-11-07 10:26:07,934 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1984 transitions. Word has length 274 [2018-11-07 10:26:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:07,935 INFO L480 AbstractCegarLoop]: Abstraction has 1621 states and 1984 transitions. [2018-11-07 10:26:07,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:26:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1984 transitions. [2018-11-07 10:26:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-07 10:26:07,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:07,940 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:07,940 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash 730772294, now seen corresponding path program 1 times [2018-11-07 10:26:07,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:07,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:07,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-07 10:26:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:08,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-07 10:26:08,475 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:08,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:26:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:26:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:26:08,476 INFO L87 Difference]: Start difference. First operand 1621 states and 1984 transitions. Second operand 11 states. [2018-11-07 10:26:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:09,368 INFO L93 Difference]: Finished difference Result 3184 states and 3907 transitions. [2018-11-07 10:26:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:26:09,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2018-11-07 10:26:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:09,373 INFO L225 Difference]: With dead ends: 3184 [2018-11-07 10:26:09,373 INFO L226 Difference]: Without dead ends: 1629 [2018-11-07 10:26:09,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:26:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-11-07 10:26:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1627. [2018-11-07 10:26:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2018-11-07 10:26:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1990 transitions. [2018-11-07 10:26:09,470 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1990 transitions. Word has length 274 [2018-11-07 10:26:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:09,470 INFO L480 AbstractCegarLoop]: Abstraction has 1627 states and 1990 transitions. [2018-11-07 10:26:09,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:26:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1990 transitions. [2018-11-07 10:26:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-07 10:26:09,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:09,475 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:09,475 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:09,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:09,476 INFO L82 PathProgramCache]: Analyzing trace with hash -484933437, now seen corresponding path program 1 times [2018-11-07 10:26:09,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:09,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:09,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:09,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:26:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 10:26:09,876 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 10:26:10,018 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20491 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-11-07 10:26:10,020 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 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-11-07 10:26:10,020 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20491 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-11-07 10:26:10,021 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 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-11-07 10:26:10,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:26:10 BoogieIcfgContainer [2018-11-07 10:26:10,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:26:10,170 INFO L168 Benchmark]: Toolchain (without parser) took 37618.08 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:10,173 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:10,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1760.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -718.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:10,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:10,175 INFO L168 Benchmark]: Boogie Preprocessor took 169.40 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:10,176 INFO L168 Benchmark]: RCFGBuilder took 2270.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:26:10,176 INFO L168 Benchmark]: TraceAbstraction took 33354.11 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 682.6 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -728.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:26:10,183 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1760.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -718.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.91 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 169.40 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2270.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33354.11 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 682.6 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -728.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20491 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 20485 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 20491 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 20485 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: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; VAL [\old(init)=20489, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20491:20485}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20489, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20493:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={20493:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, SSLv3_client_data={20493:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20495:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20495:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1069] FCALL s->state = 12292 VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20495:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20495:0}, malloc(sizeof(struct ssl3_state_st))={20483:0}, s={20482:0}, SSLv3_client_data={20493:0}] [L1071] CALL ssl3_connect(s) VAL [init=1, s={20482:0}, SSLv3_client_data={20493:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 VAL [blastFlag=0, buf={20494:20492}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20493:0}, tmp___1=0, tmp___2=0] [L1101] FCALL s->state = 12292 VAL [blastFlag=0, buf={20494:20492}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20493:0}, tmp___1=0, tmp___2=0] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, blastFlag=0, buf={20494:20492}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20493:0}, tmp___1=0, tmp___2=0] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1109] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1110] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->info_callback={7:-6}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->info_callback={7:-6}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1119] FCALL s->in_handshake += 1 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1120] COND FALSE !(tmp___1 & 12288) VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=12292, skip=0, SSLv3_client_data={20493:0}, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=12292, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1237] FCALL s->state = 4096 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL s->ctx VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={7:-6}, (s->ctx)->stats.sess_connect_renegotiate=1, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={7:-6}, (s->ctx)->stats.sess_connect_renegotiate=1, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1243] FCALL s->server = 0 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1249] EXPR, FCALL s->version VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->version=0, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1256] EXPR, FCALL s->init_buf VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1282] FCALL s->state = 4368 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL s->ctx VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [={7:-6}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [={7:-6}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20495:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=12292, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [={7:-6}, blastFlag=0, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1300] FCALL s->state = 4384 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1301] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->bbio VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->bbio={1:1}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->wbio VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->bbio={1:1}, s->wbio={1:2}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4368, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=1, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] FCALL s->hit VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->hit=0, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4384, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [={7:-6}, (s->s3)->tmp.new_cipher={20488:1}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={7:-6}, ((s->s3)->tmp.new_cipher)->algorithms=20487, (s->s3)->tmp.new_cipher={20488:1}, blastFlag=2, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] FCALL s->state = 4416 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4400, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=3, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1361] FCALL s->state = 4432 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4416, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=8, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1384] FCALL s->state = 4448 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1385] FCALL s->init_num = 0 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={7:-6}, (s->s3)->tmp.reuse_message=20484, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20483:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4432, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={7:-6}, blastFlag=4, buf={20494:20492}, init=1, malloc(sizeof(int))={20490:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20493:0}, state=4448, tmp=0, tmp___0={20490:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 353 locations, 1 error locations. UNSAFE Result, 33.2s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11696 SDtfs, 5234 SDslu, 23403 SDs, 0 SdLazy, 7028 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1869 GetRequests, 1683 SyntacticMatches, 58 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1627occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 9415 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 6553 NumberOfCodeBlocks, 6553 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 7021 ConstructedInterpolants, 0 QuantifiedInterpolants, 3856995 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1766 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 30 InterpolantComputations, 27 PerfectInterpolantSequences, 7425/7428 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...