java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:06,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:06,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:06,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:06,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:06,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:06,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:06,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:06,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:06,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:06,573 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:06,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:06,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:06,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:06,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:06,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:06,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:06,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:06,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:06,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:06,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:06,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:06,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:06,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:06,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:06,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:06,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:06,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:06,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:06,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:06,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:06,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:06,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:06,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:06,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:06,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:06,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:06,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:06,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:06,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:06,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:06,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:06,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:06,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:06,662 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:06,663 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:06,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl [2019-08-05 10:21:06,664 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl' [2019-08-05 10:21:06,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:06,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:06,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:06,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:06,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:06,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:06,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:06,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:06,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:06,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/1) ... [2019-08-05 10:21:06,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:06,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:06,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:06,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:06,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:21:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:06,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:07,617 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:07,618 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:07,619 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:07 BoogieIcfgContainer [2019-08-05 10:21:07,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:07,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:07,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:07,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:07,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:06" (1/2) ... [2019-08-05 10:21:07,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab8899f and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:07, skipping insertion in model container [2019-08-05 10:21:07,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:07" (2/2) ... [2019-08-05 10:21:07,627 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2019-08-05 10:21:07,637 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:07,645 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:07,659 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:07,681 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:07,682 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:07,682 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:07,682 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:07,682 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:07,683 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:07,683 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:07,683 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:07,683 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 10:21:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:07,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:07,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:07,709 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2019-08-05 10:21:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:07,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:07,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:07,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:07,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:07,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:07,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:07,918 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 10:21:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:08,096 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2019-08-05 10:21:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:08,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:21:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:08,110 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:21:08,110 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:21:08,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:21:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:21:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:21:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2019-08-05 10:21:08,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 15 [2019-08-05 10:21:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:08,150 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2019-08-05 10:21:08,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2019-08-05 10:21:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:08,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:08,152 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:08,152 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 994659125, now seen corresponding path program 1 times [2019-08-05 10:21:08,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:08,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:08,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:08,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:08,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,258 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 3 states. [2019-08-05 10:21:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:08,493 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2019-08-05 10:21:08,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:08,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 10:21:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:08,495 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:21:08,495 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:21:08,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:21:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:21:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:21:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-08-05 10:21:08,502 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 18 [2019-08-05 10:21:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:08,503 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-08-05 10:21:08,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-08-05 10:21:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:21:08,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:08,504 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:08,504 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1054659401, now seen corresponding path program 1 times [2019-08-05 10:21:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:08,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:08,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:21:08,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:08,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:08,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,576 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 3 states. [2019-08-05 10:21:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:08,731 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-08-05 10:21:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:08,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:21:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:08,734 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:21:08,734 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:21:08,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:21:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:21:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:21:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:21:08,743 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 22 [2019-08-05 10:21:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:08,744 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:21:08,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:21:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:21:08,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:08,745 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:08,746 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1471998149, now seen corresponding path program 1 times [2019-08-05 10:21:08,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:08,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:08,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:21:08,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:08,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:08,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:08,871 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:21:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:09,019 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-08-05 10:21:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:09,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:21:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:09,023 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:21:09,023 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:21:09,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:21:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:21:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:21:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-08-05 10:21:09,030 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 27 [2019-08-05 10:21:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:09,030 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-08-05 10:21:09,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2019-08-05 10:21:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:21:09,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:09,032 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:09,032 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1270422401, now seen corresponding path program 1 times [2019-08-05 10:21:09,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 10:21:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:09,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:09,125 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand 3 states. [2019-08-05 10:21:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:09,343 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-08-05 10:21:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:09,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-08-05 10:21:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:09,347 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:21:09,347 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:21:09,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:21:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:21:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:21:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-08-05 10:21:09,362 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 33 [2019-08-05 10:21:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:09,362 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-08-05 10:21:09,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-08-05 10:21:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:21:09,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:09,364 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:09,365 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -983630923, now seen corresponding path program 1 times [2019-08-05 10:21:09,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:09,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:09,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:21:09,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:09,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:09,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:09,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:09,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:09,504 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 3 states. [2019-08-05 10:21:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:09,627 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-08-05 10:21:09,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:09,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-05 10:21:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:09,632 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:21:09,632 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:21:09,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:21:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:21:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:21:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2019-08-05 10:21:09,640 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 40 [2019-08-05 10:21:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:09,641 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2019-08-05 10:21:09,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2019-08-05 10:21:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:21:09,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:09,643 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:09,644 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2019-08-05 10:21:09,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:09,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:09,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:21:09,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:09,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:09,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:09,768 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 4 states. [2019-08-05 10:21:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,352 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-08-05 10:21:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:10,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-08-05 10:21:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,354 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:21:10,354 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:21:10,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:21:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2019-08-05 10:21:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:21:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2019-08-05 10:21:10,366 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 48 [2019-08-05 10:21:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,366 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2019-08-05 10:21:10,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2019-08-05 10:21:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:21:10,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,369 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:10,369 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1913328197, now seen corresponding path program 1 times [2019-08-05 10:21:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:10,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:10,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,477 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand 3 states. [2019-08-05 10:21:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,657 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-08-05 10:21:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:10,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-08-05 10:21:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,660 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:21:10,660 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:21:10,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:21:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:21:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:21:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2019-08-05 10:21:10,672 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 57 [2019-08-05 10:21:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,672 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2019-08-05 10:21:10,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2019-08-05 10:21:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:21:10,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,675 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:10,675 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1816080523, now seen corresponding path program 1 times [2019-08-05 10:21:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-08-05 10:21:10,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:10,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:10,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,778 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand 3 states. [2019-08-05 10:21:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,901 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2019-08-05 10:21:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:10,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:21:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,905 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:21:10,905 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:21:10,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:21:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:21:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:21:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2019-08-05 10:21:10,917 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 67 [2019-08-05 10:21:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,917 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2019-08-05 10:21:10,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2019-08-05 10:21:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:21:10,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,921 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:10,921 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1256666677, now seen corresponding path program 1 times [2019-08-05 10:21:10,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-08-05 10:21:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:10,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:10,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:10,985 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand 3 states. [2019-08-05 10:21:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:11,085 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2019-08-05 10:21:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:11,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-08-05 10:21:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:11,087 INFO L225 Difference]: With dead ends: 220 [2019-08-05 10:21:11,087 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 10:21:11,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 10:21:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-08-05 10:21:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:21:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2019-08-05 10:21:11,098 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 78 [2019-08-05 10:21:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:11,099 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2019-08-05 10:21:11,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2019-08-05 10:21:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:21:11,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:11,103 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:11,103 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1673954646, now seen corresponding path program 1 times [2019-08-05 10:21:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:11,130 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-08-05 10:21:11,131 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 10:21:11,131 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:21:11,142 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:21:11,142 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:21:11,162 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 10:21:11,163 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:11 BoogieIcfgContainer [2019-08-05 10:21:11,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:11,166 INFO L168 Benchmark]: Toolchain (without parser) took 4436.37 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 110.0 MB in the beginning and 83.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,167 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,169 INFO L168 Benchmark]: Boogie Preprocessor took 34.78 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,170 INFO L168 Benchmark]: RCFGBuilder took 816.85 ms. Allocated memory is still 134.7 MB. Free memory was 106.5 MB in the beginning and 79.8 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,171 INFO L168 Benchmark]: TraceAbstraction took 3542.46 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 79.6 MB in the beginning and 83.5 MB in the end (delta: -3.9 MB). Peak memory consumption was 59.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:11,175 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.85 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.78 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.85 ms. Allocated memory is still 134.7 MB. Free memory was 106.5 MB in the beginning and 79.8 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3542.46 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 79.6 MB in the beginning and 83.5 MB in the end (delta: -3.9 MB). Peak memory consumption was 59.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 480]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseAnd at line 327. Possible FailurePath: [L108] havoc main_#res; [L109] havoc main_#t~ret42, main_~s~208, main_~tmp~208; [L110] havoc main_~s~208; [L111] havoc main_~tmp~208; [L112] main_~s~208 := 8464; [L113] ssl3_accept_#in~initial_state := main_~s~208; [L114] havoc ssl3_accept_#res; [L115] havoc ssl3_accept_#t~nondet0, ssl3_accept_#t~nondet1, ssl3_accept_#t~nondet2, ssl3_accept_#t~nondet3, ssl3_accept_#t~nondet4, ssl3_accept_#t~nondet5, ssl3_accept_#t~nondet6, ssl3_accept_#t~nondet7, ssl3_accept_#t~nondet8, ssl3_accept_#t~nondet9, ssl3_accept_#t~nondet10, ssl3_accept_#t~nondet11, ssl3_accept_#t~nondet12, ssl3_accept_#t~nondet13, ssl3_accept_#t~nondet14, ssl3_accept_#t~nondet15, ssl3_accept_#t~nondet16, ssl3_accept_#t~nondet17, ssl3_accept_#t~nondet18, ssl3_accept_#t~nondet19, ssl3_accept_#t~nondet20, ssl3_accept_#t~nondet21, ssl3_accept_#t~nondet22, ssl3_accept_#t~nondet23, ssl3_accept_#t~nondet24, ssl3_accept_#t~nondet25, ssl3_accept_#t~nondet26, ssl3_accept_#t~nondet27, ssl3_accept_#t~nondet28, ssl3_accept_#t~nondet29, ssl3_accept_#t~nondet30, ssl3_accept_#t~nondet31, ssl3_accept_#t~nondet32, ssl3_accept_#t~nondet33, ssl3_accept_#t~nondet34, ssl3_accept_#t~nondet35, ssl3_accept_#t~nondet36, ssl3_accept_#t~nondet37, ssl3_accept_#t~nondet38, ssl3_accept_#t~nondet39, ssl3_accept_#t~nondet40, ssl3_accept_#t~nondet41, ssl3_accept_~initial_state, ssl3_accept_~s__info_callback~4, ssl3_accept_~s__in_handshake~4, ssl3_accept_~s__state~4, ssl3_accept_~s__new_session~4, ssl3_accept_~s__server~4, ssl3_accept_~s__version~4, ssl3_accept_~s__type~4, ssl3_accept_~s__init_num~4, ssl3_accept_~s__hit~4, ssl3_accept_~s__rwstate~4, ssl3_accept_~s__init_buf___0~4, ssl3_accept_~s__debug~4, ssl3_accept_~s__shutdown~4, ssl3_accept_~s__cert~4, ssl3_accept_~s__options~4, ssl3_accept_~s__verify_mode~4, ssl3_accept_~s__session__peer~4, ssl3_accept_~s__cert__pkeys__AT0__privatekey~4, ssl3_accept_~s__ctx__info_callback~4, ssl3_accept_~s__ctx__stats__sess_accept_renegotiate~4, ssl3_accept_~s__ctx__stats__sess_accept~4, ssl3_accept_~s__ctx__stats__sess_accept_good~4, ssl3_accept_~s__s3__tmp__cert_request~4, ssl3_accept_~s__s3__tmp__reuse_message~4, ssl3_accept_~s__s3__tmp__use_rsa_tmp~4, ssl3_accept_~s__s3__tmp__new_cipher~4, ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, ssl3_accept_~s__s3__tmp__next_state___0~4, ssl3_accept_~s__s3__tmp__new_cipher__algo_strength~4, ssl3_accept_~s__session__cipher~4, ssl3_accept_~buf~4, ssl3_accept_~l~4, ssl3_accept_~Time~4, ssl3_accept_~tmp~4, ssl3_accept_~cb~4, ssl3_accept_~num1~4, ssl3_accept_~ret~4, ssl3_accept_~new_state~4, ssl3_accept_~state~4, ssl3_accept_~skip~4, ssl3_accept_~got_new_session~4, ssl3_accept_~tmp___1~4, ssl3_accept_~tmp___2~4, ssl3_accept_~tmp___3~4, ssl3_accept_~tmp___4~4, ssl3_accept_~tmp___5~4, ssl3_accept_~tmp___6~4, ssl3_accept_~tmp___7~4, ssl3_accept_~tmp___8~4, ssl3_accept_~tmp___9~4, ssl3_accept_~tmp___10~4, ssl3_accept_~blastFlag~4, ssl3_accept_~__retres67~4; [L116] ssl3_accept_~initial_state := ssl3_accept_#in~initial_state; [L117] assume -2147483648 <= ssl3_accept_#t~nondet0 && ssl3_accept_#t~nondet0 <= 2147483647; [L118] ssl3_accept_~s__info_callback~4 := ssl3_accept_#t~nondet0; [L119] havoc ssl3_accept_#t~nondet0; [L120] assume -2147483648 <= ssl3_accept_#t~nondet1 && ssl3_accept_#t~nondet1 <= 2147483647; [L121] ssl3_accept_~s__in_handshake~4 := ssl3_accept_#t~nondet1; [L122] havoc ssl3_accept_#t~nondet1; [L123] havoc ssl3_accept_~s__state~4; [L124] havoc ssl3_accept_~s__new_session~4; [L125] havoc ssl3_accept_~s__server~4; [L126] assume -2147483648 <= ssl3_accept_#t~nondet2 && ssl3_accept_#t~nondet2 <= 2147483647; [L127] ssl3_accept_~s__version~4 := ssl3_accept_#t~nondet2; [L128] havoc ssl3_accept_#t~nondet2; [L129] havoc ssl3_accept_~s__type~4; [L130] havoc ssl3_accept_~s__init_num~4; [L131] assume -2147483648 <= ssl3_accept_#t~nondet3 && ssl3_accept_#t~nondet3 <= 2147483647; [L132] ssl3_accept_~s__hit~4 := ssl3_accept_#t~nondet3; [L133] havoc ssl3_accept_#t~nondet3; [L134] havoc ssl3_accept_~s__rwstate~4; [L135] havoc ssl3_accept_~s__init_buf___0~4; [L136] assume -2147483648 <= ssl3_accept_#t~nondet4 && ssl3_accept_#t~nondet4 <= 2147483647; [L137] ssl3_accept_~s__debug~4 := ssl3_accept_#t~nondet4; [L138] havoc ssl3_accept_#t~nondet4; [L139] havoc ssl3_accept_~s__shutdown~4; [L140] assume -2147483648 <= ssl3_accept_#t~nondet5 && ssl3_accept_#t~nondet5 <= 2147483647; [L141] ssl3_accept_~s__cert~4 := ssl3_accept_#t~nondet5; [L142] havoc ssl3_accept_#t~nondet5; [L143] assume -2147483648 <= ssl3_accept_#t~nondet6 && ssl3_accept_#t~nondet6 <= 2147483647; [L144] ssl3_accept_~s__options~4 := ssl3_accept_#t~nondet6; [L145] havoc ssl3_accept_#t~nondet6; [L146] assume -2147483648 <= ssl3_accept_#t~nondet7 && ssl3_accept_#t~nondet7 <= 2147483647; [L147] ssl3_accept_~s__verify_mode~4 := ssl3_accept_#t~nondet7; [L148] havoc ssl3_accept_#t~nondet7; [L149] assume -2147483648 <= ssl3_accept_#t~nondet8 && ssl3_accept_#t~nondet8 <= 2147483647; [L150] ssl3_accept_~s__session__peer~4 := ssl3_accept_#t~nondet8; [L151] havoc ssl3_accept_#t~nondet8; [L152] assume -2147483648 <= ssl3_accept_#t~nondet9 && ssl3_accept_#t~nondet9 <= 2147483647; [L153] ssl3_accept_~s__cert__pkeys__AT0__privatekey~4 := ssl3_accept_#t~nondet9; [L154] havoc ssl3_accept_#t~nondet9; [L155] assume -2147483648 <= ssl3_accept_#t~nondet10 && ssl3_accept_#t~nondet10 <= 2147483647; [L156] ssl3_accept_~s__ctx__info_callback~4 := ssl3_accept_#t~nondet10; [L157] havoc ssl3_accept_#t~nondet10; [L158] havoc ssl3_accept_~s__ctx__stats__sess_accept_renegotiate~4; [L159] havoc ssl3_accept_~s__ctx__stats__sess_accept~4; [L160] assume -2147483648 <= ssl3_accept_#t~nondet11 && ssl3_accept_#t~nondet11 <= 2147483647; [L161] ssl3_accept_~s__ctx__stats__sess_accept_good~4 := ssl3_accept_#t~nondet11; [L162] havoc ssl3_accept_#t~nondet11; [L163] havoc ssl3_accept_~s__s3__tmp__cert_request~4; [L164] assume -2147483648 <= ssl3_accept_#t~nondet12 && ssl3_accept_#t~nondet12 <= 2147483647; [L165] ssl3_accept_~s__s3__tmp__reuse_message~4 := ssl3_accept_#t~nondet12; [L166] havoc ssl3_accept_#t~nondet12; [L167] havoc ssl3_accept_~s__s3__tmp__use_rsa_tmp~4; [L168] assume -2147483648 <= ssl3_accept_#t~nondet13 && ssl3_accept_#t~nondet13 <= 2147483647; [L169] ssl3_accept_~s__s3__tmp__new_cipher~4 := ssl3_accept_#t~nondet13; [L170] havoc ssl3_accept_#t~nondet13; [L171] assume -2147483648 <= ssl3_accept_#t~nondet14 && ssl3_accept_#t~nondet14 <= 2147483647; [L172] ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4 := ssl3_accept_#t~nondet14; [L173] havoc ssl3_accept_#t~nondet14; [L174] havoc ssl3_accept_~s__s3__tmp__next_state___0~4; [L175] assume -2147483648 <= ssl3_accept_#t~nondet15 && ssl3_accept_#t~nondet15 <= 2147483647; [L176] ssl3_accept_~s__s3__tmp__new_cipher__algo_strength~4 := ssl3_accept_#t~nondet15; [L177] havoc ssl3_accept_#t~nondet15; [L178] havoc ssl3_accept_~s__session__cipher~4; [L179] havoc ssl3_accept_~buf~4; [L180] havoc ssl3_accept_~l~4; [L181] havoc ssl3_accept_~Time~4; [L182] havoc ssl3_accept_~tmp~4; [L183] havoc ssl3_accept_~cb~4; [L184] havoc ssl3_accept_~num1~4; [L185] havoc ssl3_accept_~ret~4; [L186] havoc ssl3_accept_~new_state~4; [L187] havoc ssl3_accept_~state~4; [L188] havoc ssl3_accept_~skip~4; [L189] havoc ssl3_accept_~got_new_session~4; [L190] assume -2147483648 <= ssl3_accept_#t~nondet16 && ssl3_accept_#t~nondet16 <= 2147483647; [L191] ssl3_accept_~tmp___1~4 := ssl3_accept_#t~nondet16; [L192] havoc ssl3_accept_#t~nondet16; [L193] assume -2147483648 <= ssl3_accept_#t~nondet17 && ssl3_accept_#t~nondet17 <= 2147483647; [L194] ssl3_accept_~tmp___2~4 := ssl3_accept_#t~nondet17; [L195] havoc ssl3_accept_#t~nondet17; [L196] assume -2147483648 <= ssl3_accept_#t~nondet18 && ssl3_accept_#t~nondet18 <= 2147483647; [L197] ssl3_accept_~tmp___3~4 := ssl3_accept_#t~nondet18; [L198] havoc ssl3_accept_#t~nondet18; [L199] assume -2147483648 <= ssl3_accept_#t~nondet19 && ssl3_accept_#t~nondet19 <= 2147483647; [L200] ssl3_accept_~tmp___4~4 := ssl3_accept_#t~nondet19; [L201] havoc ssl3_accept_#t~nondet19; [L202] assume -2147483648 <= ssl3_accept_#t~nondet20 && ssl3_accept_#t~nondet20 <= 2147483647; [L203] ssl3_accept_~tmp___5~4 := ssl3_accept_#t~nondet20; [L204] havoc ssl3_accept_#t~nondet20; [L205] assume -2147483648 <= ssl3_accept_#t~nondet21 && ssl3_accept_#t~nondet21 <= 2147483647; [L206] ssl3_accept_~tmp___6~4 := ssl3_accept_#t~nondet21; [L207] havoc ssl3_accept_#t~nondet21; [L208] havoc ssl3_accept_~tmp___7~4; [L209] assume -9223372036854775808 <= ssl3_accept_#t~nondet22 && ssl3_accept_#t~nondet22 <= 9223372036854775807; [L210] ssl3_accept_~tmp___8~4 := ssl3_accept_#t~nondet22; [L211] havoc ssl3_accept_#t~nondet22; [L212] assume -2147483648 <= ssl3_accept_#t~nondet23 && ssl3_accept_#t~nondet23 <= 2147483647; [L213] ssl3_accept_~tmp___9~4 := ssl3_accept_#t~nondet23; [L214] havoc ssl3_accept_#t~nondet23; [L215] assume -2147483648 <= ssl3_accept_#t~nondet24 && ssl3_accept_#t~nondet24 <= 2147483647; [L216] ssl3_accept_~tmp___10~4 := ssl3_accept_#t~nondet24; [L217] havoc ssl3_accept_#t~nondet24; [L218] havoc ssl3_accept_~blastFlag~4; [L219] havoc ssl3_accept_~__retres67~4; [L220] ssl3_accept_~s__state~4 := ssl3_accept_~initial_state; [L221] ssl3_accept_~blastFlag~4 := 0; [L222] assume -2147483648 <= ssl3_accept_#t~nondet25 && ssl3_accept_#t~nondet25 <= 2147483647; [L223] ssl3_accept_~tmp~4 := ssl3_accept_#t~nondet25; [L224] havoc ssl3_accept_#t~nondet25; [L225] ssl3_accept_~Time~4 := ssl3_accept_~tmp~4; [L226] ssl3_accept_~cb~4 := 0; [L227] ssl3_accept_~ret~4 := -1; [L228] ssl3_accept_~skip~4 := 0; [L229] ssl3_accept_~got_new_session~4 := 0; [L230] assume ssl3_accept_~s__info_callback~4 != 0; [L231] ssl3_accept_~cb~4 := ssl3_accept_~s__info_callback~4; [L232] ssl3_accept_~s__in_handshake~4 := ssl3_accept_~s__in_handshake~4 + 1; [L233] assume !(~bitwiseAnd(ssl3_accept_~tmp___1~4, 12288) != 0); [L234] assume !(ssl3_accept_~s__cert~4 == 0); [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L252] assume ssl3_accept_~s__state~4 == 8464; [L253] ssl3_accept_~s__shutdown~4 := 0; [L254] assume -2147483648 <= ssl3_accept_#t~nondet28 && ssl3_accept_#t~nondet28 <= 2147483647; [L255] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet28; [L256] havoc ssl3_accept_#t~nondet28; [L257] assume ssl3_accept_~blastFlag~4 == 0; [L258] ssl3_accept_~blastFlag~4 := 1; [L259] assume !(ssl3_accept_~ret~4 <= 0); [L260] ssl3_accept_~got_new_session~4 := 1; [L261] ssl3_accept_~s__state~4 := 8496; [L262] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L276] assume ssl3_accept_~s__state~4 == 8496; [L277] assume -2147483648 <= ssl3_accept_#t~nondet29 && ssl3_accept_#t~nondet29 <= 2147483647; [L278] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet29; [L279] havoc ssl3_accept_#t~nondet29; [L280] assume ssl3_accept_~blastFlag~4 == 1; [L281] ssl3_accept_~blastFlag~4 := 2; [L282] assume !(ssl3_accept_~ret~4 <= 0); [L283] assume !(ssl3_accept_~s__hit~4 != 0); [L284] ssl3_accept_~s__state~4 := 8512; [L285] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L294] assume ssl3_accept_~s__state~4 == 8512; [L295] assume ~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0; [L296] ssl3_accept_~skip~4 := 1; [L297] ssl3_accept_~s__state~4 := 8528; [L298] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L307] assume ssl3_accept_~s__state~4 == 8528; [L308] ssl3_accept_~l~4 := ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4; [L309] assume ~bitwiseAnd(ssl3_accept_~s__options~4, 2097152) % 18446744073709551616 != 0; [L310] ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 := 1; [L311] assume ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 != 0; [L312] assume -2147483648 <= ssl3_accept_#t~nondet31 && ssl3_accept_#t~nondet31 <= 2147483647; [L313] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet31; [L314] havoc ssl3_accept_#t~nondet31; [L315] assume !(ssl3_accept_~ret~4 <= 0); [L316] ssl3_accept_~s__state~4 := 8544; [L317] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L326] assume ssl3_accept_~s__state~4 == 8544; [L327] assume ~bitwiseAnd(ssl3_accept_~s__verify_mode~4, 1) != 0; [L328] assume !(ssl3_accept_~s__session__peer~4 != 0); [L329] assume !(~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0); [L330] ssl3_accept_~s__s3__tmp__cert_request~4 := 1; [L331] assume -2147483648 <= ssl3_accept_#t~nondet32 && ssl3_accept_#t~nondet32 <= 2147483647; [L332] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet32; [L333] havoc ssl3_accept_#t~nondet32; [L334] assume !(ssl3_accept_~ret~4 <= 0); [L335] ssl3_accept_~s__state~4 := 8448; [L336] ssl3_accept_~s__s3__tmp__next_state___0~4 := 8576; [L337] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L348] assume ssl3_accept_~s__state~4 == 8448; [L349] assume !(ssl3_accept_~num1~4 > 0); [L350] ssl3_accept_~s__state~4 := ssl3_accept_~s__s3__tmp__next_state___0~4; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L358] assume ssl3_accept_~s__state~4 == 8576; [L359] assume -2147483648 <= ssl3_accept_#t~nondet34 && ssl3_accept_#t~nondet34 <= 2147483647; [L360] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet34; [L361] havoc ssl3_accept_#t~nondet34; [L362] assume !(ssl3_accept_~ret~4 <= 0); [L363] assume !(ssl3_accept_~ret~4 == 2); [L364] assume -2147483648 <= ssl3_accept_#t~nondet35 && ssl3_accept_#t~nondet35 <= 2147483647; [L365] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet35; [L366] havoc ssl3_accept_#t~nondet35; [L367] assume !(ssl3_accept_~ret~4 <= 0); [L368] ssl3_accept_~s__init_num~4 := 0; [L369] ssl3_accept_~s__state~4 := 8592; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L378] assume ssl3_accept_~s__state~4 == 8592; [L379] assume -2147483648 <= ssl3_accept_#t~nondet36 && ssl3_accept_#t~nondet36 <= 2147483647; [L380] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet36; [L381] havoc ssl3_accept_#t~nondet36; [L382] assume !(ssl3_accept_~ret~4 <= 0); [L383] ssl3_accept_~s__state~4 := 8608; [L384] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L393] assume ssl3_accept_~s__state~4 == 8608; [L394] assume -2147483648 <= ssl3_accept_#t~nondet37 && ssl3_accept_#t~nondet37 <= 2147483647; [L395] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet37; [L396] havoc ssl3_accept_#t~nondet37; [L397] assume !(ssl3_accept_~ret~4 <= 0); [L398] ssl3_accept_~s__state~4 := 8640; [L399] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L408] assume ssl3_accept_~s__state~4 == 8640; [L409] assume -2147483648 <= ssl3_accept_#t~nondet38 && ssl3_accept_#t~nondet38 <= 2147483647; [L410] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet38; [L411] havoc ssl3_accept_#t~nondet38; [L424] assume !(ssl3_accept_~blastFlag~4 == 3); [L445] assume !(ssl3_accept_~ret~4 <= 0); [L446] assume !(ssl3_accept_~s__hit~4 != 0); [L447] ssl3_accept_~s__state~4 := 8656; [L448] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L414] assume !(ssl3_accept_~s__state~4 == 8640); [L415] assume !(ssl3_accept_~s__state~4 == 8641); [L437] assume !(ssl3_accept_~s__state~4 == 8656); [L438] assume !(ssl3_accept_~s__state~4 == 8657); [L439] assume ssl3_accept_~s__state~4 == 8672; [L440] assume -2147483648 <= ssl3_accept_#t~nondet40 && ssl3_accept_#t~nondet40 <= 2147483647; [L441] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet40; [L442] havoc ssl3_accept_#t~nondet40; [L470] assume ssl3_accept_~blastFlag~4 == 4; [L471] assume !false; [L480] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. UNKNOWN Result, 3.4s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 32 SDslu, 54 SDs, 0 SdLazy, 354 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 28265 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2735 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 772/780 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...