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_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:52,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:52,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:52,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:52,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:52,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:52,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:52,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:52,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:52,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:52,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:52,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:52,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:52,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:52,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:52,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:52,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:52,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:52,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:52,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:52,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:52,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:52,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:52,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:52,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:52,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:52,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:52,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:52,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:52,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:52,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:52,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:52,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:52,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:52,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:52,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:52,704 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,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:52,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:52,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:52,724 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:52,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:52,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:52,724 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:52,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:52,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:52,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:52,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:52,823 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:52,823 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:52,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2018-09-26 08:19:52,824 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2018-09-26 08:19:52,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:52,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:52,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:52,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:52,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:52,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:52,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:52,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:52,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:52,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:52,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:53,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:53,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:53,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:53,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/1) ... [2018-09-26 08:19:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:53,578 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:53,579 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:53 BoogieIcfgContainer [2018-09-26 08:19:53,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:53,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:53,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:53,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:53,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:52" (1/2) ... [2018-09-26 08:19:53,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2136685a and model type s3_srvr_7.cil.c_19.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,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:53" (2/2) ... [2018-09-26 08:19:53,590 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2018-09-26 08:19:53,600 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:53,614 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:53,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:53,660 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:53,660 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:53,660 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:53,660 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:53,660 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:53,661 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:53,661 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:53,661 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-09-26 08:19:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:19:53,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:53,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2018-09-26 08:19:53,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,850 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,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:53,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:53,873 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-09-26 08:19:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,950 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2018-09-26 08:19:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:53,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-09-26 08:19:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,980 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:19:53,981 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:19:53,985 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:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:19:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:19:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:19:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-09-26 08:19:54,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2018-09-26 08:19:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,033 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-09-26 08:19:54,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-09-26 08:19:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:54,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,034 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,035 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2018-09-26 08:19:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,075 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:54,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:54,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,081 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2018-09-26 08:19:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,154 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-09-26 08:19:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 08:19:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,156 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:19:54,156 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:19:54,158 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,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:19:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:19:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:19:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-09-26 08:19:54,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2018-09-26 08:19:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,163 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-09-26 08:19:54,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-09-26 08:19:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:19:54,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,164 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2018-09-26 08:19:54,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,207 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,208 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:54,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,210 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2018-09-26 08:19:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,291 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-09-26 08:19:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 08:19:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,292 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:19:54,296 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:19:54,296 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,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:19:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-26 08:19:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:19:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-09-26 08:19:54,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-09-26 08:19:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,307 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-09-26 08:19:54,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-09-26 08:19:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:19:54,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,311 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,312 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 471489091, now seen corresponding path program 1 times [2018-09-26 08:19:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,396 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,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:54,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:54,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:54,401 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-09-26 08:19:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,495 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-09-26 08:19:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:54,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-09-26 08:19:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,497 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:19:54,497 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:19:54,498 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:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:19:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 08:19:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:19:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-09-26 08:19:54,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2018-09-26 08:19:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,507 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-09-26 08:19:54,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-09-26 08:19:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:54,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,509 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,509 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2048264231, now seen corresponding path program 2 times [2018-09-26 08:19:54,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-26 08:19:54,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:19:54,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:54,560 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-09-26 08:19:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,620 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-09-26 08:19:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:54,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-09-26 08:19:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,622 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:19:54,622 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:19:54,623 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,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:19:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-09-26 08:19:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:19:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-09-26 08:19:54,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2018-09-26 08:19:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,633 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-09-26 08:19:54,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-09-26 08:19:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:19:54,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,635 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,635 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1703845991, now seen corresponding path program 1 times [2018-09-26 08:19:54,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:54,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:54,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:54,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:54,737 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-09-26 08:19:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,858 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-09-26 08:19:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:54,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-09-26 08:19:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,863 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:19:54,863 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:19:54,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:19:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-09-26 08:19:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:19:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-09-26 08:19:54,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 33 [2018-09-26 08:19:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,879 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-09-26 08:19:54,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-09-26 08:19:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:19:54,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,881 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:54,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -205689945, now seen corresponding path program 2 times [2018-09-26 08:19:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 91 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-09-26 08:19:54,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:54,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:54,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:54,963 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 5 states. [2018-09-26 08:19:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,019 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-09-26 08:19:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:55,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-09-26 08:19:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,021 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:19:55,021 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:19:55,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:19:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:19:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:19:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-26 08:19:55,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 47 [2018-09-26 08:19:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,042 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-26 08:19:55,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-26 08:19:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:19:55,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,047 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2018-09-26 08:19:55,047 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1173574567, now seen corresponding path program 3 times [2018-09-26 08:19:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-09-26 08:19:55,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:55,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:19:55,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:55,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:55,116 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-26 08:19:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,165 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-09-26 08:19:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:55,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-09-26 08:19:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,170 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:19:55,170 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:55,172 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:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:55,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-09-26 08:19:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,175 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:55,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:55,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:55,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:55,399 INFO L426 ceAbstractionStarter]: For program point L382(lines 377 392) no Hoare annotation was computed. [2018-09-26 08:19:55,403 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)) (= ULTIMATE.start_ssl3_accept_~s__state~5 8640))) [2018-09-26 08:19:55,405 INFO L422 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-09-26 08:19:55,405 INFO L426 ceAbstractionStarter]: For program point L391(lines 388 398) no Hoare annotation was computed. [2018-09-26 08:19:55,406 INFO L422 ceAbstractionStarter]: At program point L354(lines 351 364) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672))) [2018-09-26 08:19:55,406 INFO L422 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-09-26 08:19:55,407 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 405) the Hoare annotation is: true [2018-09-26 08:19:55,407 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 405) no Hoare annotation was computed. [2018-09-26 08:19:55,408 INFO L422 ceAbstractionStarter]: At program point L404(lines 286 404) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-09-26 08:19:55,408 INFO L426 ceAbstractionStarter]: For program point L371(lines 371 389) no Hoare annotation was computed. [2018-09-26 08:19:55,408 INFO L426 ceAbstractionStarter]: For program point L363(lines 363 378) no Hoare annotation was computed. [2018-09-26 08:19:55,408 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 405) no Hoare annotation was computed. [2018-09-26 08:19:55,409 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 352) the Hoare annotation is: false [2018-09-26 08:19:55,409 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 353) the Hoare annotation is: false [2018-09-26 08:19:55,410 INFO L422 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-09-26 08:19:55,411 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-09-26 08:19:55,427 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:55 BoogieIcfgContainer [2018-09-26 08:19:55,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:55,428 INFO L168 Benchmark]: Toolchain (without parser) took 2519.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,431 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:19:55,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.74 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:55,432 INFO L168 Benchmark]: Boogie Preprocessor took 53.48 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:55,433 INFO L168 Benchmark]: RCFGBuilder took 550.76 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,434 INFO L168 Benchmark]: TraceAbstraction took 1847.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:55,440 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.74 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 53.48 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 550.76 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1847.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: 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_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 8 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 21 SDslu, 40 SDs, 0 SdLazy, 234 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=7, 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, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 41 NumberOfFragments, 259 HoareAnnotationTreeSize, 10 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 16585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 371/423 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_7.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-55-460.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-55-460.csv Received shutdown request...