java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:24:57,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:24:57,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:24:57,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:24:57,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:24:57,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:24:57,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:24:57,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:24:57,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:24:57,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:24:57,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:24:57,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:24:57,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:24:57,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:24:57,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:24:57,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:24:57,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:24:57,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:24:57,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:24:57,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:24:57,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:24:57,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:24:57,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:24:57,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:24:57,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:24:57,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:24:57,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:24:57,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:24:57,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:24:57,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:24:57,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:24:57,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:24:57,666 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:24:57,666 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:24:57,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:24:57,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:24:57,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:24:57,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:24:57,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:24:57,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:24:57,680 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:24:57,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:24:57,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:24:57,680 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:24:57,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:24:57,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:24:57,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:24:57,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:24:57,756 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:24:57,757 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:24:57,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-07-25 13:24:57,758 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-07-25 13:24:57,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:24:57,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:24:57,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:57,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:24:57,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:24:57,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:57,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:24:57,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:24:57,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:24:57,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:24:57,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:24:57,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:24:57,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:24:57,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/1) ... [2018-07-25 13:24:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:24:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:24:58,109 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:24:58,110 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:58 BoogieIcfgContainer [2018-07-25 13:24:58,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:24:58,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:24:58,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:24:58,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:24:58,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:57" (1/2) ... [2018-07-25 13:24:58,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c817345 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:24:58, skipping insertion in model container [2018-07-25 13:24:58,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:58" (2/2) ... [2018-07-25 13:24:58,121 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-07-25 13:24:58,131 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:24:58,140 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:24:58,187 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:24:58,188 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:24:58,188 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:24:58,188 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:24:58,188 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:24:58,189 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:24:58,189 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:24:58,189 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:24:58,189 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:24:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-07-25 13:24:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:24:58,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,214 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,216 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-07-25 13:24:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,322 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:58,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:24:58,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:24:58,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:24:58,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:24:58,346 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-07-25 13:24:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,376 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-07-25 13:24:58,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:24:58,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-07-25 13:24:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,389 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:24:58,389 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:24:58,396 INFO L574 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-07-25 13:24:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:24:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:24:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:24:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-07-25 13:24:58,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-07-25 13:24:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,441 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-07-25 13:24:58,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:24:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-07-25 13:24:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:24:58,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,442 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,444 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,444 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-07-25 13:24:58,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:58,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:24:58,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:24:58,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:24:58,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:24:58,481 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-07-25 13:24:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,513 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-07-25 13:24:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:24:58,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 13:24:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,516 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:24:58,516 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:24:58,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07-25 13:24:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:24:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:24:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:24:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-07-25 13:24:58,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-07-25 13:24:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,522 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-07-25 13:24:58,522 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:24:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-07-25 13:24:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:24:58,522 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,523 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,523 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2018-07-25 13:24:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:58,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:24:58,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:24:58,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:24:58,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:58,558 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-07-25 13:24:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,590 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-07-25 13:24:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:24:58,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-25 13:24:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,592 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:24:58,592 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:24:58,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:24:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:24:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:24:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-07-25 13:24:58,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2018-07-25 13:24:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,600 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-07-25 13:24:58,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:24:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-07-25 13:24:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:24:58,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,602 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,602 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1715698183, now seen corresponding path program 3 times [2018-07-25 13:24:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:58,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:24:58,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:24:58,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:24:58,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:58,692 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-07-25 13:24:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,726 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-07-25 13:24:58,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:24:58,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-25 13:24:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,727 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:24:58,728 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:24:58,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:24:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:24:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:24:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-07-25 13:24:58,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2018-07-25 13:24:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,734 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-07-25 13:24:58,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:24:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-07-25 13:24:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:24:58,735 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,735 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,735 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash 531112371, now seen corresponding path program 4 times [2018-07-25 13:24:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:58,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:58,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:24:58,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:24:58,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:24:58,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:58,776 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-07-25 13:24:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,803 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-07-25 13:24:58,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:24:58,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-25 13:24:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,805 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:24:58,805 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:24:58,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:24:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:24:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:24:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-07-25 13:24:58,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-07-25 13:24:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,811 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-07-25 13:24:58,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:24:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-07-25 13:24:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:24:58,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,812 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,813 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash -652495123, now seen corresponding path program 5 times [2018-07-25 13:24:58,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 13:24:58,879 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:58,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:24:58,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:24:58,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:24:58,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:24:58,883 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-07-25 13:24:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:58,912 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-07-25 13:24:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:24:58,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-07-25 13:24:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:58,914 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:24:58,914 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:24:58,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07-25 13:24:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:24:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-07-25 13:24:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:24:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-07-25 13:24:58,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-07-25 13:24:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:58,922 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-07-25 13:24:58,922 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:24:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-07-25 13:24:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:24:58,923 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:58,923 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:58,924 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -386140989, now seen corresponding path program 1 times [2018-07-25 13:24:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 13:24:58,981 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:58,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:24:58,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:24:58,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:24:58,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:58,982 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-07-25 13:24:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,030 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-07-25 13:24:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:24:59,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-07-25 13:24:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,032 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:24:59,032 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:24:59,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:24:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-07-25 13:24:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:24:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-07-25 13:24:59,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-07-25 13:24:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,041 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-07-25 13:24:59,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:24:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-07-25 13:24:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:24:59,043 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,043 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:24:59,043 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1646565475, now seen corresponding path program 1 times [2018-07-25 13:24:59,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 13:24:59,088 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,088 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:24:59,090 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:24:59,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:24:59,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:59,091 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-07-25 13:24:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,150 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-07-25 13:24:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:24:59,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-07-25 13:24:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,152 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:24:59,152 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:24:59,153 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:24:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:24:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:24:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-07-25 13:24:59,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-07-25 13:24:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,163 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-07-25 13:24:59,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:24:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-07-25 13:24:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:24:59,164 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,164 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:24:59,164 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -267137677, now seen corresponding path program 2 times [2018-07-25 13:24:59,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,245 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-25 13:24:59,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:24:59,246 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:24:59,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:24:59,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:59,251 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-07-25 13:24:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,342 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-07-25 13:24:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:24:59,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-07-25 13:24:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,347 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:24:59,347 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:24:59,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:24:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:24:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-07-25 13:24:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:24:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-25 13:24:59,365 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-07-25 13:24:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,366 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-25 13:24:59,366 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:24:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-25 13:24:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:24:59,370 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,370 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:24:59,370 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -735824691, now seen corresponding path program 3 times [2018-07-25 13:24:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 13:24:59,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:24:59,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:24:59,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:24:59,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:59,430 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-07-25 13:24:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,479 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-07-25 13:24:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:24:59,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-07-25 13:24:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,480 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:24:59,480 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:24:59,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:24:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:24:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:24:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:24:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-07-25 13:24:59,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-07-25 13:24:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,497 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-07-25 13:24:59,497 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:24:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-07-25 13:24:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:24:59,498 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,499 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-07-25 13:24:59,499 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2097831421, now seen corresponding path program 4 times [2018-07-25 13:24:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-07-25 13:24:59,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:24:59,547 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:24:59,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:24:59,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:59,548 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-07-25 13:24:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,631 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-07-25 13:24:59,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:24:59,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-07-25 13:24:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,632 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:24:59,633 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:24:59,635 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:24:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:24:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-07-25 13:24:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:24:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-07-25 13:24:59,653 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2018-07-25 13:24:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,654 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-07-25 13:24:59,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:24:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-07-25 13:24:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:24:59,659 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,660 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 3, 3, 1, 1, 1, 1] [2018-07-25 13:24:59,661 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -103625897, now seen corresponding path program 5 times [2018-07-25 13:24:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-25 13:24:59,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:24:59,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:24:59,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:24:59,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:24:59,712 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2018-07-25 13:24:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,783 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-07-25 13:24:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:24:59,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-07-25 13:24:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,787 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:24:59,787 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:24:59,788 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:24:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:24:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:24:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:24:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-07-25 13:24:59,813 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2018-07-25 13:24:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,814 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-07-25 13:24:59,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:24:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-07-25 13:24:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:24:59,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,816 INFO L354 BasicCegarLoop]: trace histogram [10, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 13:24:59,816 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1754318879, now seen corresponding path program 6 times [2018-07-25 13:24:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-25 13:24:59,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:24:59,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:24:59,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:24:59,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:24:59,898 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-07-25 13:24:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,967 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-07-25 13:24:59,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:24:59,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-07-25 13:24:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,969 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:24:59,969 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:24:59,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:24:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:24:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-07-25 13:24:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:24:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-07-25 13:24:59,997 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 44 [2018-07-25 13:24:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,999 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-07-25 13:24:59,999 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:25:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-07-25 13:25:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:25:00,001 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:00,001 INFO L354 BasicCegarLoop]: trace histogram [11, 7, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 13:25:00,002 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1924807867, now seen corresponding path program 7 times [2018-07-25 13:25:00,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 74 proven. 44 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-07-25 13:25:00,064 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:00,064 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:25:00,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:25:00,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:25:00,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:25:00,066 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 11 states. [2018-07-25 13:25:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:00,173 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-07-25 13:25:00,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:25:00,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-07-25 13:25:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:00,175 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:25:00,175 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:25:00,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:25:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:25:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:25:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:25:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-07-25 13:25:00,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-07-25 13:25:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:00,209 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-07-25 13:25:00,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:25:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-07-25 13:25:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:25:00,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:00,213 INFO L354 BasicCegarLoop]: trace histogram [15, 10, 6, 6, 5, 5, 5, 1, 1, 1, 1] [2018-07-25 13:25:00,215 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1394491679, now seen corresponding path program 8 times [2018-07-25 13:25:00,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 134 proven. 52 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-25 13:25:00,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:00,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:25:00,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:25:00,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:25:00,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:25:00,458 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 13 states. [2018-07-25 13:25:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:00,517 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-07-25 13:25:00,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:25:00,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-07-25 13:25:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:00,518 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:25:00,519 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:25:00,519 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:25:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:25:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:25:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:25:00,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-07-25 13:25:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:00,524 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:25:00,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:25:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:25:00,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:25:00,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:25:00,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:25:00,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:25:00,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:25:00,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 13:25:00,725 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-07-25 13:25:00,726 INFO L418 ceAbstractionStarter]: At program point L56(lines 56 70) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 13:25:00,726 INFO L418 ceAbstractionStarter]: At program point L79(lines 79 91) the Hoare annotation is: (and (<= (+ ULTIMATE.start_SelectionSort_~i~4 4) ~n) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4) (<= ~n 5) (= 0 (select ~array 1)) (= 0 ULTIMATE.start_SelectionSort_~rh~4) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 13:25:00,727 INFO L418 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-07-25 13:25:00,727 INFO L418 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (<= (+ ULTIMATE.start_SelectionSort_~i~4 4) ~n) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4) (<= ~n 5) (= 0 (select ~array 1)) (= 0 ULTIMATE.start_SelectionSort_~rh~4) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 13:25:00,727 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 5 99) the Hoare annotation is: true [2018-07-25 13:25:00,727 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-07-25 13:25:00,728 INFO L418 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 13:25:00,730 INFO L418 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= 0 (select ~array 0))) [2018-07-25 13:25:00,730 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) the Hoare annotation is: false [2018-07-25 13:25:00,731 INFO L418 ceAbstractionStarter]: At program point L35(lines 35 47) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= 0 (select ~array 0))) [2018-07-25 13:25:00,755 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:25:00 BoogieIcfgContainer [2018-07-25 13:25:00,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:25:00,756 INFO L168 Benchmark]: Toolchain (without parser) took 2946.97 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: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:00,759 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 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-07-25 13:25:00,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.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-07-25 13:25:00,761 INFO L168 Benchmark]: Boogie Preprocessor took 21.85 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-07-25 13:25:00,763 INFO L168 Benchmark]: RCFGBuilder took 235.84 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:00,764 INFO L168 Benchmark]: TraceAbstraction took 2643.16 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:00,770 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.14 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 40.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. * Boogie Preprocessor took 21.85 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 235.84 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2643.16 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: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: 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: 79]: Loop Invariant Derived loop invariant: (((((SelectionSort_~i~4 + 4 <= ~n && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n <= 5) && 0 == ~array[1]) && 0 == SelectionSort_~rh~4) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && 0 == ~array[0] - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((SelectionSort_~i~4 + 4 <= ~n && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n <= 5) && 0 == ~array[1]) && 0 == SelectionSort_~rh~4) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && 0 == ~array[0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 125 SDslu, 341 SDs, 0 SdLazy, 343 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 31 NumberOfFragments, 137 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1816 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 608 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 53763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 760/952 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/eureka_05.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-25-00-809.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-25-00-809.csv Received shutdown request...