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_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:41,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:41,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:41,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:41,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:41,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:41,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:41,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:41,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:41,502 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:41,503 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:41,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:41,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:41,506 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:41,507 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:41,508 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:41,509 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:41,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:41,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:41,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:41,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:41,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:41,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:41,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:41,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:41,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:41,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:41,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:41,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:41,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:41,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:41,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:41,529 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:41,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:41,531 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:41,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:41,532 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:41,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:41,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:41,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:41,551 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:41,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:41,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:41,552 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:41,552 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:41,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:41,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:41,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:41,645 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:41,645 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:41,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-09-26 08:19:41,646 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-09-26 08:19:41,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:41,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:41,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:41,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:41,722 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:41,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:41,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:41,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:41,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:41,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:41,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:41,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:41,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:41,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/1) ... [2018-09-26 08:19:41,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:41,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:42,677 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:42,678 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:42 BoogieIcfgContainer [2018-09-26 08:19:42,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:42,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:42,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:42,685 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:42,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:41" (1/2) ... [2018-09-26 08:19:42,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25269c7c and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:42, skipping insertion in model container [2018-09-26 08:19:42,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:42" (2/2) ... [2018-09-26 08:19:42,690 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-09-26 08:19:42,701 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:42,711 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:42,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:42,765 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:42,765 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:42,765 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:42,765 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:42,766 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:42,766 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:42,766 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:42,766 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-09-26 08:19:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:42,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-09-26 08:19:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,898 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:42,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:42,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,928 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-09-26 08:19:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,989 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-09-26 08:19:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 08:19:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,005 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:19:43,006 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:19:43,010 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:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:19:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:19:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:19:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-09-26 08:19:43,054 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-09-26 08:19:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,055 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-09-26 08:19:43,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-09-26 08:19:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:19:43,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,057 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,057 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-09-26 08:19:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,110 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:43,110 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,114 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-09-26 08:19:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,193 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-09-26 08:19:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 08:19:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,195 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:19:43,195 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:19:43,197 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:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:19:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:19:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:19:43,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-09-26 08:19:43,204 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-09-26 08:19:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,204 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-09-26 08:19:43,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-09-26 08:19:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:19:43,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,206 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-09-26 08:19:43,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,248 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:43,251 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,253 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-09-26 08:19:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,328 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-09-26 08:19:43,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 08:19:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,330 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:19:43,331 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:19:43,332 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:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:19:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:19:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:19:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-09-26 08:19:43,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-09-26 08:19:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,343 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-09-26 08:19:43,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-09-26 08:19:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:19:43,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,347 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-09-26 08:19:43,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,375 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:43,376 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,377 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-09-26 08:19:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,428 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-09-26 08:19:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 08:19:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,433 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:19:43,433 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:19:43,434 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:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:19:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:19:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:19:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-09-26 08:19:43,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-09-26 08:19:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,447 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-09-26 08:19:43,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-09-26 08:19:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:43,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,449 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:43,453 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1120823750, now seen corresponding path program 1 times [2018-09-26 08:19:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,496 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:43,503 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,507 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-09-26 08:19:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,571 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-09-26 08:19:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 08:19:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,573 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:19:43,573 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:19:43,574 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:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:19:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:19:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:19:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-09-26 08:19:43,586 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-09-26 08:19:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,586 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-09-26 08:19:43,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-09-26 08:19:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:19:43,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,589 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:43,589 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1129262250, now seen corresponding path program 1 times [2018-09-26 08:19:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:43,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:43,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:43,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:43,669 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2018-09-26 08:19:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,739 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-09-26 08:19:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:43,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-09-26 08:19:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,743 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:19:43,743 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:19:43,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:19:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-09-26 08:19:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:19:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-09-26 08:19:43,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 35 [2018-09-26 08:19:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,770 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-09-26 08:19:43,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-09-26 08:19:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:19:43,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,774 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,774 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 221846095, now seen corresponding path program 2 times [2018-09-26 08:19:43,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-26 08:19:43,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,826 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2018-09-26 08:19:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,897 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2018-09-26 08:19:43,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-09-26 08:19:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,900 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:19:43,900 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:19:43,901 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:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:19:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-09-26 08:19:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:19:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-09-26 08:19:43,922 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 48 [2018-09-26 08:19:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,924 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-09-26 08:19:43,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-09-26 08:19:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:19:43,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,930 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,930 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -823167015, now seen corresponding path program 1 times [2018-09-26 08:19:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-26 08:19:43,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,993 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 3 states. [2018-09-26 08:19:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,039 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-09-26 08:19:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-26 08:19:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,042 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:19:44,043 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:19:44,048 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:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:19:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:19:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:19:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2018-09-26 08:19:44,067 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 58 [2018-09-26 08:19:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,068 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2018-09-26 08:19:44,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2018-09-26 08:19:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:19:44,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,071 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,073 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash -840979935, now seen corresponding path program 1 times [2018-09-26 08:19:44,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-09-26 08:19:44,134 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:44,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:44,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:44,136 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 3 states. [2018-09-26 08:19:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,171 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-09-26 08:19:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:44,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-09-26 08:19:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,174 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:19:44,174 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:19:44,175 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:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:19:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:19:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:19:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-09-26 08:19:44,190 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 67 [2018-09-26 08:19:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,190 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-09-26 08:19:44,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-09-26 08:19:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:19:44,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,192 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1809848535, now seen corresponding path program 1 times [2018-09-26 08:19:44,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 08:19:44,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:44,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:44,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:44,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:44,265 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 4 states. [2018-09-26 08:19:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,362 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-09-26 08:19:44,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:44,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-09-26 08:19:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,365 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:19:44,365 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:19:44,367 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:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:19:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-09-26 08:19:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:19:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-09-26 08:19:44,399 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 76 [2018-09-26 08:19:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,399 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-09-26 08:19:44,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-09-26 08:19:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:19:44,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,404 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,404 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1729106847, now seen corresponding path program 2 times [2018-09-26 08:19:44,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 08:19:44,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:44,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:44,514 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 5 states. [2018-09-26 08:19:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,620 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2018-09-26 08:19:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:44,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-09-26 08:19:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,623 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:19:44,623 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:19:44,624 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:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:19:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-09-26 08:19:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:19:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-09-26 08:19:44,649 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 86 [2018-09-26 08:19:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,651 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-09-26 08:19:44,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-09-26 08:19:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:19:44,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,653 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,653 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1042523285, now seen corresponding path program 3 times [2018-09-26 08:19:44,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 08:19:44,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:44,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:44,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:44,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:44,809 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 6 states. [2018-09-26 08:19:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,940 INFO L93 Difference]: Finished difference Result 315 states and 361 transitions. [2018-09-26 08:19:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:44,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-09-26 08:19:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,942 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:19:44,942 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:19:44,943 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:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:19:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-09-26 08:19:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:19:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-09-26 08:19:44,960 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 96 [2018-09-26 08:19:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,960 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-09-26 08:19:44,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-09-26 08:19:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:19:44,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,963 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,963 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1371994635, now seen corresponding path program 4 times [2018-09-26 08:19:44,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-09-26 08:19:45,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:45,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:45,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:45,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:45,173 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 7 states. [2018-09-26 08:19:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:45,324 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-09-26 08:19:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:19:45,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-09-26 08:19:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:45,326 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:19:45,326 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:45,327 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:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:45,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-09-26 08:19:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:45,329 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:45,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:45,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:45,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:45,667 INFO L422 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:45,668 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-09-26 08:19:45,668 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 386) no Hoare annotation was computed. [2018-09-26 08:19:45,669 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:45,670 INFO L422 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-09-26 08:19:45,670 INFO L426 ceAbstractionStarter]: For program point L362(lines 357 375) no Hoare annotation was computed. [2018-09-26 08:19:45,671 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:45,672 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-09-26 08:19:45,672 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-09-26 08:19:45,672 INFO L422 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-09-26 08:19:45,673 INFO L422 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))))) [2018-09-26 08:19:45,674 INFO L422 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)))) [2018-09-26 08:19:45,674 INFO L422 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-09-26 08:19:45,674 INFO L426 ceAbstractionStarter]: For program point L388(lines 385 401) no Hoare annotation was computed. [2018-09-26 08:19:45,674 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-09-26 08:19:45,675 INFO L422 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:45,675 INFO L426 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-09-26 08:19:45,676 INFO L426 ceAbstractionStarter]: For program point L480(lines 480 497) no Hoare annotation was computed. [2018-09-26 08:19:45,676 INFO L422 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:45,677 INFO L426 ceAbstractionStarter]: For program point L460(lines 460 477) no Hoare annotation was computed. [2018-09-26 08:19:45,677 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) the Hoare annotation is: false [2018-09-26 08:19:45,682 INFO L422 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-09-26 08:19:45,716 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:45 BoogieIcfgContainer [2018-09-26 08:19:45,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:45,720 INFO L168 Benchmark]: Toolchain (without parser) took 4001.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:45,722 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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:45,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.59 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:45,725 INFO L168 Benchmark]: Boogie Preprocessor took 61.82 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:45,725 INFO L168 Benchmark]: RCFGBuilder took 851.75 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:45,726 INFO L168 Benchmark]: TraceAbstraction took 3034.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:45,735 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.15 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 42.59 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 61.82 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 851.75 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 3034.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4528) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4512)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 13 OverallIterations, 14 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 53 SDslu, 124 SDs, 0 SdLazy, 742 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 578 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1098 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 86073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2088/2267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-45-762.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-45-762.csv Received shutdown request...