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_srvr_4.cil.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:52,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:52,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:52,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:52,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:52,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:52,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:52,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:52,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:52,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:52,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:52,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:52,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:52,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:52,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:52,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:52,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:52,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:52,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:52,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:52,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:52,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:52,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:52,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:52,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:52,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:52,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:52,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:52,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:52,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:52,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:52,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:52,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:52,733 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:52,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:52,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:52,735 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:52,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:52,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:52,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:52,745 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:52,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:52,745 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:52,745 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:52,745 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:52,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:52,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:52,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:52,810 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:52,811 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:52,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl [2018-09-26 08:19:52,812 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl' [2018-09-26 08:19:52,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:52,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:52,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:52,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:52,897 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:52,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:52,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:52,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:52,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:52,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:53,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:53,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:53,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:53,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:53,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:53,429 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:53,430 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:53 BoogieIcfgContainer [2018-09-26 08:19:53,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:53,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:53,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:53,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:53,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/2) ... [2018-09-26 08:19:53,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3b3689 and model type s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:53, skipping insertion in model container [2018-09-26 08:19:53,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:53" (2/2) ... [2018-09-26 08:19:53,440 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c_14.bpl [2018-09-26 08:19:53,451 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:53,461 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:53,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:53,510 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:53,510 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:53,511 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:53,511 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:53,511 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:53,511 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:53,511 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:53,512 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-26 08:19:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:19:53,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,546 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 212045975, now seen corresponding path program 1 times [2018-09-26 08:19:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,733 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:53,736 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:53,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,762 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-09-26 08:19:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,811 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-09-26 08:19:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 08:19:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,826 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:19:53,827 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:19:53,837 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:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:19:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:19:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:19:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-09-26 08:19:53,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-09-26 08:19:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,883 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-09-26 08:19:53,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-09-26 08:19:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:19:53,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,885 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,885 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -251001873, now seen corresponding path program 1 times [2018-09-26 08:19:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,935 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:53,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:53,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,939 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 3 states. [2018-09-26 08:19:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,979 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2018-09-26 08:19:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-26 08:19:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,981 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:19:53,981 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:19:53,982 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:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:19:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:19:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:19:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-09-26 08:19:53,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2018-09-26 08:19:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-09-26 08:19:53,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2018-09-26 08:19:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:19:53,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,989 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -129109843, now seen corresponding path program 1 times [2018-09-26 08:19:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,041 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:54,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:54,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,047 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2018-09-26 08:19:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,110 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2018-09-26 08:19:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-26 08:19:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,112 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:19:54,112 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:19:54,113 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:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:19:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:19:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:19:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-09-26 08:19:54,128 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2018-09-26 08:19:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,128 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-09-26 08:19:54,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-09-26 08:19:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:19:54,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,132 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,132 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash 599625481, now seen corresponding path program 1 times [2018-09-26 08:19:54,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:54,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:54,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:54,235 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 4 states. [2018-09-26 08:19:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,266 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-09-26 08:19:54,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:54,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-09-26 08:19:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,268 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:19:54,268 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:19:54,269 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:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:19:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:19:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:19:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-09-26 08:19:54,277 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 21 [2018-09-26 08:19:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,278 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-09-26 08:19:54,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-09-26 08:19:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:19:54,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,279 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,280 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -616826779, now seen corresponding path program 2 times [2018-09-26 08:19:54,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:54,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,330 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 3 states. [2018-09-26 08:19:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,361 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2018-09-26 08:19:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-09-26 08:19:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,363 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:19:54,363 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:19:54,364 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:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:19:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:19:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:19:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-09-26 08:19:54,375 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2018-09-26 08:19:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,377 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-09-26 08:19:54,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-09-26 08:19:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:19:54,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,381 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,382 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash 63414829, now seen corresponding path program 1 times [2018-09-26 08:19:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-26 08:19:54,455 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:54,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,459 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-09-26 08:19:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,508 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-09-26 08:19:54,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 08:19:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,510 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:19:54,510 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:19:54,511 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:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:19:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:19:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:19:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-09-26 08:19:54,529 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2018-09-26 08:19:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,530 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-09-26 08:19:54,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-09-26 08:19:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:19:54,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,531 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,532 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1473076375, now seen corresponding path program 1 times [2018-09-26 08:19:54,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 64 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-26 08:19:54,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:54,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:54,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:54,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:54,583 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2018-09-26 08:19:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,646 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-09-26 08:19:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:54,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-26 08:19:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,648 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:19:54,648 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:54,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:54,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-09-26 08:19:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,651 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:54,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:54,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:54,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:54,779 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 391) the Hoare annotation is: false [2018-09-26 08:19:54,779 INFO L426 ceAbstractionStarter]: For program point L349(lines 349 364) no Hoare annotation was computed. [2018-09-26 08:19:54,779 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 389) the Hoare annotation is: false [2018-09-26 08:19:54,782 INFO L422 ceAbstractionStarter]: At program point L339(lines 339 350) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0))) [2018-09-26 08:19:54,782 INFO L426 ceAbstractionStarter]: For program point L368(lines 363 383) no Hoare annotation was computed. [2018-09-26 08:19:54,783 INFO L422 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8464) .cse0))) [2018-09-26 08:19:54,784 INFO L422 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0))) [2018-09-26 08:19:54,784 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 391) the Hoare annotation is: true [2018-09-26 08:19:54,785 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 391) no Hoare annotation was computed. [2018-09-26 08:19:54,786 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) the Hoare annotation is: false [2018-09-26 08:19:54,786 INFO L422 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8464) .cse0))) [2018-09-26 08:19:54,787 INFO L422 ceAbstractionStarter]: At program point L357(lines 357 375) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) [2018-09-26 08:19:54,789 INFO L422 ceAbstractionStarter]: At program point L388(lines 286 388) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0))) [2018-09-26 08:19:54,789 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 4)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640) .cse0) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5) .cse0))) [2018-09-26 08:19:54,810 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:54 BoogieIcfgContainer [2018-09-26 08:19:54,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:54,812 INFO L168 Benchmark]: Toolchain (without parser) took 1918.84 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: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:54,815 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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:54,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.07 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:54,819 INFO L168 Benchmark]: Boogie Preprocessor took 57.96 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:54,820 INFO L168 Benchmark]: RCFGBuilder took 415.50 ms. Allocated memory is still 1.5 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:54,822 INFO L168 Benchmark]: TraceAbstraction took 1379.25 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:54,827 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.16 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 59.07 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 57.96 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 415.50 ms. Allocated memory is still 1.5 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 1379.25 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8464 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8464 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~s__state~5 <= 8640) && !(ssl3_accept_~blastFlag~5 == 4))) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 4))) || (8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4)) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~5 && !(ssl3_accept_~blastFlag~5 == 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 7 OverallIterations, 7 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 88 SDtfs, 9 SDslu, 36 SDs, 0 SdLazy, 109 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 58 NumberOfFragments, 222 HoareAnnotationTreeSize, 11 FomulaSimplifications, 264 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 6368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 209/220 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_srvr_4.cil.c_14.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-54-847.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.c_14.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-54-847.csv Received shutdown request...