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/loopAcceleration/loopWithBreak.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:15,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:15,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:15,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:15,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:15,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:15,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:15,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:15,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:15,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:15,853 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:15,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:15,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:15,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:15,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:15,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:15,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:15,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:15,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:15,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:15,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:15,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:15,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:15,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:15,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:15,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:15,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:15,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:15,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:15,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:15,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:15,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:15,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:15,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:15,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:15,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:15,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:15,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:15,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:15,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:15,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:15,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:15,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:15,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:15,939 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:15,939 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:15,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithBreak.bpl [2019-08-05 11:21:15,940 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithBreak.bpl' [2019-08-05 11:21:15,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:15,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:15,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:15,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:15,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:15,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,007 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:16,007 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:16,007 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:16,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:16,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:16,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:16,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:16,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/1) ... [2019-08-05 11:21:16,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:16,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:16,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:16,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:16,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (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 11:21:16,104 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:16,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:16,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:16,339 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:16,340 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:21:16,341 INFO L202 PluginConnector]: Adding new model loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:16 BoogieIcfgContainer [2019-08-05 11:21:16,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:16,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:16,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:16,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:16,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:15" (1/2) ... [2019-08-05 11:21:16,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62702b89 and model type loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:16, skipping insertion in model container [2019-08-05 11:21:16,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:16" (2/2) ... [2019-08-05 11:21:16,350 INFO L109 eAbstractionObserver]: Analyzing ICFG loopWithBreak.bpl [2019-08-05 11:21:16,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:16,370 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:16,388 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:16,415 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:16,416 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:16,416 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:16,416 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:16,416 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:16,416 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:16,417 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:16,417 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:16,417 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:21:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:21:16,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:21:16,439 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash 30145, now seen corresponding path program 1 times [2019-08-05 11:21:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,588 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 11:21:16,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:16,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:16,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:16,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:16,610 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:21:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,726 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:21:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:16,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:21:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,742 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:16,743 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:16,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:21:16,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2019-08-05 11:21:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,786 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:21:16,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:21:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:16,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:21:16,788 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash 28757318, now seen corresponding path program 1 times [2019-08-05 11:21:16,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:16,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:21:16,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:16,918 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:21:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,010 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:21:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:17,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:21:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,012 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:21:17,012 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:21:17,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:21:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:21:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:21:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:21:17,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-08-05 11:21:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,017 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:21:17,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:21:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:21:17,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,018 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:21:17,018 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766795, now seen corresponding path program 2 times [2019-08-05 11:21:17,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:21:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:17,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:17,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:17,101 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:21:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,152 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:21:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:17,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:21:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,154 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:21:17,154 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:21:17,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:21:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:21:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:21:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:21:17,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:21:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,158 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:21:17,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:21:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:21:17,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,159 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:21:17,159 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2004188897, now seen corresponding path program 1 times [2019-08-05 11:21:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,226 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 11:21:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:17,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:17,228 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 11:21:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,299 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:21:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:17,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:21:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,301 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:21:17,302 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:21:17,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:21:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:21:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:21:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:21:17,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:21:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,307 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:21:17,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:21:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:17,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,308 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:21:17,309 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1880232572, now seen corresponding path program 2 times [2019-08-05 11:21:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,432 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 11:21:17,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:21:17,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:17,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:17,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:17,435 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-08-05 11:21:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,612 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:21:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:21:17,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:21:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,614 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:21:17,614 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:21:17,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:21:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:21:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:21:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:21:17,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:21:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,618 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:21:17,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:21:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:21:17,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,619 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:21:17,620 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1277678761, now seen corresponding path program 3 times [2019-08-05 11:21:17,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:17,746 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 11:21:17,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:21:17,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:17,748 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2019-08-05 11:21:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,838 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:21:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:17,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:21:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,839 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:21:17,840 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:21:17,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:21:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:21:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:21:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:21:17,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:21:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,846 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:21:17,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:21:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:21:17,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,847 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:21:17,847 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 511408498, now seen corresponding path program 4 times [2019-08-05 11:21:17,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,055 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 11:21:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:21:18,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:18,057 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-05 11:21:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,102 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:21:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:21:18,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 11:21:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,105 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:21:18,105 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:21:18,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:21:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:21:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:21:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:21:18,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:21:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,110 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:21:18,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:21:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:18,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,111 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:21:18,111 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1837345997, now seen corresponding path program 5 times [2019-08-05 11:21:18,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,229 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 11:21:18,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:21:18,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:21:18,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:21:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:18,231 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2019-08-05 11:21:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,298 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:21:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:18,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 11:21:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,299 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:21:18,300 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:21:18,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:21:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:21:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:21:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:21:18,303 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:21:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,304 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:21:18,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:21:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:21:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:18,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,305 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:21:18,305 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 457995624, now seen corresponding path program 6 times [2019-08-05 11:21:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:18,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:21:18,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:21:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:21:18,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:18,758 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-08-05 11:21:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,807 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:21:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:21:18,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 11:21:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,809 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:21:18,809 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:21:18,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:21:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:21:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:21:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:21:18,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:21:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,814 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:21:18,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:21:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:21:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:21:18,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,815 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:21:18,815 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2047181635, now seen corresponding path program 7 times [2019-08-05 11:21:18,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:21:19,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:21:19,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:21:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:19,011 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2019-08-05 11:21:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,093 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:21:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:21:19,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 11:21:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,095 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:21:19,095 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:21:19,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:21:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:21:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:21:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:21:19,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:21:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,100 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:21:19,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:21:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:21:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:21:19,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,101 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:21:19,102 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 246580830, now seen corresponding path program 8 times [2019-08-05 11:21:19,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:21:19,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:21:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:21:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:19,284 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2019-08-05 11:21:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,342 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:21:19,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:21:19,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 11:21:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,344 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:21:19,344 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:21:19,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:21:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:21:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:21:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:21:19,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:21:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,350 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:21:19,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:21:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:21:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:21:19,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,351 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:21:19,351 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash 741027513, now seen corresponding path program 9 times [2019-08-05 11:21:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:21:19,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:21:19,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:21:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:19,588 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-08-05 11:21:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,659 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:21:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:21:19,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 11:21:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,661 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:21:19,661 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:21:19,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:21:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:21:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:21:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:21:19,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:21:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,666 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:21:19,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:21:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:21:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:21:19,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,667 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:21:19,667 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash -837079980, now seen corresponding path program 10 times [2019-08-05 11:21:19,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:19,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:21:19,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:21:19,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:21:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:19,872 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-08-05 11:21:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,950 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:21:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:19,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 11:21:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,951 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:21:19,952 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:21:19,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:21:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:21:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:21:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:21:19,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:21:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,957 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:21:19,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:21:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:21:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:19,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,958 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:21:19,958 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1274925265, now seen corresponding path program 11 times [2019-08-05 11:21:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:20,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:21:20,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:21:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:21:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:20,160 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-08-05 11:21:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,479 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:21:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:20,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-05 11:21:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,482 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:21:20,482 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:21:20,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:21:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:21:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:21:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:21:20,486 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:21:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,486 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:21:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:21:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:21:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:20,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,487 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:21:20,488 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1137449142, now seen corresponding path program 12 times [2019-08-05 11:21:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:20,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:21:20,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:21:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:21:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:20,844 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-08-05 11:21:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,153 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:21:21,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:21:21,153 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-05 11:21:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,155 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:21:21,155 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:21:21,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:21:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:21:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:21:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:21:21,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:21:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,160 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:21:21,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:21:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:21:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:21,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,161 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:21:21,162 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2128086181, now seen corresponding path program 13 times [2019-08-05 11:21:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:21:21,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:21:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:21:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:21,356 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2019-08-05 11:21:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,413 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:21:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:21:21,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-05 11:21:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,415 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:21:21,415 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:21:21,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:21:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:21:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:21:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:21:21,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:21:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,421 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:21:21,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:21:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:21:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:21:21,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,422 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:21:21,423 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash 686438208, now seen corresponding path program 14 times [2019-08-05 11:21:21,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:21:21,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:21:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:21:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:21,636 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2019-08-05 11:21:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,779 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:21:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:21:21,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-05 11:21:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,780 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:21:21,780 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:21:21,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:21:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:21:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:21:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:21:21,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:21:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,785 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:21:21,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:21:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:21:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:21:21,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,786 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:21:21,786 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1757794533, now seen corresponding path program 15 times [2019-08-05 11:21:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:22,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:21:22,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:21:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:21:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:22,430 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2019-08-05 11:21:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:22,506 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:21:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:21:22,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-05 11:21:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:22,508 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:21:22,508 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:21:22,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:21:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:21:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:21:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:21:22,513 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:21:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:22,514 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:21:22,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:21:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:21:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:21:22,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:22,515 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:21:22,515 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1318347722, now seen corresponding path program 16 times [2019-08-05 11:21:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:22,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:21:22,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:22,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:21:22,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:21:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:21:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:22,942 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2019-08-05 11:21:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,018 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:21:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:23,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-05 11:21:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,019 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:21:23,019 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:21:23,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:21:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:21:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:21:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:21:23,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:21:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,024 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:21:23,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:21:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:21:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:21:23,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,025 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:21:23,026 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,026 INFO L82 PathProgramCache]: Analyzing trace with hash 83242641, now seen corresponding path program 17 times [2019-08-05 11:21:23,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:21:23,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:21:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:21:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:23,273 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2019-08-05 11:21:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,331 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:21:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:21:23,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-05 11:21:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,337 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:21:23,337 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:21:23,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:21:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:21:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:21:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:21:23,341 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:21:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,341 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:21:23,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:21:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:21:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:21:23,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,342 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:21:23,343 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1608149460, now seen corresponding path program 18 times [2019-08-05 11:21:23,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:21:23,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:21:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:21:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:23,714 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2019-08-05 11:21:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,815 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:21:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:21:23,816 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-05 11:21:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,816 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:21:23,816 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:21:23,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:21:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:21:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:21:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:21:23,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:21:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,821 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:21:23,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:21:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:21:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:21:23,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,822 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:21:23,822 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash 756646663, now seen corresponding path program 19 times [2019-08-05 11:21:23,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:21:24,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:21:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:21:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:24,135 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2019-08-05 11:21:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,205 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:21:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:21:24,207 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-05 11:21:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,207 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:21:24,207 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:21:24,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:21:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:21:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:21:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:21:24,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:21:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,213 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:21:24,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:21:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:21:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:21:24,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,214 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:21:24,214 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1288021282, now seen corresponding path program 20 times [2019-08-05 11:21:24,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:21:24,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:21:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:21:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:24,511 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2019-08-05 11:21:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,714 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:21:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:21:24,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-05 11:21:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,715 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:21:24,715 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:21:24,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:21:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:21:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:21:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:21:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:21:24,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:21:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,719 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:21:24,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:21:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:21:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:21:24,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,720 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:21:24,720 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash 837921917, now seen corresponding path program 21 times [2019-08-05 11:21:24,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:21:25,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:21:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:21:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:25,174 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2019-08-05 11:21:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,259 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:21:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:21:25,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-05 11:21:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,260 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:21:25,260 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:21:25,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:21:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:21:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:21:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:21:25,265 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:21:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,265 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:21:25,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:21:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:21:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:21:25,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,266 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:21:25,267 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2084129048, now seen corresponding path program 22 times [2019-08-05 11:21:25,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:21:25,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:21:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:21:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:25,583 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2019-08-05 11:21:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:25,653 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:21:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:21:25,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-05 11:21:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:25,654 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:21:25,654 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:21:25,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:21:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:21:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:21:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:21:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:21:25,658 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:21:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:25,659 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:21:25,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:21:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:21:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:21:25,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:25,659 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:21:25,660 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1393306355, now seen corresponding path program 23 times [2019-08-05 11:21:25,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:25,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:21:25,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:21:26,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:21:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:21:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:26,465 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2019-08-05 11:21:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:26,545 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:21:26,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:21:26,545 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 11:21:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:26,546 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:21:26,546 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:21:26,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:21:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:21:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:21:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:21:26,550 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:21:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:26,551 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:21:26,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:21:26,551 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:21:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:21:26,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:26,552 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:21:26,552 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1062338034, now seen corresponding path program 24 times [2019-08-05 11:21:26,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:26,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:21:26,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:27,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:27,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:21:27,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:21:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:21:27,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:27,688 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2019-08-05 11:21:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:27,807 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:21:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:21:27,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 11:21:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:27,808 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:21:27,808 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:21:27,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:21:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:21:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:21:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:21:27,811 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:21:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:27,811 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:21:27,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:21:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:21:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:21:27,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:27,812 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:21:27,812 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1295416937, now seen corresponding path program 25 times [2019-08-05 11:21:27,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:27,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:21:27,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:28,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:21:28,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:21:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:21:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:28,365 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2019-08-05 11:21:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:28,476 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:21:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:21:28,479 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-05 11:21:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:28,479 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:21:28,479 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:21:28,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:21:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:21:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:21:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:21:28,482 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:21:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:28,482 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:21:28,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:21:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:21:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:21:28,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:28,483 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:21:28,484 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -644788220, now seen corresponding path program 26 times [2019-08-05 11:21:28,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:28,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:21:28,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:28,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:21:28,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:21:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:21:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:28,980 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2019-08-05 11:21:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,055 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:21:29,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:21:29,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-05 11:21:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,057 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:21:29,057 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:21:29,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:21:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:21:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:21:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:21:29,060 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:21:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,061 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:21:29,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:21:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:21:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:21:29,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,062 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:21:29,062 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1166137633, now seen corresponding path program 27 times [2019-08-05 11:21:29,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:29,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:21:29,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:21:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:21:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:29,484 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2019-08-05 11:21:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,603 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:21:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:21:29,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-05 11:21:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,605 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:21:29,605 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:21:29,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:21:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:21:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:21:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:21:29,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:21:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,609 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:21:29,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:21:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:21:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:21:29,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,610 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:21:29,610 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash 328250106, now seen corresponding path program 28 times [2019-08-05 11:21:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:30,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:21:30,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:21:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:21:30,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:30,038 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2019-08-05 11:21:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,271 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:21:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:30,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-05 11:21:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,272 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:21:30,272 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:21:30,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:21:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:21:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:21:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:21:30,275 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:21:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,275 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:21:30,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:21:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:21:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:21:30,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,276 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:21:30,276 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1915790421, now seen corresponding path program 29 times [2019-08-05 11:21:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:30,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:21:30,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:21:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:21:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:30,667 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2019-08-05 11:21:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,799 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:21:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:21:30,799 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-05 11:21:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,800 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:21:30,800 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:21:30,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:21:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:21:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:21:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:21:30,804 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:21:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,804 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:21:30,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:21:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:21:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:21:30,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,805 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:21:30,805 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1466324240, now seen corresponding path program 30 times [2019-08-05 11:21:30,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:21:32,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:21:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:21:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:32,066 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2019-08-05 11:21:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:32,161 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:21:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:32,162 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-05 11:21:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:32,163 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:21:32,163 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:21:32,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:21:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:21:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:21:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:21:32,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:21:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:32,167 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:21:32,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:21:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:21:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:21:32,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:32,168 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:21:32,168 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash -388270389, now seen corresponding path program 31 times [2019-08-05 11:21:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:32,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:21:32,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:32,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:32,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:21:32,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:21:32,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:21:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:32,986 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2019-08-05 11:21:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,085 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:21:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:21:33,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-05 11:21:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,087 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:21:33,087 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:21:33,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:21:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:21:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:21:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:21:33,091 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:21:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,091 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:21:33,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:21:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:21:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:21:33,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,092 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:21:33,092 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash 534362086, now seen corresponding path program 32 times [2019-08-05 11:21:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:33,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:21:33,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:21:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:21:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:33,850 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2019-08-05 11:21:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,945 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:21:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:21:33,946 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-05 11:21:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,947 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:21:33,947 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:21:33,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:21:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:21:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:21:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:21:33,950 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:21:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,950 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:21:33,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:21:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:21:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:21:33,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,951 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:21:33,951 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1874059711, now seen corresponding path program 33 times [2019-08-05 11:21:33,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:34,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:34,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:21:34,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:21:34,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:21:34,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:34,447 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2019-08-05 11:21:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,654 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:21:34,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:21:34,655 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-05 11:21:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,656 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:21:34,657 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:21:34,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:21:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:21:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:21:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:21:34,661 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:21:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,661 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:21:34,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:21:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:21:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:21:34,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,662 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:21:34,662 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1380034084, now seen corresponding path program 34 times [2019-08-05 11:21:34,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:21:35,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:21:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:21:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:35,212 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2019-08-05 11:21:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:35,309 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:21:35,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:21:35,310 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-05 11:21:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:35,311 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:21:35,311 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:21:35,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:21:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:21:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:21:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:21:35,314 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:21:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:21:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:21:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:21:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:21:35,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:35,315 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:21:35,315 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 932190903, now seen corresponding path program 35 times [2019-08-05 11:21:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:35,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:21:35,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:36,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:36,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:21:36,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:21:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:21:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:36,325 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2019-08-05 11:21:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,433 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:21:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:21:36,434 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-05 11:21:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,435 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:21:36,435 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:21:36,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:21:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:21:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:21:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:21:36,439 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:21:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,439 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:21:36,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:21:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:21:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:21:36,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,440 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:21:36,440 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1812655918, now seen corresponding path program 36 times [2019-08-05 11:21:36,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:37,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:37,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:21:37,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:21:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:21:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:37,195 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2019-08-05 11:21:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:37,299 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:21:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:21:37,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-05 11:21:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:37,301 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:21:37,301 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:21:37,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:21:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:21:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:21:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:21:37,304 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:21:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:37,305 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:21:37,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:21:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:21:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:21:37,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:37,306 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:21:37,306 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1794436141, now seen corresponding path program 37 times [2019-08-05 11:21:37,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:37,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:21:37,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:38,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:21:38,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:21:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:21:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:38,343 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2019-08-05 11:21:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,472 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:21:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:21:38,473 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-05 11:21:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,474 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:21:38,474 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:21:38,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:21:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:21:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:21:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:21:38,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:21:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,478 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:21:38,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:21:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:21:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:21:38,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,478 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:21:38,479 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2123670328, now seen corresponding path program 38 times [2019-08-05 11:21:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:39,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:39,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:21:39,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:21:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:21:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:39,146 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2019-08-05 11:21:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:39,259 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:21:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:21:39,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-05 11:21:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:39,261 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:21:39,261 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:21:39,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:21:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:21:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:21:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:21:39,265 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:21:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:39,265 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:21:39,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:21:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:21:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:21:39,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:39,266 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:21:39,266 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -737668445, now seen corresponding path program 39 times [2019-08-05 11:21:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:39,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:21:39,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:40,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:21:40,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:21:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:21:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:40,002 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2019-08-05 11:21:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:40,121 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:21:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:21:40,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-05 11:21:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:40,122 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:21:40,122 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:21:40,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:21:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:21:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:21:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:21:40,126 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:21:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:40,127 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:21:40,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:21:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:21:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:21:40,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:40,128 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:21:40,128 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:40,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:40,128 INFO L82 PathProgramCache]: Analyzing trace with hash -229720642, now seen corresponding path program 40 times [2019-08-05 11:21:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:40,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:21:40,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:21:40,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:21:40,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:21:40,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:40,854 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2019-08-05 11:21:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:40,978 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:21:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:21:40,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-05 11:21:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:40,979 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:21:40,979 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:21:40,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:21:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:21:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:21:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:21:40,983 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:21:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:40,984 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:21:40,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:21:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:21:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:21:40,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:40,984 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:21:40,985 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1718153703, now seen corresponding path program 41 times [2019-08-05 11:21:40,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:21:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:21:41,029 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:21:41,056 INFO L202 PluginConnector]: Adding new model loopWithBreak.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:41 BoogieIcfgContainer [2019-08-05 11:21:41,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:41,059 INFO L168 Benchmark]: Toolchain (without parser) took 25086.55 ms. Allocated memory was 141.0 MB in the beginning and 395.8 MB in the end (delta: 254.8 MB). Free memory was 111.8 MB in the beginning and 284.3 MB in the end (delta: -172.5 MB). Peak memory consumption was 82.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,060 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 141.0 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.03 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,061 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 141.0 MB. Free memory was 109.9 MB in the beginning and 108.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,062 INFO L168 Benchmark]: RCFGBuilder took 305.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 99.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,063 INFO L168 Benchmark]: TraceAbstraction took 24714.07 ms. Allocated memory was 141.0 MB in the beginning and 395.8 MB in the end (delta: 254.8 MB). Free memory was 99.4 MB in the beginning and 284.3 MB in the end (delta: -184.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:41,066 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.15 ms. Allocated memory is still 141.0 MB. Free memory was 113.0 MB in the beginning and 112.8 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 37.03 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 109.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 141.0 MB. Free memory was 109.9 MB in the beginning and 108.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.93 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 99.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24714.07 ms. Allocated memory was 141.0 MB in the beginning and 395.8 MB in the end (delta: 254.8 MB). Free memory was 99.4 MB in the beginning and 284.3 MB in the end (delta: -184.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: assertion can be violated assertion can be violated We found a FailurePath: [L8] x := 0; VAL [x=0] [L9] COND TRUE x < 100 VAL [x=0] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=1] [L9] COND TRUE x < 100 VAL [x=1] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=2] [L9] COND TRUE x < 100 VAL [x=2] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=3] [L9] COND TRUE x < 100 VAL [x=3] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=4] [L9] COND TRUE x < 100 VAL [x=4] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=5] [L9] COND TRUE x < 100 VAL [x=5] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=6] [L9] COND TRUE x < 100 VAL [x=6] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=7] [L9] COND TRUE x < 100 VAL [x=7] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=8] [L9] COND TRUE x < 100 VAL [x=8] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=9] [L9] COND TRUE x < 100 VAL [x=9] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=10] [L9] COND TRUE x < 100 VAL [x=10] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=11] [L9] COND TRUE x < 100 VAL [x=11] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=12] [L9] COND TRUE x < 100 VAL [x=12] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=13] [L9] COND TRUE x < 100 VAL [x=13] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=14] [L9] COND TRUE x < 100 VAL [x=14] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=15] [L9] COND TRUE x < 100 VAL [x=15] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=16] [L9] COND TRUE x < 100 VAL [x=16] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=17] [L9] COND TRUE x < 100 VAL [x=17] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=18] [L9] COND TRUE x < 100 VAL [x=18] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=19] [L9] COND TRUE x < 100 VAL [x=19] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=20] [L9] COND TRUE x < 100 VAL [x=20] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=21] [L9] COND TRUE x < 100 VAL [x=21] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=22] [L9] COND TRUE x < 100 VAL [x=22] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=23] [L9] COND TRUE x < 100 VAL [x=23] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=24] [L9] COND TRUE x < 100 VAL [x=24] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=25] [L9] COND TRUE x < 100 VAL [x=25] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=26] [L9] COND TRUE x < 100 VAL [x=26] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=27] [L9] COND TRUE x < 100 VAL [x=27] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=28] [L9] COND TRUE x < 100 VAL [x=28] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=29] [L9] COND TRUE x < 100 VAL [x=29] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=30] [L9] COND TRUE x < 100 VAL [x=30] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=31] [L9] COND TRUE x < 100 VAL [x=31] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=32] [L9] COND TRUE x < 100 VAL [x=32] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=33] [L9] COND TRUE x < 100 VAL [x=33] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=34] [L9] COND TRUE x < 100 VAL [x=34] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=35] [L9] COND TRUE x < 100 VAL [x=35] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=36] [L9] COND TRUE x < 100 VAL [x=36] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=37] [L9] COND TRUE x < 100 VAL [x=37] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=38] [L9] COND TRUE x < 100 VAL [x=38] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=39] [L9] COND TRUE x < 100 VAL [x=39] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=40] [L9] COND TRUE x < 100 VAL [x=40] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=41] [L9] COND TRUE x < 100 VAL [x=41] [L10] COND FALSE !(x == 42) [L13] x := x + 1; VAL [x=42] [L9] COND TRUE x < 100 VAL [x=42] [L10] COND TRUE x == 42 VAL [x=42] [L15] assert x == 100; VAL [x=42] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 24.6s OverallTime, 44 OverallIterations, 43 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 8 SDslu, 0 SDs, 0 SdLazy, 2218 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1852 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 906 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=43, 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.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 1983 NumberOfCodeBlocks, 1983 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1852 ConstructedInterpolants, 0 QuantifiedInterpolants, 314344 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3790 ConjunctsInSsa, 949 ConjunctsInUnsatCore, 43 InterpolantComputations, 2 PerfectInterpolantSequences, 4/24685 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...