java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:37,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:37,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:37,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:37,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:37,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:37,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:37,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:37,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:37,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:37,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:37,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:37,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:37,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:37,914 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:37,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:37,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:37,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:37,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:37,922 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:37,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:37,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:37,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:37,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:37,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:37,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:37,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:37,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:37,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:37,937 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:37,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:37,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:37,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:37,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:37,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:37,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:37,944 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:19:37,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:37,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:37,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:37,962 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:37,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:37,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:37,963 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:37,963 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:38,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:38,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:38,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:38,036 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:38,037 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:38,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-09-26 08:19:38,037 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-09-26 08:19:38,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:38,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:38,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:38,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:38,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:38,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:38,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:38,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:38,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:38,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:38,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:38,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:38,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:38,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/1) ... [2018-09-26 08:19:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:38,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:39,007 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:39,008 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:39 BoogieIcfgContainer [2018-09-26 08:19:39,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:39,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:39,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:39,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:38" (1/2) ... [2018-09-26 08:19:39,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464a1142 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:39, skipping insertion in model container [2018-09-26 08:19:39,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:39" (2/2) ... [2018-09-26 08:19:39,018 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-09-26 08:19:39,028 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:39,037 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:39,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:39,083 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:39,083 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:39,083 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:39,084 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:39,084 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:39,084 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:39,084 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:39,085 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-09-26 08:19:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:39,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-09-26 08:19:39,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:39,257 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:39,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:39,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:39,281 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-09-26 08:19:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,345 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-09-26 08:19:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:39,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 08:19:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,366 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:19:39,367 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:19:39,372 INFO L605 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-09-26 08:19:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:19:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:19:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:19:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-09-26 08:19:39,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-09-26 08:19:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,437 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-09-26 08:19:39,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-09-26 08:19:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:19:39,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,439 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-09-26 08:19:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:39,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:39,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:39,496 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-09-26 08:19:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,572 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-09-26 08:19:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:39,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 08:19:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,580 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:19:39,580 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:19:39,585 INFO L605 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-09-26 08:19:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:19:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:19:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:19:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-09-26 08:19:39,595 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-09-26 08:19:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,595 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-09-26 08:19:39,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-09-26 08:19:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:19:39,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,599 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-09-26 08:19:39,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:39,636 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:39,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:39,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:39,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:39,640 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-09-26 08:19:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,699 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-09-26 08:19:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 08:19:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,702 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:19:39,702 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:19:39,703 INFO L605 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-09-26 08:19:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:19:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:19:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:19:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-09-26 08:19:39,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-09-26 08:19:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,715 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-09-26 08:19:39,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-09-26 08:19:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:19:39,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,718 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,719 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-09-26 08:19:39,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:39,767 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:39,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:39,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:39,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:39,769 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-09-26 08:19:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,818 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-09-26 08:19:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:39,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 08:19:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,822 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:19:39,822 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:19:39,825 INFO L605 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-09-26 08:19:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:19:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:19:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:19:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-09-26 08:19:39,842 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-09-26 08:19:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,842 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-09-26 08:19:39,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-09-26 08:19:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:39,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,844 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-09-26 08:19:39,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 08:19:39,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:39,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:39,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:39,883 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-09-26 08:19:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,944 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-09-26 08:19:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:39,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 08:19:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,946 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:19:39,949 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:19:39,950 INFO L605 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-09-26 08:19:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:19:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:19:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:19:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-09-26 08:19:39,966 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-09-26 08:19:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,966 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-09-26 08:19:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-09-26 08:19:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:19:39,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,970 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:39,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-09-26 08:19:39,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 08:19:40,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:40,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:40,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:40,017 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2018-09-26 08:19:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,068 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-09-26 08:19:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:40,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-09-26 08:19:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,074 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:19:40,074 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:19:40,075 INFO L605 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-09-26 08:19:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:19:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-09-26 08:19:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:19:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-09-26 08:19:40,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 35 [2018-09-26 08:19:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,096 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-09-26 08:19:40,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-09-26 08:19:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:19:40,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,099 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:40,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-09-26 08:19:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 08:19:40,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:40,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:40,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:40,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:40,164 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 3 states. [2018-09-26 08:19:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,247 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-09-26 08:19:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:40,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 08:19:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,251 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:19:40,252 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:19:40,255 INFO L605 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-09-26 08:19:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:19:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:19:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:19:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-09-26 08:19:40,275 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 44 [2018-09-26 08:19:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,276 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-09-26 08:19:40,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-09-26 08:19:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:19:40,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,278 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:40,281 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-09-26 08:19:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:40,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:40,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:40,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:40,328 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 3 states. [2018-09-26 08:19:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,376 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2018-09-26 08:19:40,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:40,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-26 08:19:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,379 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:19:40,379 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:19:40,380 INFO L605 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-09-26 08:19:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:19:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-26 08:19:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:19:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-09-26 08:19:40,392 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 53 [2018-09-26 08:19:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,394 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-09-26 08:19:40,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-09-26 08:19:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:19:40,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,401 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:40,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1051764193, now seen corresponding path program 1 times [2018-09-26 08:19:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 82 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:40,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:40,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:40,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:40,485 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 4 states. [2018-09-26 08:19:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,563 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2018-09-26 08:19:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:40,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-09-26 08:19:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,565 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:19:40,565 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:19:40,566 INFO L605 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-09-26 08:19:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:19:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-26 08:19:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:19:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-09-26 08:19:40,578 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 63 [2018-09-26 08:19:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,579 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-09-26 08:19:40,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-09-26 08:19:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:19:40,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,581 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:40,581 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2001830647, now seen corresponding path program 2 times [2018-09-26 08:19:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:40,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:40,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:40,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:40,659 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 5 states. [2018-09-26 08:19:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,759 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2018-09-26 08:19:40,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:40,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-09-26 08:19:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,762 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:19:40,762 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:19:40,763 INFO L605 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-09-26 08:19:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:19:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-26 08:19:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:19:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-09-26 08:19:40,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 73 [2018-09-26 08:19:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,775 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-09-26 08:19:40,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-09-26 08:19:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:19:40,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,781 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:40,782 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1874361807, now seen corresponding path program 3 times [2018-09-26 08:19:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 164 proven. 54 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:40,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:40,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:40,888 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 6 states. [2018-09-26 08:19:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:40,996 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2018-09-26 08:19:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:40,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-09-26 08:19:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:40,998 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:19:40,999 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:19:41,000 INFO L605 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-09-26 08:19:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:19:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-26 08:19:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:19:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-09-26 08:19:41,012 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 83 [2018-09-26 08:19:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,013 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-09-26 08:19:41,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2018-09-26 08:19:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:19:41,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,015 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,015 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1742353753, now seen corresponding path program 4 times [2018-09-26 08:19:41,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 205 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:41,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:41,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:41,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:41,168 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 7 states. [2018-09-26 08:19:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,328 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2018-09-26 08:19:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:19:41,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-09-26 08:19:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,329 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:19:41,329 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:41,331 INFO L605 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-09-26 08:19:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:41,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-09-26 08:19:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:41,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:41,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:41,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:41,517 INFO L422 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,518 INFO L422 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,518 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) the Hoare annotation is: false [2018-09-26 08:19:41,519 INFO L422 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,519 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 486) the Hoare annotation is: true [2018-09-26 08:19:41,520 INFO L422 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,520 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-09-26 08:19:41,520 INFO L422 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-09-26 08:19:41,521 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) [2018-09-26 08:19:41,521 INFO L422 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= 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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,522 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-09-26 08:19:41,522 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,524 INFO L426 ceAbstractionStarter]: For program point L459(lines 459 476) no Hoare annotation was computed. [2018-09-26 08:19:41,525 INFO L422 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= 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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,528 INFO L422 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= 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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,528 INFO L422 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-09-26 08:19:41,528 INFO L426 ceAbstractionStarter]: For program point L439(lines 439 456) no Hoare annotation was computed. [2018-09-26 08:19:41,529 INFO L422 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= 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)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-09-26 08:19:41,558 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:41 BoogieIcfgContainer [2018-09-26 08:19:41,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:41,562 INFO L168 Benchmark]: Toolchain (without parser) took 3444.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 306.5 MB). Peak memory consumption was 306.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:41,567 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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-09-26 08:19:41,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.87 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-09-26 08:19:41,568 INFO L168 Benchmark]: Boogie Preprocessor took 41.93 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-09-26 08:19:41,568 INFO L168 Benchmark]: RCFGBuilder took 798.72 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.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:41,569 INFO L168 Benchmark]: TraceAbstraction took 2549.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 274.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:41,575 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.17 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 45.87 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 41.93 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 798.72 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.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2549.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 274.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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: 417]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 || (4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || 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) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4480) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || 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) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || 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) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || 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) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 238 SDtfs, 29 SDslu, 86 SDs, 0 SdLazy, 734 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=11, 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, 12 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 128 NumberOfFragments, 271 HoareAnnotationTreeSize, 14 FomulaSimplifications, 931 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 67966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1292/1472 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_1.cil.c_16.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-41-590.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-41-590.csv Received shutdown request...