java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:28:59,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:28:59,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:00,001 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:00,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:00,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:00,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:00,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:00,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:00,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:00,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:00,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:00,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:00,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:00,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:00,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:00,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:00,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:00,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:00,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:00,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:00,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:00,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:00,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:00,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:00,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:00,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:00,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:00,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:00,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:00,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:00,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:00,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:00,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:00,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:00,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:00,059 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:29:00,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:00,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:00,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:00,076 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:00,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:00,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:00,076 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:00,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:00,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:00,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:00,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:00,173 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:00,174 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:00,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-07-25 13:29:00,175 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-07-25 13:29:00,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:00,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:00,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:00,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:00,275 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:00,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:00,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:00,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:00,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:00,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:00,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:00,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:00,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:00,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/1) ... [2018-07-25 13:29:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:01,212 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:01,213 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:01 BoogieIcfgContainer [2018-07-25 13:29:01,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:01,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:01,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:01,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:01,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:00" (1/2) ... [2018-07-25 13:29:01,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600a3f22 and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:01, skipping insertion in model container [2018-07-25 13:29:01,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:01" (2/2) ... [2018-07-25 13:29:01,231 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-07-25 13:29:01,242 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:01,253 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:01,308 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:01,309 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:01,309 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:01,310 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:01,310 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:01,310 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:01,310 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:01,311 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:01,311 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-25 13:29:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:29:01,347 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,349 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,351 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-07-25 13:29:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:01,493 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:01,493 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:01,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:01,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:01,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:01,520 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-25 13:29:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,624 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-25 13:29:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:01,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-25 13:29:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,659 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:29:01,659 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:29:01,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-25 13:29:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:29:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:29:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:29:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-25 13:29:01,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-25 13:29:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,711 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-25 13:29:01,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-25 13:29:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:29:01,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,712 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,712 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-07-25 13:29:01,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:01,745 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:01,745 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:01,747 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:01,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:01,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:01,748 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-25 13:29:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,813 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-25 13:29:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:01,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-25 13:29:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,816 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:29:01,817 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:29:01,819 INFO L574 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-07-25 13:29:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:29:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:29:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:29:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-25 13:29:01,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-25 13:29:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,829 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-25 13:29:01,829 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-25 13:29:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:29:01,830 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,831 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,832 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-07-25 13:29:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:29:01,874 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:01,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:01,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:01,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:01,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:01,878 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-25 13:29:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,965 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-25 13:29:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:01,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-25 13:29:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,971 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:29:01,971 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:29:01,972 INFO L574 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-07-25 13:29:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:29:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:29:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:29:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-25 13:29:01,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-25 13:29:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,986 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-25 13:29:01,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-25 13:29:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:29:01,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,992 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:01,992 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-07-25 13:29:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 13:29:02,020 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:02,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:02,021 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:02,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:02,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:02,023 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-07-25 13:29:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,066 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-25 13:29:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:02,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-25 13:29:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,072 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:29:02,072 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:29:02,076 INFO L574 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-07-25 13:29:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:29:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:29:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:29:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-07-25 13:29:02,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-07-25 13:29:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,085 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-07-25 13:29:02,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-07-25 13:29:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:29:02,087 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,087 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,088 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1120823750, now seen corresponding path program 1 times [2018-07-25 13:29:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-25 13:29:02,118 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:02,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:02,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:02,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:02,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:02,120 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-07-25 13:29:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,160 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-07-25 13:29:02,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:02,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-25 13:29:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,163 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:29:02,163 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:29:02,164 INFO L574 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-07-25 13:29:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:29:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:29:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:29:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-07-25 13:29:02,171 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-07-25 13:29:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,172 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-07-25 13:29:02,172 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-07-25 13:29:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:29:02,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,174 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,175 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1129262250, now seen corresponding path program 1 times [2018-07-25 13:29:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 13:29:02,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:02,230 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:02,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:02,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:02,232 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2018-07-25 13:29:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,267 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-07-25 13:29:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:02,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-07-25 13:29:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,269 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:29:02,269 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:29:02,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:29:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-07-25 13:29:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:29:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-07-25 13:29:02,281 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 35 [2018-07-25 13:29:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,282 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-07-25 13:29:02,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-07-25 13:29:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:29:02,284 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,284 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,285 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash 221846095, now seen corresponding path program 2 times [2018-07-25 13:29:02,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-07-25 13:29:02,330 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:02,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:02,331 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:02,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:02,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:02,332 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2018-07-25 13:29:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,377 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2018-07-25 13:29:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:02,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-07-25 13:29:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,379 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:29:02,380 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:29:02,381 INFO L574 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-07-25 13:29:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:29:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-07-25 13:29:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:29:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-07-25 13:29:02,394 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 48 [2018-07-25 13:29:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,394 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-07-25 13:29:02,395 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-07-25 13:29:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:29:02,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,398 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,398 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -823167015, now seen corresponding path program 1 times [2018-07-25 13:29:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-07-25 13:29:02,482 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:02,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:02,483 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:02,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:02,484 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 3 states. [2018-07-25 13:29:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,518 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-07-25 13:29:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:02,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-07-25 13:29:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,520 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:29:02,520 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:29:02,521 INFO L574 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-07-25 13:29:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:29:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:29:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:29:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2018-07-25 13:29:02,534 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 58 [2018-07-25 13:29:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,535 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2018-07-25 13:29:02,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2018-07-25 13:29:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:29:02,537 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,537 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,537 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -840979935, now seen corresponding path program 1 times [2018-07-25 13:29:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-07-25 13:29:02,595 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:02,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:29:02,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:02,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:02,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:02,599 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 3 states. [2018-07-25 13:29:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,635 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-07-25 13:29:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:02,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-07-25 13:29:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,638 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:29:02,638 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:29:02,639 INFO L574 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-07-25 13:29:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:29:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:29:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:29:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-07-25 13:29:02,656 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 67 [2018-07-25 13:29:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,658 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-07-25 13:29:02,658 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-07-25 13:29:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:29:02,660 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,660 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,661 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1809848535, now seen corresponding path program 1 times [2018-07-25 13:29:02,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-25 13:29:02,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:02,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:02,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:02,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:02,757 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 4 states. [2018-07-25 13:29:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,825 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-07-25 13:29:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:02,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-07-25 13:29:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,828 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:29:02,828 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:29:02,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:29:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-07-25 13:29:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:29:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-07-25 13:29:02,862 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 76 [2018-07-25 13:29:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,862 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-07-25 13:29:02,863 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-07-25 13:29:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:29:02,864 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,866 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:02,866 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1729106847, now seen corresponding path program 2 times [2018-07-25 13:29:02,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-25 13:29:02,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:02,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:02,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:02,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:02,961 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 5 states. [2018-07-25 13:29:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,079 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2018-07-25 13:29:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:03,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-07-25 13:29:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,082 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:29:03,082 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:29:03,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:29:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-07-25 13:29:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:29:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-07-25 13:29:03,113 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 86 [2018-07-25 13:29:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,113 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-07-25 13:29:03,113 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-07-25 13:29:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:29:03,119 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:03,119 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:03,120 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1042523285, now seen corresponding path program 3 times [2018-07-25 13:29:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-25 13:29:03,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:03,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:03,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:03,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:03,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:03,268 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 6 states. [2018-07-25 13:29:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,383 INFO L93 Difference]: Finished difference Result 315 states and 361 transitions. [2018-07-25 13:29:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:03,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-07-25 13:29:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,385 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:29:03,386 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 13:29:03,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 13:29:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-07-25 13:29:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:29:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-07-25 13:29:03,407 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 96 [2018-07-25 13:29:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,408 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-07-25 13:29:03,408 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-07-25 13:29:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:29:03,409 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:03,410 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:03,410 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1371994635, now seen corresponding path program 4 times [2018-07-25 13:29:03,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-25 13:29:03,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:03,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:03,598 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:03,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:03,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:03,599 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 7 states. [2018-07-25 13:29:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,751 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-07-25 13:29:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:29:03,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-07-25 13:29:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,752 INFO L225 Difference]: With dead ends: 288 [2018-07-25 13:29:03,752 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:29:03,753 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:29:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:29:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:29:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:29:03,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-07-25 13:29:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,756 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:29:03,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:29:03,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:29:03,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:29:04,076 INFO L418 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-25 13:29:04,077 INFO L418 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-25 13:29:04,077 INFO L422 ceAbstractionStarter]: For program point L370(lines 370 386) no Hoare annotation was computed. [2018-07-25 13:29:04,078 INFO L418 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-25 13:29:04,079 INFO L418 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-07-25 13:29:04,080 INFO L422 ceAbstractionStarter]: For program point L362(lines 357 375) no Hoare annotation was computed. [2018-07-25 13:29:04,081 INFO L418 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-25 13:29:04,081 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-07-25 13:29:04,081 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-07-25 13:29:04,081 INFO L418 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-07-25 13:29:04,082 INFO L418 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))))) [2018-07-25 13:29:04,083 INFO L418 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)))) [2018-07-25 13:29:04,083 INFO L418 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-07-25 13:29:04,083 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) the Hoare annotation is: false [2018-07-25 13:29:04,083 INFO L422 ceAbstractionStarter]: For program point L388(lines 385 401) no Hoare annotation was computed. [2018-07-25 13:29:04,084 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-07-25 13:29:04,084 INFO L418 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-25 13:29:04,085 INFO L422 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-07-25 13:29:04,085 INFO L422 ceAbstractionStarter]: For program point L480(lines 480 497) no Hoare annotation was computed. [2018-07-25 13:29:04,086 INFO L418 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-25 13:29:04,086 INFO L422 ceAbstractionStarter]: For program point L460(lines 460 477) no Hoare annotation was computed. [2018-07-25 13:29:04,088 INFO L418 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-07-25 13:29:04,119 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:04 BoogieIcfgContainer [2018-07-25 13:29:04,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:04,121 INFO L168 Benchmark]: Toolchain (without parser) took 3849.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.6 MB). Peak memory consumption was 380.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:04,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-07-25 13:29:04,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.75 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-07-25 13:29:04,125 INFO L168 Benchmark]: Boogie Preprocessor took 52.46 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-07-25 13:29:04,127 INFO L168 Benchmark]: RCFGBuilder took 834.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:04,128 INFO L168 Benchmark]: TraceAbstraction took 2905.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:04,134 INFO L336 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.25 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. * Boogie Procedure Inliner took 50.75 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. * Boogie Preprocessor took 52.46 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. * RCFGBuilder took 834.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2905.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4528) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4512)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 13 OverallIterations, 14 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 53 SDslu, 124 SDs, 0 SdLazy, 742 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=12, 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, 13 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 578 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1098 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 86073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2088/2267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-04-153.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-04-153.csv Received shutdown request...