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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:35,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:35,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:35,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:35,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:35,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:35,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:35,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:35,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:35,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:35,479 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:35,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:35,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:35,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:35,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:35,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:35,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:35,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:35,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:35,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:35,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:35,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:35,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:35,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:35,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:35,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:35,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:35,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:35,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:35,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:35,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:35,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:35,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:35,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:35,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:35,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:35,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:35,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:35,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:35,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:35,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:35,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:35,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:35,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:35,565 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:35,566 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:35,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl [2019-08-05 10:15:35,567 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl' [2019-08-05 10:15:35,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:35,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:35,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:35,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:35,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:35,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:35,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:35,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:35,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:35,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/1) ... [2019-08-05 10:15:35,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:35,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:35,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:35,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:35,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (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:15:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:36,951 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:36,951 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:15:36,953 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:36 BoogieIcfgContainer [2019-08-05 10:15:36,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:36,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:36,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:36,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:36,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:35" (1/2) ... [2019-08-05 10:15:36,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e962c5 and model type pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:36, skipping insertion in model container [2019-08-05 10:15:36,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:36" (2/2) ... [2019-08-05 10:15:36,962 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl [2019-08-05 10:15:36,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:36,988 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:37,005 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:37,032 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:37,033 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:37,033 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:37,033 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:37,034 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:37,034 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:37,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:37,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:37,034 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:15:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:15:37,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:15:37,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1001172, now seen corresponding path program 1 times [2019-08-05 10:15:37,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,578 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:15:37,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:37,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:37,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:37,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:37,607 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:15:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,738 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:15:37,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:37,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:15:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,749 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:15:37,750 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:15:37,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:15:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:15:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:15:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:15:37,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:15:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,787 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:15:37,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:15:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:15:37,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,788 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:15:37,789 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash 962207787, now seen corresponding path program 1 times [2019-08-05 10:15:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:38,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:38,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:38,227 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:15:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,400 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:15:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:38,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:15:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,401 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:15:38,401 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:15:38,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:15:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:15:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:15:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:15:38,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:15:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,405 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:15:38,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:15:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:15:38,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,406 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:15:38,406 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1263796162, now seen corresponding path program 2 times [2019-08-05 10:15:38,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:38,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:38,779 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:15:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,961 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:15:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:38,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:15:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,965 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:15:38,965 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:15:38,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:15:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:15:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:15:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:15:38,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:15:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,968 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:15:38,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:15:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:15:38,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,969 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:15:38,970 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash -967551591, now seen corresponding path program 3 times [2019-08-05 10:15:38,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:39,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:15:39,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:39,548 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-08-05 10:15:39,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:39,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:39,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:39,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:39,646 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:15:39,849 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-08-05 10:15:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,088 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:15:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:40,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:15:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,090 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:15:40,090 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:15:40,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:15:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:15:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:15:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:15:40,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:15:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,094 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:15:40,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:15:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:15:40,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,095 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:15:40,095 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2104061520, now seen corresponding path program 4 times [2019-08-05 10:15:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:40,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,663 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:15:40,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:40,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:40,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:40,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:40,797 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-08-05 10:15:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,153 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:15:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:41,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:15:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,155 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:15:41,155 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:15:41,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:15:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:15:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:15:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:15:41,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:15:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,159 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:15:41,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:15:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:15:41,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,160 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:15:41,160 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 926557191, now seen corresponding path program 5 times [2019-08-05 10:15:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:41,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:41,664 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:15:41,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:41,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:41,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:41,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:41,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:41,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:41,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:41,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:41,954 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-08-05 10:15:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:54,444 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:15:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:54,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:15:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:54,445 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:15:54,445 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:15:54,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:15:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:15:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:15:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:15:54,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:15:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:54,449 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:15:54,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:15:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:54,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:54,450 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:15:54,450 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1363311774, now seen corresponding path program 6 times [2019-08-05 10:15:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:54,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:15:54,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:54,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:55,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:55,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:55,016 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-08-05 10:16:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:07,681 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:16:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:16:07,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:16:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:07,682 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:16:07,682 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:16:07,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:16:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:16:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:16:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:16:07,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:16:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:07,705 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:16:07,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:16:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:16:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:16:07,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:07,706 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:16:07,707 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 177671029, now seen corresponding path program 7 times [2019-08-05 10:16:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:07,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:16:07,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:07,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,192 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-08-05 10:16:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:16:08,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:08,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:16:08,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:08,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:08,227 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2019-08-05 10:16:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:08,259 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2019-08-05 10:16:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:08,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-08-05 10:16:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:08,260 INFO L225 Difference]: With dead ends: 4 [2019-08-05 10:16:08,260 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:16:08,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:16:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:16:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:16:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:16:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:16:08,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 10:16:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:08,261 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:16:08,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:16:08,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:16:08,267 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:08 BoogieIcfgContainer [2019-08-05 10:16:08,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:08,269 INFO L168 Benchmark]: Toolchain (without parser) took 32616.97 ms. Allocated memory was 138.4 MB in the beginning and 237.0 MB in the end (delta: 98.6 MB). Free memory was 109.4 MB in the beginning and 157.6 MB in the end (delta: -48.2 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:08,270 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 111.7 MB in the beginning and 111.5 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:16:08,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.03 ms. Allocated memory is still 138.4 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:08,272 INFO L168 Benchmark]: Boogie Preprocessor took 60.38 ms. Allocated memory is still 138.4 MB. Free memory was 107.5 MB in the beginning and 106.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:08,273 INFO L168 Benchmark]: RCFGBuilder took 1188.42 ms. Allocated memory was 138.4 MB in the beginning and 174.6 MB in the end (delta: 36.2 MB). Free memory was 106.0 MB in the beginning and 143.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:08,274 INFO L168 Benchmark]: TraceAbstraction took 31312.70 ms. Allocated memory was 174.6 MB in the beginning and 237.0 MB in the end (delta: 62.4 MB). Free memory was 143.7 MB in the beginning and 157.6 MB in the end (delta: -13.9 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:08,279 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 111.7 MB in the beginning and 111.5 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 51.03 ms. Allocated memory is still 138.4 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.38 ms. Allocated memory is still 138.4 MB. Free memory was 107.5 MB in the beginning and 106.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1188.42 ms. Allocated memory was 138.4 MB in the beginning and 174.6 MB in the end (delta: 36.2 MB). Free memory was 106.0 MB in the beginning and 143.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31312.70 ms. Allocated memory was 174.6 MB in the beginning and 237.0 MB in the end (delta: 62.4 MB). Free memory was 143.7 MB in the beginning and 157.6 MB in the end (delta: -13.9 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 463]: 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, 6 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 28 SDslu, 71 SDs, 0 SdLazy, 306 SolverSat, 21 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 32 QuantifiedInterpolants, 20579 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2216 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 55/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...