java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/ManyInterpolants.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:42:10,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:42:10,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:42:10,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:42:10,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:42:10,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:42:10,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:42:10,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:42:10,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:42:10,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:42:10,644 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:42:10,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:42:10,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:42:10,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:42:10,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:42:10,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:42:10,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:42:10,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:42:10,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:42:10,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:42:10,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:42:10,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:42:10,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:42:10,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:42:10,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:42:10,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:42:10,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:42:10,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:42:10,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:42:10,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:42:10,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:42:10,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:42:10,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:42:10,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:42:10,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:42:10,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:42:10,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:42:10,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:42:10,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:42:10,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:42:10,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:42:10,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:42:10,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:42:10,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:42:10,764 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:42:10,765 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:42:10,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyInterpolants.bpl [2019-08-05 10:42:10,766 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyInterpolants.bpl' [2019-08-05 10:42:10,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:42:10,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:42:10,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:10,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:42:10,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:42:10,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,838 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:42:10,838 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:42:10,839 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:42:10,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:10,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:42:10,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:42:10,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:42:10,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... [2019-08-05 10:42:10,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:42:10,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:42:10,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:42:10,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:42:10,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:42:10,929 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:42:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:42:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:42:11,199 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:42:11,200 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-05 10:42:11,202 INFO L202 PluginConnector]: Adding new model ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:11 BoogieIcfgContainer [2019-08-05 10:42:11,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:42:11,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:42:11,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:42:11,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:42:11,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:10" (1/2) ... [2019-08-05 10:42:11,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258e0cf3 and model type ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:42:11, skipping insertion in model container [2019-08-05 10:42:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:11" (2/2) ... [2019-08-05 10:42:11,227 INFO L109 eAbstractionObserver]: Analyzing ICFG ManyInterpolants.bpl [2019-08-05 10:42:11,241 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:42:11,260 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:42:11,283 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:42:11,308 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:42:11,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:42:11,309 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:42:11,309 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:42:11,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:42:11,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:42:11,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:42:11,310 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:42:11,310 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:42:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 10:42:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:11,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:11,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:11,334 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1007, now seen corresponding path program 1 times [2019-08-05 10:42:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:11,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:42:11,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:11,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:11,482 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 10:42:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:11,595 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-08-05 10:42:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:11,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:11,611 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:42:11,612 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:42:11,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:42:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 10:42:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:42:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-08-05 10:42:11,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 2 [2019-08-05 10:42:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:11,648 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-08-05 10:42:11,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-08-05 10:42:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:42:11,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:11,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:42:11,649 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash 28824993, now seen corresponding path program 1 times [2019-08-05 10:42:11,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:11,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:42:11,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:11,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:11,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:42:11,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:42:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:42:11,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:11,741 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-08-05 10:42:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:11,828 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2019-08-05 10:42:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:42:11,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:42:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:11,829 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:42:11,829 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:42:11,830 INFO L628 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 [2019-08-05 10:42:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:42:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 10:42:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:42:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2019-08-05 10:42:11,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 22 transitions. Word has length 5 [2019-08-05 10:42:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:11,835 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 22 transitions. [2019-08-05 10:42:11,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:42:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 22 transitions. [2019-08-05 10:42:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:42:11,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:11,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:42:11,836 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 28817057, now seen corresponding path program 1 times [2019-08-05 10:42:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:11,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:42:11,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:11,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:11,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:42:11,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:42:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:42:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:11,928 INFO L87 Difference]: Start difference. First operand 12 states and 22 transitions. Second operand 4 states. [2019-08-05 10:42:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,089 INFO L93 Difference]: Finished difference Result 18 states and 34 transitions. [2019-08-05 10:42:12,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:42:12,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:42:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,095 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:42:12,095 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:42:12,096 INFO L628 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 [2019-08-05 10:42:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:42:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:42:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:42:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2019-08-05 10:42:12,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 32 transitions. Word has length 5 [2019-08-05 10:42:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,100 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 32 transitions. [2019-08-05 10:42:12,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:42:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 32 transitions. [2019-08-05 10:42:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:42:12,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:42:12,102 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash 29440653, now seen corresponding path program 1 times [2019-08-05 10:42:12,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:12,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:42:12,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:42:12,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:42:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:12,324 INFO L87 Difference]: Start difference. First operand 17 states and 32 transitions. Second operand 4 states. [2019-08-05 10:42:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,397 INFO L93 Difference]: Finished difference Result 21 states and 40 transitions. [2019-08-05 10:42:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:42:12,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:42:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,398 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:42:12,398 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:42:12,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:42:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:42:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:42:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2019-08-05 10:42:12,402 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 5 [2019-08-05 10:42:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,403 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 38 transitions. [2019-08-05 10:42:12,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:42:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 38 transitions. [2019-08-05 10:42:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:42:12,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:42:12,404 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash 29432717, now seen corresponding path program 1 times [2019-08-05 10:42:12,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:12,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:42:12,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:42:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:42:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:12,468 INFO L87 Difference]: Start difference. First operand 20 states and 38 transitions. Second operand 4 states. [2019-08-05 10:42:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,524 INFO L93 Difference]: Finished difference Result 25 states and 48 transitions. [2019-08-05 10:42:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:42:12,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:42:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,526 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:42:12,526 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:42:12,526 INFO L628 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 [2019-08-05 10:42:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:42:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 10:42:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:42:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2019-08-05 10:42:12,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 46 transitions. Word has length 5 [2019-08-05 10:42:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,531 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 46 transitions. [2019-08-05 10:42:12,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:42:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 46 transitions. [2019-08-05 10:42:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:12,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,532 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:12,532 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -269275217, now seen corresponding path program 1 times [2019-08-05 10:42:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:12,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,556 INFO L87 Difference]: Start difference. First operand 24 states and 46 transitions. Second operand 3 states. [2019-08-05 10:42:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,587 INFO L93 Difference]: Finished difference Result 28 states and 49 transitions. [2019-08-05 10:42:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:12,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:12,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,589 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:42:12,589 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:42:12,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:42:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:42:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:42:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2019-08-05 10:42:12,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 8 [2019-08-05 10:42:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,594 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. [2019-08-05 10:42:12,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. [2019-08-05 10:42:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:12,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:12,596 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -268651621, now seen corresponding path program 1 times [2019-08-05 10:42:12,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:12,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,625 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 3 states. [2019-08-05 10:42:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,640 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2019-08-05 10:42:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:12,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,642 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:42:12,642 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:42:12,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:42:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:42:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:42:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2019-08-05 10:42:12,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 8 [2019-08-05 10:42:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,646 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2019-08-05 10:42:12,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2019-08-05 10:42:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:12,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,647 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:12,647 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash -505688657, now seen corresponding path program 2 times [2019-08-05 10:42:12,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:12,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,697 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 3 states. [2019-08-05 10:42:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,761 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2019-08-05 10:42:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:12,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,762 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:42:12,762 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:42:12,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:42:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 10:42:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:42:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-08-05 10:42:12,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 8 [2019-08-05 10:42:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,766 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-08-05 10:42:12,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2019-08-05 10:42:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:12,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:12,767 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash 891990595, now seen corresponding path program 2 times [2019-08-05 10:42:12,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:12,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:12,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:12,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:12,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,819 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand 3 states. [2019-08-05 10:42:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,830 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-08-05 10:42:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:12,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,830 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:42:12,830 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:42:12,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:42:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:42:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:42:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:42:12,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 10:42:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,832 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:42:12,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:42:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:42:12,837 INFO L202 PluginConnector]: Adding new model ManyInterpolants.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:42:12 BoogieIcfgContainer [2019-08-05 10:42:12,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:42:12,840 INFO L168 Benchmark]: Toolchain (without parser) took 2033.11 ms. Allocated memory was 140.5 MB in the beginning and 177.7 MB in the end (delta: 37.2 MB). Free memory was 110.1 MB in the beginning and 116.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,841 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.91 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,843 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 140.5 MB. Free memory was 108.2 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,844 INFO L168 Benchmark]: RCFGBuilder took 340.16 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 96.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,845 INFO L168 Benchmark]: TraceAbstraction took 1631.00 ms. Allocated memory was 140.5 MB in the beginning and 177.7 MB in the end (delta: 37.2 MB). Free memory was 96.1 MB in the beginning and 116.6 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:12,850 INFO L335 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.91 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 140.5 MB. Free memory was 108.2 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.16 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 96.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1631.00 ms. Allocated memory was 140.5 MB in the beginning and 177.7 MB in the end (delta: 37.2 MB). Free memory was 96.1 MB in the beginning and 116.6 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 30 SDslu, 79 SDs, 0 SdLazy, 121 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...