java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:26,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:26,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:26,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:26,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:26,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:26,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:26,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:26,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:26,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:26,833 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:26,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:26,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:26,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:26,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:26,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:26,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:26,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:26,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:26,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:26,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:26,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:26,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:26,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:26,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:26,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:26,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:26,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:26,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:26,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:26,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:26,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:26,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:26,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:26,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:26,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:26,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:26,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:26,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:26,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:26,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:26,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:26,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:26,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:26,907 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:26,907 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:26,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl [2019-08-05 10:21:26,908 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/half_2.i_3.bpl' [2019-08-05 10:21:26,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:26,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:26,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:26,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:26,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:26,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:26,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:26,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:26,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:26,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:26,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:26,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:26,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:26,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:26,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:27,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:27,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:27,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... [2019-08-05 10:21:27,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:27,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:27,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:27,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:27,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:21:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:27,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:27,318 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:27,319 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:21:27,320 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:27 BoogieIcfgContainer [2019-08-05 10:21:27,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:27,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:27,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:27,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:27,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:26" (1/2) ... [2019-08-05 10:21:27,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266f5a66 and model type half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:27, skipping insertion in model container [2019-08-05 10:21:27,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:27" (2/2) ... [2019-08-05 10:21:27,333 INFO L109 eAbstractionObserver]: Analyzing ICFG half_2.i_3.bpl [2019-08-05 10:21:27,344 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:27,353 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:27,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:27,394 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:27,395 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:27,395 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:27,395 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:27,395 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:27,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:27,396 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:27,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:27,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:27,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:27,424 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:27,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:27,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:27,618 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,661 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:21:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:27,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,676 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:21:27,676 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:21:27,678 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 10:21:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:21:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:21:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:21:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:21:27,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:21:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,729 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:21:27,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:21:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:27,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:27,732 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:21:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:27,925 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 10:21:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:27,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:27,929 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:21:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,971 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:21:27,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:27,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,972 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:21:27,972 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:21:27,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:21:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:21:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:21:27,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:21:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,975 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:21:27,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:21:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:27,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,976 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:21:27,977 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:21:27,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:28,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:28,122 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:21:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:28,197 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:21:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:28,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:21:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:28,198 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:28,198 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:28,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:28,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:21:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:28,202 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:28,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:28,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:28,203 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:21:28,203 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:21:28,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:28,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:28,394 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:21:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:28,503 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:28,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:21:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:28,509 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:28,509 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:28,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:21:28,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:21:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:28,513 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:21:28,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:21:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:28,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:28,514 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:21:28,514 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:21:28,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:28,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:28,874 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:21:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:28,928 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:21:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:28,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:21:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:28,936 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:21:28,936 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:21:28,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:21:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:21:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:28,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:21:28,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:28,941 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:28,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:28,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:28,942 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:21:28,942 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:21:28,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:28,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:21:28,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:29,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:29,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:29,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:29,264 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:21:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:29,321 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:29,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:21:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:29,324 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:29,324 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:29,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:21:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:21:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:21:29,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:21:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:29,328 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:21:29,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:21:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:21:29,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:29,329 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:21:29,330 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:21:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:29,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:21:29,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:29,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:29,638 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:21:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:29,902 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:21:29,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:29,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:21:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:29,903 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:21:29,903 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:21:29,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:21:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:21:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:29,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:21:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:29,906 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:29,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:29,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:29,907 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:21:29,907 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:29,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:21:29,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:29,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:21:29,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:30,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:30,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:30,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:30,171 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:21:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,265 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:30,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:30,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:21:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,267 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:30,267 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:30,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:21:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:21:30,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:21:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,271 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:21:30,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:21:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:30,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,272 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:21:30,273 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:21:30,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:21:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:30,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:30,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:30,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:30,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:30,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:30,505 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:21:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:30,638 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:21:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:30,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:21:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:30,641 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:21:30,641 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:21:30,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:21:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:21:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:30,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:21:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:30,645 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:30,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:30,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:30,646 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:21:30,646 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:21:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:30,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:21:30,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:31,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:31,069 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:21:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:31,162 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:21:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:31,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:21:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:31,163 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:31,163 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:31,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:21:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:21:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:21:31,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:21:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:31,168 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:21:31,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:21:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:31,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:31,169 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:21:31,169 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:21:31,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:31,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:31,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:31,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:31,492 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:21:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:31,605 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:21:31,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:31,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:21:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:31,612 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:21:31,612 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:21:31,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:21:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:21:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:21:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:21:31,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:21:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:31,615 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:21:31,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:21:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:31,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:31,616 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:21:31,616 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:31,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:31,616 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:21:31,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:31,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:31,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:21:31,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:21:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:21:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:31,935 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:21:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:32,101 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:21:32,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:21:32,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:21:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:32,103 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:32,103 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:32,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:21:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:21:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:21:32,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:21:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:32,107 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:21:32,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:21:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:21:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:32,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,115 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:21:32,115 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:21:32,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:32,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:21:32,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:21:32,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:21:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:32,695 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:21:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,192 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:21:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:21:33,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:21:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,200 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:21:33,200 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:21:33,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:21:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:21:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:21:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:21:33,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:21:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,204 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:21:33,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:21:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:21:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:21:33,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,205 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:21:33,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:21:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:33,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:21:33,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:21:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:21:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:33,486 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:21:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,673 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:21:33,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:21:33,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:21:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,674 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:33,675 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:33,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:21:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:21:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:21:33,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:21:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,679 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:21:33,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:21:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:21:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:21:33,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,680 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:21:33,680 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:21:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:33,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:33,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:21:33,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:21:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:21:33,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:33,949 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:21:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:34,249 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:21:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:21:34,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:21:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:34,250 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:21:34,250 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:21:34,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:21:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:21:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:21:34,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:21:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:34,255 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:21:34,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:21:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:21:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:34,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:34,256 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:21:34,256 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:34,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:21:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:35,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:35,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:21:35,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:21:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:21:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:35,046 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:21:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:35,270 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:21:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:21:35,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:21:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:35,272 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:35,272 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:35,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:21:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:21:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:21:35,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:21:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:35,277 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:21:35,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:21:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:21:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:35,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:35,278 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:21:35,278 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:21:35,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:35,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:21:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:35,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:35,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:21:35,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:21:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:21:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:35,569 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:21:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:35,817 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:21:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:21:35,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:21:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:35,818 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:21:35,818 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:21:35,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:21:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:21:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:21:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:21:35,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:21:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:35,823 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:21:35,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:21:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:21:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:21:35,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:35,824 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:21:35,824 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:21:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:35,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:21:35,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:36,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:21:36,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:21:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:21:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:36,111 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:21:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:36,445 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:21:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:21:36,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:21:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:36,447 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:21:36,447 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:21:36,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:21:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:21:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:21:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:21:36,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:21:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:36,451 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:21:36,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:21:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:21:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:21:36,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:36,452 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:21:36,452 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:21:36,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:36,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:21:36,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:36,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:21:36,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:21:36,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:21:36,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:36,790 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:21:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:37,094 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:21:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:21:37,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:21:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:37,096 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:21:37,097 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:21:37,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:21:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:21:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:21:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:21:37,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:21:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:37,101 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:21:37,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:21:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:21:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:21:37,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:37,102 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:21:37,102 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:21:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:37,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:21:37,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:37,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:21:37,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:21:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:21:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:37,792 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:21:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:38,172 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:21:38,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:21:38,172 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:21:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:38,173 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:21:38,173 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:21:38,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:21:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:21:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:21:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:21:38,178 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:21:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:38,178 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:21:38,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:21:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:21:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:21:38,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:38,179 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:21:38,179 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:21:38,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:38,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:21:38,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:39,011 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 10:21:39,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:39,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:21:39,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:21:39,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:21:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:39,013 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:21:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:39,424 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:21:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:21:39,424 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:21:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:39,425 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:21:39,425 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:21:39,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:21:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:21:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:21:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:21:39,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:21:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:39,430 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:21:39,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:21:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:21:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:21:39,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:39,431 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:21:39,431 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:21:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:39,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:21:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:39,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:39,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:21:39,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:21:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:21:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:39,829 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:21:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:40,237 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:21:40,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:21:40,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:21:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:40,240 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:21:40,240 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:21:40,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:21:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:21:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:21:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:21:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:21:40,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:21:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:40,245 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:21:40,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:21:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:21:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:21:40,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:40,246 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:21:40,246 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:21:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:40,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:21:40,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:40,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:40,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:21:40,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:21:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:21:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:40,813 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:21:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:41,612 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:21:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:21:41,613 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:21:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:41,614 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:21:41,614 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:21:41,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:21:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:21:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:21:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:21:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:21:41,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:21:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:41,617 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:21:41,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:21:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:21:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:21:41,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:41,618 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:21:41,619 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:21:41,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:41,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:21:41,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:43,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:43,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:21:43,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:21:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:21:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:43,306 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:21:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:44,036 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:21:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:21:44,037 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:21:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:44,038 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:21:44,038 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:21:44,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:21:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:21:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:21:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:21:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:21:44,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:21:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:44,042 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:21:44,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:21:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:21:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:21:44,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,043 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:21:44,043 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:21:44,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:44,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:21:44,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:21:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:21:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:44,593 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:21:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,074 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:21:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:21:45,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:21:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,076 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:21:45,076 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:21:45,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:21:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:21:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:21:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:21:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:21:45,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:21:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,080 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:21:45,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:21:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:21:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:21:45,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,081 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:21:45,081 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:21:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:45,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:21:45,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:21:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:21:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:45,631 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:21:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,184 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:21:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:21:46,185 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:21:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,186 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:21:46,186 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:21:46,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:21:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:21:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:21:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:21:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:21:46,189 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:21:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,190 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:21:46,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:21:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:21:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:21:46,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,191 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:21:46,191 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:21:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:46,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:21:46,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:21:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:21:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:46,806 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:21:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:47,387 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:21:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:21:47,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:21:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:47,388 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:21:47,388 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:21:47,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:21:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:21:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:21:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:21:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:21:47,392 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:21:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:47,393 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:21:47,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:21:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:21:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:21:47,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,394 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:21:47,394 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:21:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:48,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:21:48,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:21:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:21:48,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:48,264 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:21:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,862 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:21:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:21:48,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:21:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,863 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:21:48,864 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:21:48,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:21:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:21:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:21:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:21:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:21:48,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:21:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,869 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:21:48,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:21:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:21:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:21:48,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,870 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:21:48,870 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:21:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:21:49,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:21:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:21:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:49,535 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:21:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,175 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:21:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:21:50,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:21:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,176 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:21:50,176 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:21:50,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:21:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:21:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:21:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:21:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:21:50,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:21:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,180 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:21:50,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:21:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:21:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:21:50,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,181 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:21:50,182 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:21:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:21:50,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:21:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:21:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:50,920 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:21:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,604 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:21:51,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:21:51,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:21:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,606 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:21:51,606 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:21:51,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:21:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:21:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:21:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:21:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:21:51,610 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:21:51,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,610 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:21:51,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:21:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:21:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:21:51,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,611 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:21:51,611 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:21:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:21:52,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:21:52,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:21:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:52,345 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:21:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,245 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:21:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:21:53,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:21:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,246 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:21:53,246 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:21:53,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:21:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:21:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:21:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:21:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:21:53,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:21:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,250 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:21:53,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:21:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:21:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:21:53,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,251 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:21:53,251 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:21:53,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:54,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:21:54,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:21:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:21:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:54,037 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:21:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,810 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:21:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:21:54,810 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:21:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,811 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:21:54,811 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:21:54,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:21:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:21:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:21:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:21:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:21:54,816 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:21:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,816 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:21:54,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:21:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:21:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:21:54,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,817 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:21:54,817 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:21:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:21:55,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:21:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:21:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:55,671 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:21:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:56,489 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:21:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:21:56,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:21:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:56,491 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:21:56,491 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:21:56,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:21:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:21:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:21:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:21:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:21:56,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:21:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:56,496 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:21:56,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:21:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:21:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:21:56,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:56,497 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:21:56,497 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:21:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:56,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:21:56,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:57,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:57,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:21:57,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:21:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:21:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:57,462 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:21:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:58,498 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:21:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:21:58,498 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:21:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:58,499 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:21:58,499 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:21:58,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:21:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:21:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:21:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:21:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:21:58,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:21:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:21:58,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:21:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:21:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:21:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:58,504 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:21:58,504 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:21:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:58,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:21:58,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:21:59,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:21:59,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:21:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:21:59,834 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:22:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:00,758 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:22:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:22:00,759 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:22:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:00,759 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:22:00,760 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:22:00,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:22:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:22:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:22:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:22:00,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:22:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:00,764 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:22:00,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:22:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:22:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:22:00,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:00,765 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:22:00,765 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:22:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:00,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:22:00,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:22:02,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:22:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:22:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:02,192 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:22:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:03,258 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:22:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:22:03,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:22:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:03,259 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:22:03,259 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:22:03,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:22:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:22:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:22:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:22:03,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:22:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:03,264 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:22:03,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:22:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:22:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:22:03,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:03,264 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:22:03,265 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:22:03,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:03,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:22:03,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:04,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:04,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:22:04,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:22:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:22:04,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:04,389 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:22:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:05,408 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:22:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:22:05,409 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:22:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:05,409 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:22:05,409 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:22:05,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:22:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:22:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:22:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:22:05,413 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:22:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:05,413 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:22:05,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:22:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:22:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:22:05,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,414 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:22:05,414 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:22:05,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:22:06,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:22:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:22:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:06,558 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:22:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,632 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:22:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:22:07,632 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:22:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,633 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:22:07,633 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:22:07,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:22:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:22:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:22:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:22:07,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:22:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,636 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:22:07,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:22:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:22:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:22:07,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,637 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:22:07,638 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:22:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:08,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:08,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:22:08,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:22:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:22:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:08,901 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:22:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:10,035 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:22:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:22:10,036 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:22:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:10,037 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:22:10,037 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:22:10,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:22:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:22:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:22:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:22:10,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:22:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:10,041 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:22:10,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:22:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:22:10,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:10,041 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:22:10,042 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:22:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:10,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:10,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:10,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:10,983 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:22:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:12,170 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:22:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:22:12,171 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:22:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:12,171 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:22:12,171 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:22:12,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:22:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:22:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:22:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:22:12,175 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:22:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:12,175 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:22:12,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:22:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:22:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:22:12,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:12,175 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:22:12,176 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:22:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:12,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:22:12,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:22:13,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:22:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:22:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:13,235 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:22:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,576 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:22:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:22:14,577 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:22:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,578 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:22:14,578 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:22:14,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:22:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:22:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:22:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:22:14,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:22:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,581 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:22:14,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:22:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:22:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:22:14,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,582 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:22:14,582 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:22:14,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:15,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:15,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:22:15,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:22:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:22:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:15,708 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:22:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:17,000 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:22:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:22:17,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:22:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:17,008 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:22:17,008 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:22:17,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:22:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:22:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:22:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:22:17,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:22:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:17,010 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:22:17,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:22:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:22:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:22:17,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:17,011 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:22:17,011 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:22:17,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:17,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:22:17,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:22:18,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:22:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:22:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:18,746 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:22:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,112 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:22:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:22:20,113 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:22:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,113 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:22:20,114 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:22:20,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:22:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:22:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:22:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:22:20,117 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:22:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,117 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:22:20,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:22:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:22:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:22:20,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,118 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:22:20,118 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:22:20,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:22:21,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:22:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:22:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:21,350 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:22:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,768 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:22:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:22:22,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:22:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,769 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:22:22,769 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:22:22,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:22:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:22:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:22:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:22:22,772 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:22:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,773 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:22:22,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:22:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:22:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:22:22,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,774 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:22:22,774 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:22:22,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:22:24,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:22:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:22:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:24,077 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:22:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:25,557 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:22:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:22:25,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:22:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:25,558 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:22:25,558 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:22:25,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:22:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:22:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:22:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:22:25,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:22:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:25,562 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:22:25,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:22:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:22:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:22:25,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:25,563 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:22:25,563 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:22:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:25,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:22:25,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:26,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:22:26,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:22:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:22:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:26,962 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:22:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:28,541 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:22:28,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:22:28,541 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:22:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:28,542 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:22:28,542 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:22:28,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:22:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:22:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:22:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:22:28,545 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:22:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:28,545 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:22:28,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:22:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:22:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:22:28,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:28,546 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:22:28,546 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:22:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:28,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:22:28,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:30,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:22:30,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:22:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:22:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:30,144 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:22:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:31,766 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:22:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:22:31,767 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:22:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:31,768 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:22:31,768 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:22:31,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:22:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:22:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:22:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:22:31,771 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:22:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:31,771 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:22:31,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:22:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:22:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:22:31,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:31,772 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:22:31,772 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:22:31,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:31,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:22:31,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:22:33,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:22:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:22:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:33,067 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:22:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:34,930 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:22:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:22:34,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:22:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:34,931 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:22:34,931 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:22:34,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:22:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:22:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:22:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:22:34,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:22:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:34,934 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:22:34,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:22:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:22:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:22:34,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:34,935 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:22:34,935 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:22:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:34,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:22:34,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:36,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:36,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:22:36,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:22:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:22:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:36,984 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:22:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:38,773 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:22:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:22:38,773 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:22:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:38,774 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:22:38,774 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:22:38,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:22:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:22:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:22:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:22:38,777 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:22:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:38,777 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:22:38,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:22:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:22:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:22:38,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:38,778 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:22:38,778 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:22:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:38,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:22:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:40,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:22:40,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:22:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:22:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:22:40,334 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:22:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:42,162 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:22:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:22:42,163 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:22:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:42,163 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:22:42,163 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:22:42,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:22:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:22:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:22:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:22:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:22:42,166 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:22:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:42,166 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:22:42,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:22:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:22:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:22:42,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:42,168 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:22:42,169 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:42,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:22:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:42,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:22:42,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:43,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:22:43,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:22:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:22:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:43,784 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:22:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:45,889 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:22:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:22:45,890 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:22:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:45,891 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:22:45,891 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:22:45,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:22:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:22:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:22:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:22:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:22:45,894 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:22:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:45,895 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:22:45,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:22:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:22:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:22:45,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:45,896 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:22:45,896 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:22:45,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:45,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:22:45,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:47,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:47,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:22:47,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:22:47,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:22:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:22:47,547 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:22:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:49,739 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:22:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:22:49,739 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:22:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:49,740 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:22:49,740 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:22:49,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:22:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:22:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:22:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:22:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:22:49,743 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:22:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:49,744 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:22:49,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:22:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:22:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:22:49,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:49,744 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:22:49,745 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:22:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:49,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:22:49,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:22:51,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:22:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:22:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:51,290 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:22:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:53,337 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:22:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:22:53,337 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:22:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:53,338 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:22:53,338 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:22:53,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:22:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:22:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:22:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:22:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:22:53,342 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:22:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:53,342 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:22:53,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:22:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:22:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:22:53,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:53,343 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:22:53,343 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:22:53,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:53,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:22:53,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:55,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:55,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:22:55,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:22:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:22:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:22:55,229 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:22:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:57,353 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:22:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:22:57,353 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:22:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:57,354 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:22:57,355 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:22:57,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:22:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:22:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:22:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:22:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:22:57,357 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:22:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:57,358 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:22:57,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:22:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:22:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:22:57,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:57,358 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:22:57,359 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:22:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:57,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:22:57,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:22:59,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:22:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:22:59,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:22:59,025 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:23:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,385 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:23:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:23:01,386 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:23:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,387 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:23:01,387 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:23:01,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:23:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:23:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:23:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:23:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:23:01,389 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:23:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,389 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:23:01,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:23:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:23:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:23:01,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,390 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:23:01,390 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:23:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:03,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:03,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:23:03,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:23:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:23:03,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:23:03,173 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:23:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:05,597 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:23:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:23:05,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:23:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:05,598 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:23:05,598 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:23:05,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:23:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:23:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:23:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:23:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:23:05,602 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:23:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:05,602 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:23:05,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:23:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:23:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:23:05,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:05,603 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:23:05,603 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:23:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:05,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:23:05,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:07,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:23:07,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:23:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:23:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:23:07,498 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:23:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:09,927 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:23:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:23:09,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:23:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:09,929 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:23:09,929 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:23:09,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:23:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:23:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:23:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:23:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:23:09,932 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:23:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:09,932 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:23:09,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:23:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:23:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:23:09,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:09,933 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:23:09,933 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:23:09,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:09,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:23:10,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:11,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:11,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:23:11,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:23:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:23:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:23:11,891 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:23:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:14,337 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:23:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:23:14,337 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:23:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:14,338 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:23:14,338 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:23:14,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:23:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:23:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:23:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:23:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:23:14,342 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:23:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:14,342 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:23:14,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:23:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:23:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:23:14,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:14,343 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:23:14,343 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:23:14,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:14,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:23:14,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:16,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:16,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:23:16,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:23:16,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:23:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:23:16,492 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:23:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:19,027 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:23:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:23:19,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:23:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:19,028 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:23:19,028 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:23:19,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:23:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:23:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:23:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:23:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:23:19,031 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:23:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:19,031 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:23:19,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:23:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:23:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:23:19,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:19,032 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:23:19,033 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:23:19,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:19,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:23:19,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:21,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:23:21,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:23:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:23:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:23:21,381 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:23:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:23,993 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:23:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:23:23,994 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:23:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:23,995 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:23:23,995 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:23:23,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:23:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:23:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:23:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:23:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:23:23,998 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:23:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:23,998 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:23:23,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:23:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:23:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:23:23,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:23,999 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:23:23,999 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:23:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:24,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:23:24,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:26,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:23:26,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:23:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:23:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:23:26,859 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:23:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:29,560 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:23:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:23:29,561 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:23:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:29,562 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:23:29,562 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:23:29,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:23:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:23:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:23:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:23:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:23:29,564 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:23:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:29,565 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:23:29,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:23:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:23:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:23:29,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:29,565 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:23:29,566 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:23:29,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:29,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:23:29,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:31,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:23:31,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:23:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:23:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:31,829 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:23:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:34,613 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:23:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:23:34,614 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:23:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:34,615 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:23:34,615 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:23:34,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:23:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:23:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:23:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:23:34,618 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:23:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:34,618 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:23:34,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:23:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:23:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:23:34,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:34,619 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:23:34,619 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:23:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:34,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:23:34,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:36,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:36,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:23:36,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:23:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:23:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:23:36,989 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:23:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:39,886 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:23:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:23:39,886 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:23:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:39,887 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:23:39,887 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:23:39,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:23:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:23:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:23:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:23:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:23:39,891 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:23:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:39,891 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:23:39,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:23:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:23:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:23:39,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:39,892 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:23:39,892 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:23:39,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:39,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:23:39,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:23:42,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:23:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:23:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:23:42,311 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:23:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:45,290 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:23:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:23:45,290 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:23:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:45,290 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:23:45,290 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:23:45,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:23:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:23:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:23:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:23:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:23:45,293 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:23:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:45,293 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:23:45,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:23:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:23:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:23:45,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:45,294 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:23:45,294 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:23:45,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:45,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:23:45,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:47,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:23:47,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:23:47,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:23:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:23:47,655 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:23:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:50,991 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:23:50,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:23:50,991 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:23:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:50,992 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:23:50,992 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:23:50,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:23:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:23:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:23:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:23:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:23:50,995 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:23:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:50,995 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:23:50,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:23:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:23:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:23:50,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:50,996 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:23:50,997 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:23:50,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:51,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:23:51,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:23:53,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:23:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:23:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:23:53,309 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:23:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:56,595 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:23:56,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:23:56,596 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:23:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:56,597 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:23:56,597 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:23:56,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:23:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:23:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:23:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:23:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:23:56,599 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:23:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:56,600 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:23:56,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:23:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:23:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:23:56,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:56,601 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:23:56,601 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:23:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:56,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:23:56,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:59,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:23:59,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:23:59,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:23:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:23:59,626 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:24:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:03,017 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:24:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:24:03,018 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:24:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:03,019 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:24:03,019 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:24:03,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:24:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:24:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:24:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:24:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:24:03,022 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:24:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:03,022 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:24:03,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:24:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:24:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:24:03,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:03,023 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:24:03,023 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:24:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:03,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:24:03,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:05,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:05,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:24:05,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:24:05,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:24:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:24:05,600 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:24:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:09,066 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:24:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:24:09,066 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:24:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:09,067 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:24:09,067 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:24:09,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:24:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:24:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:24:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:24:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:24:09,070 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:24:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:09,070 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:24:09,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:24:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:24:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:24:09,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:09,071 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:24:09,071 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:24:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:09,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:24:09,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:11,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:24:11,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:24:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:24:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:24:11,953 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:24:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:15,406 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:24:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:24:15,407 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:24:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:15,408 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:24:15,408 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:24:15,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:24:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:24:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:24:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:24:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:24:15,410 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:24:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:15,410 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:24:15,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:24:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:24:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:24:15,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:15,411 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:24:15,411 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:24:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:15,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:24:15,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:18,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:24:18,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:24:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:24:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:24:18,314 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:24:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:22,006 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:24:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:24:22,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:24:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:22,007 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:24:22,007 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:24:22,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:24:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:24:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:24:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:24:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:24:22,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:24:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,011 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:24:22,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:24:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:24:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:24:22,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,012 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:24:22,012 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:24:22,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:24,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:24,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:24:24,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:24:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:24:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:24:24,795 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:24:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:28,594 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:24:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:24:28,595 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:24:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:28,596 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:24:28,596 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:24:28,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:24:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:24:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:24:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:24:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:24:28,599 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:24:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:28,599 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:24:28,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:24:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:24:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:24:28,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:28,600 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:24:28,600 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:24:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:28,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:24:28,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:31,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:31,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:24:31,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:24:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:24:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:24:31,889 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:24:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:35,634 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:24:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:24:35,634 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:24:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:35,635 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:24:35,636 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:24:35,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:24:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:24:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:24:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:24:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:24:35,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:24:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:35,639 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:24:35,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:24:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:24:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:24:35,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:35,639 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:24:35,640 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:35,640 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:24:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:35,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:24:35,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:38,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:38,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:24:38,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:24:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:24:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:24:38,699 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:24:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:42,650 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:24:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:24:42,650 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:24:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:42,651 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:24:42,651 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:24:42,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:24:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:24:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:24:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:24:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:24:42,654 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:24:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:42,655 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:24:42,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:24:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:24:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:24:42,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:42,655 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:24:42,655 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:24:42,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:42,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:24:42,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:45,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:45,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:24:45,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:24:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:24:45,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:24:45,602 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:24:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:49,703 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:24:49,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:24:49,704 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:24:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:49,705 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:24:49,705 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:24:49,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:24:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:24:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:24:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:24:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:24:49,708 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:24:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:49,708 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:24:49,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:24:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:24:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:24:49,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:49,708 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:24:49,709 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:24:49,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:49,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:24:49,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:52,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:52,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:24:52,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:24:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:24:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:24:52,861 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:24:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:56,917 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:24:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:24:56,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:24:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:56,919 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:24:56,919 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:24:56,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:24:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:24:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:24:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:24:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:24:56,922 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:24:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:56,922 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:24:56,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:24:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:24:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:24:56,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:56,923 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:24:56,923 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:24:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:00,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:25:00,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:25:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:25:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:25:00,088 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:25:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:04,430 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:25:04,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:25:04,431 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:25:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:04,432 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:25:04,432 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:25:04,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:25:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:25:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:25:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:25:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:25:04,435 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:25:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:04,435 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:25:04,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:25:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:25:04,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:25:04,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:04,436 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:25:04,436 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:04,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:25:04,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:04,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:25:04,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:07,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:25:07,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:25:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:25:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:25:07,779 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:25:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:12,055 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:25:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:25:12,055 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:25:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:12,056 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:25:12,056 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:25:12,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:25:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:25:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:25:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:25:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:25:12,059 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:25:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:12,060 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:25:12,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:25:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:25:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:25:12,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:12,060 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:25:12,061 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:25:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:12,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:25:12,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:15,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:15,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:25:15,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:25:15,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:25:15,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:25:15,559 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:25:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:20,333 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:25:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:25:20,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:25:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:20,335 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:25:20,335 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:25:20,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:25:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:25:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:25:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:25:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:25:20,338 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:25:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:20,338 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:25:20,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:25:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:25:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:25:20,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:20,338 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:25:20,339 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:25:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:20,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:25:20,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:24,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:24,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:25:24,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:25:24,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:25:24,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:25:24,157 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:25:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:28,802 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:25:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:25:28,802 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:25:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:28,803 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:25:28,803 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:25:28,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:25:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:25:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:25:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:25:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:25:28,806 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:25:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:28,807 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:25:28,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:25:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:25:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:25:28,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:28,807 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:25:28,808 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:25:28,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:28,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:25:28,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:32,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:32,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:25:32,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:25:32,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:25:32,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:25:32,118 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:25:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:36,914 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:25:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:25:36,915 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:25:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:36,915 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:25:36,916 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:25:36,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:25:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:25:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:25:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:25:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:25:36,918 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:25:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:36,918 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:25:36,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:25:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:25:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:25:36,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:36,919 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:25:36,919 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:25:36,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:37,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:25:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:25:37,164 WARN L196 SmtUtils]: Removed 3 from assertion stack [2019-08-05 10:25:37,164 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:25:37,164 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:25:37,168 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:25:37,169 INFO L202 PluginConnector]: Adding new model half_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:37 BoogieIcfgContainer [2019-08-05 10:25:37,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:37,171 INFO L168 Benchmark]: Toolchain (without parser) took 250227.24 ms. Allocated memory was 138.4 MB in the beginning and 261.6 MB in the end (delta: 123.2 MB). Free memory was 106.8 MB in the beginning and 33.7 MB in the end (delta: 73.1 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:37,172 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 108.1 MB in the beginning and 107.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 10:25:37,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.70 ms. Allocated memory is still 138.4 MB. Free memory was 106.6 MB in the beginning and 105.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:37,173 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 138.4 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:37,174 INFO L168 Benchmark]: RCFGBuilder took 311.09 ms. Allocated memory is still 138.4 MB. Free memory was 103.8 MB in the beginning and 94.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:37,175 INFO L168 Benchmark]: TraceAbstraction took 249847.53 ms. Allocated memory was 138.4 MB in the beginning and 261.6 MB in the end (delta: 123.2 MB). Free memory was 93.9 MB in the beginning and 33.7 MB in the end (delta: 60.2 MB). Peak memory consumption was 183.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:37,178 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 108.1 MB in the beginning and 107.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 39.70 ms. Allocated memory is still 138.4 MB. Free memory was 106.6 MB in the beginning and 105.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 138.4 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.09 ms. Allocated memory is still 138.4 MB. Free memory was 103.8 MB in the beginning and 94.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249847.53 ms. Allocated memory was 138.4 MB in the beginning and 261.6 MB in the end (delta: 123.2 MB). Free memory was 93.9 MB in the beginning and 33.7 MB in the end (delta: 60.2 MB). Peak memory consumption was 183.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 80,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 9 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.7s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 133.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 0 SDslu, 3240 SDs, 0 SdLazy, 180360 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3320 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 80 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 112.8s InterpolantComputationTime, 3400 NumberOfCodeBlocks, 3400 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 3320 ConstructedInterpolants, 0 QuantifiedInterpolants, 1570862 SizeOfPredicates, 320 NumberOfNonLiveVariables, 17560 ConjunctsInSsa, 6800 ConjunctsInUnsatCore, 80 InterpolantComputations, 1 PerfectInterpolantSequences, 0/85320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown