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_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:39,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:39,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:39,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:39,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:39,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:39,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:39,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:39,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:39,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:39,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:39,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:39,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:39,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:39,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:39,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:39,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:39,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:39,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:39,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:39,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:39,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:39,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:39,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:39,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:39,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:39,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:39,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:39,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:39,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:39,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:39,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:39,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:39,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:39,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:39,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:39,964 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:39,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:39,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:39,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:39,975 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:39,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:39,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:39,975 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:39,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:40,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:40,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:40,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:40,063 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:40,063 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:40,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-26 08:19:40,065 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-09-26 08:19:40,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:40,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:40,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:40,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:40,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:40,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:40,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:40,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:40,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:40,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:40,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:40,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:40,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:40,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:41,061 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:41,062 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:41 BoogieIcfgContainer [2018-09-26 08:19:41,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:41,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:41,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:41,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:41,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/2) ... [2018-09-26 08:19:41,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef4bba0 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:41, skipping insertion in model container [2018-09-26 08:19:41,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:41" (2/2) ... [2018-09-26 08:19:41,076 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-09-26 08:19:41,087 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:41,097 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:41,147 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:41,148 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:41,149 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:41,149 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:41,149 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:41,149 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:41,149 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:41,150 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:41,150 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-09-26 08:19:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:41,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-09-26 08:19:41,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,280 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:41,283 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:41,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:41,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:41,310 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-09-26 08:19:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,408 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-09-26 08:19:41,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:41,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 08:19:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,424 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:19:41,425 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:19:41,428 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:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:19:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:19:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:19:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-09-26 08:19:41,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-09-26 08:19:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,471 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-09-26 08:19:41,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-09-26 08:19:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:19:41,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,472 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,473 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-09-26 08:19:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,501 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:41,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:41,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:41,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:41,505 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-09-26 08:19:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,548 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-09-26 08:19:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:41,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 08:19:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,550 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:19:41,551 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:19:41,552 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:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:19:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:19:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:19:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-09-26 08:19:41,558 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-09-26 08:19:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,558 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-09-26 08:19:41,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-09-26 08:19:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:19:41,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,559 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-09-26 08:19:41,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,587 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:41,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:41,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:41,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:41,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:41,590 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-09-26 08:19:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,630 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-09-26 08:19:41,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:41,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 08:19:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,632 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:19:41,632 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:19:41,633 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:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:19:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:19:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:19:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-09-26 08:19:41,640 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-09-26 08:19:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,641 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-09-26 08:19:41,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-09-26 08:19:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:19:41,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,642 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,642 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash -916394828, now seen corresponding path program 1 times [2018-09-26 08:19:41,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:41,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:41,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:41,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:41,711 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2018-09-26 08:19:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,742 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-09-26 08:19:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:41,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-09-26 08:19:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,743 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:19:41,744 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:19:41,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:19:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-09-26 08:19:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:19:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2018-09-26 08:19:41,763 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 22 [2018-09-26 08:19:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,763 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2018-09-26 08:19:41,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2018-09-26 08:19:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:19:41,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,765 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,767 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -277925477, now seen corresponding path program 2 times [2018-09-26 08:19:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:41,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:41,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:41,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:41,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:41,824 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 5 states. [2018-09-26 08:19:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,894 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2018-09-26 08:19:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:41,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-09-26 08:19:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,898 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:19:41,899 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:19:41,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:19:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2018-09-26 08:19:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:19:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2018-09-26 08:19:41,925 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 27 [2018-09-26 08:19:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,925 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2018-09-26 08:19:41,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2018-09-26 08:19:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:19:41,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,931 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,931 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash -327626543, now seen corresponding path program 1 times [2018-09-26 08:19:41,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 08:19:41,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:41,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:41,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:41,992 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2018-09-26 08:19:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,077 INFO L93 Difference]: Finished difference Result 121 states and 181 transitions. [2018-09-26 08:19:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-09-26 08:19:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,081 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:19:42,081 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:19:42,084 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:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:19:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-09-26 08:19:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:19:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2018-09-26 08:19:42,108 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 33 [2018-09-26 08:19:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,109 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2018-09-26 08:19:42,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2018-09-26 08:19:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:19:42,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,112 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,113 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1495736227, now seen corresponding path program 1 times [2018-09-26 08:19:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-26 08:19:42,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:42,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,191 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand 3 states. [2018-09-26 08:19:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,259 INFO L93 Difference]: Finished difference Result 134 states and 182 transitions. [2018-09-26 08:19:42,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-26 08:19:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,261 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:19:42,261 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:19:42,262 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:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:19:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:19:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:19:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-09-26 08:19:42,286 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 43 [2018-09-26 08:19:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,288 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-09-26 08:19:42,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-09-26 08:19:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:19:42,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,291 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1811127759, now seen corresponding path program 1 times [2018-09-26 08:19:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-26 08:19:42,335 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:42,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,337 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 3 states. [2018-09-26 08:19:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,375 INFO L93 Difference]: Finished difference Result 149 states and 198 transitions. [2018-09-26 08:19:42,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 08:19:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,377 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:19:42,381 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:19:42,382 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:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:19:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:19:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:19:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2018-09-26 08:19:42,402 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 50 [2018-09-26 08:19:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,404 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2018-09-26 08:19:42,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-09-26 08:19:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:19:42,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,409 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1362781927, now seen corresponding path program 1 times [2018-09-26 08:19:42,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-09-26 08:19:42,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:42,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,479 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand 3 states. [2018-09-26 08:19:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,522 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2018-09-26 08:19:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-09-26 08:19:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,524 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:19:42,525 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:19:42,525 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:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:19:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:19:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:19:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2018-09-26 08:19:42,554 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 59 [2018-09-26 08:19:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,555 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2018-09-26 08:19:42,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-09-26 08:19:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:19:42,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,561 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 541073165, now seen corresponding path program 1 times [2018-09-26 08:19:42,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:42,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:42,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:42,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:42,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:42,619 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand 4 states. [2018-09-26 08:19:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,705 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2018-09-26 08:19:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:42,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-09-26 08:19:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,708 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:19:42,709 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:19:42,709 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:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:19:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-09-26 08:19:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:19:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2018-09-26 08:19:42,733 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 68 [2018-09-26 08:19:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,736 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2018-09-26 08:19:42,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2018-09-26 08:19:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:19:42,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,739 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,739 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1413403359, now seen corresponding path program 2 times [2018-09-26 08:19:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 175 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:42,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:42,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:42,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:42,820 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 5 states. [2018-09-26 08:19:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,936 INFO L93 Difference]: Finished difference Result 304 states and 370 transitions. [2018-09-26 08:19:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:42,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-09-26 08:19:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,939 INFO L225 Difference]: With dead ends: 304 [2018-09-26 08:19:42,939 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:19:42,940 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:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:19:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-09-26 08:19:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:19:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2018-09-26 08:19:42,971 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 78 [2018-09-26 08:19:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,971 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2018-09-26 08:19:42,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-09-26 08:19:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:19:42,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,979 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,980 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 794060849, now seen corresponding path program 3 times [2018-09-26 08:19:42,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:43,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:43,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:43,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:43,119 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand 6 states. [2018-09-26 08:19:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,262 INFO L93 Difference]: Finished difference Result 364 states and 430 transitions. [2018-09-26 08:19:43,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:43,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-09-26 08:19:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,265 INFO L225 Difference]: With dead ends: 364 [2018-09-26 08:19:43,265 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:19:43,266 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:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:19:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-09-26 08:19:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:19:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2018-09-26 08:19:43,291 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 88 [2018-09-26 08:19:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,291 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2018-09-26 08:19:43,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2018-09-26 08:19:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:19:43,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,293 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1049297149, now seen corresponding path program 4 times [2018-09-26 08:19:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 273 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-26 08:19:43,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:43,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:43,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:43,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:43,467 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand 7 states. [2018-09-26 08:19:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,680 INFO L93 Difference]: Finished difference Result 395 states and 445 transitions. [2018-09-26 08:19:43,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:19:43,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-09-26 08:19:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,681 INFO L225 Difference]: With dead ends: 395 [2018-09-26 08:19:43,682 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:43,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:19:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:43,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-09-26 08:19:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,685 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:43,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:43,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:43,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:44,022 INFO L426 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-09-26 08:19:44,023 INFO L422 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,025 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,025 INFO L422 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5))) [2018-09-26 08:19:44,026 INFO L422 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,026 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 307) no Hoare annotation was computed. [2018-09-26 08:19:44,026 INFO L426 ceAbstractionStarter]: For program point L420(lines 420 437) no Hoare annotation was computed. [2018-09-26 08:19:44,027 INFO L422 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,028 INFO L422 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,028 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 2 464) the Hoare annotation is: true [2018-09-26 08:19:44,028 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-09-26 08:19:44,029 INFO L422 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,030 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) the Hoare annotation is: false [2018-09-26 08:19:44,030 INFO L422 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,031 INFO L422 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,032 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-09-26 08:19:44,032 INFO L422 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-09-26 08:19:44,033 INFO L422 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,033 INFO L422 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2) (and (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) .cse0 (or (= ULTIMATE.start_ssl3_connect_~s__state~3 4528) (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (= ULTIMATE.start_ssl3_connect_~s__state~3 4512))))) [2018-09-26 08:19:44,034 INFO L426 ceAbstractionStarter]: For program point L311(lines 306 330) no Hoare annotation was computed. [2018-09-26 08:19:44,053 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:44 BoogieIcfgContainer [2018-09-26 08:19:44,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:44,054 INFO L168 Benchmark]: Toolchain (without parser) took 3894.05 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:44,056 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:44,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.11 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:44,058 INFO L168 Benchmark]: Boogie Preprocessor took 63.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:44,058 INFO L168 Benchmark]: RCFGBuilder took 774.55 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:44,059 INFO L168 Benchmark]: TraceAbstraction took 2986.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 369.9 MB). Peak memory consumption was 369.9 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:44,063 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.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.11 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.27 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 774.55 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2986.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 369.9 MB). Peak memory consumption was 369.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4368 || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4368 || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5)) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4368 || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4368 || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2) || (((4512 <= ssl3_connect_~s__state~3 || ssl3_connect_~s__state~3 <= 4352) && !(ssl3_connect_~blastFlag~3 == 5)) && ((ssl3_connect_~s__state~3 == 4528 || 4560 == ssl3_connect_~s__s3__tmp__next_state___0~3) || ssl3_connect_~s__state~3 == 4512)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 266 SDtfs, 77 SDslu, 141 SDs, 0 SdLazy, 758 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 196 NumberOfFragments, 555 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4340 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 73724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1646/1816 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_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-44-079.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-44-079.csv Received shutdown request...