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/20170319-ConjunctivePathPrograms/cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:37,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:37,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:37,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:37,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:37,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:37,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:37,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:37,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:37,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:37,765 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:37,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:37,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:37,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:37,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:37,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:37,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:37,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:37,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:37,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:37,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:37,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:37,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:37,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:37,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:37,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:37,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:37,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:37,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:37,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:37,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:37,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:37,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:37,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:37,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:37,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:37,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:37,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:37,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:37,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:37,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:37,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:37,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:37,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:37,871 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:37,872 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:37,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:37,873 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:49:37,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:37,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:37,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:37,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:37,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:37,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:37,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:37,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:37,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:37,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/1) ... [2019-08-05 10:49:37,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:37,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:37,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:37,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:37,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (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:49:38,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:49:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:49:38,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:49:38,298 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:49:38,298 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:38,300 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:38 BoogieIcfgContainer [2019-08-05 10:49:38,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:38,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:38,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:38,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:38,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:37" (1/2) ... [2019-08-05 10:49:38,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e51c78 and model type cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:38, skipping insertion in model container [2019-08-05 10:49:38,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:38" (2/2) ... [2019-08-05 10:49:38,313 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:38,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:38,331 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:38,349 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:38,382 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:38,383 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:38,383 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:38,383 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:38,383 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:38,383 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:38,383 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:38,384 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:38,384 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:38,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:38,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:49:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:38,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:49:38,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:38,537 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:49:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:38,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:38,562 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:38,593 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:38,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:38,604 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:38,604 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:38,607 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:49:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:38,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:38,640 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:38,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:38,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:38,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:49:38,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:38,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:49:38,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:38,798 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:49:38,927 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:49:38,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:38,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:38,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:38,931 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:38,974 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:38,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:38,975 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:38,975 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:38,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:38,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:38,978 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:38,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:38,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:38,979 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:38,980 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:49:38,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,135 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:49:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:39,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:39,137 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,219 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:39,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:39,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,221 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:39,221 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:39,221 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:49:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:39,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,224 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:39,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:39,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,225 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:39,225 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:49:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,246 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,468 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:49:39,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:49:39,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:49:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:49:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:39,470 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:49:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,662 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:39,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:49:39,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:49:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,664 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:39,664 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:39,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:39,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,667 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:39,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:49:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:39,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,668 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:39,668 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:49:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,904 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:49:39,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:49:39,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:49:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:49:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:39,906 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:49:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:40,058 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:49:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:49:40,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:49:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:40,060 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:40,060 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:49:40,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:49:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:49:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:49:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:49:40,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:49:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:40,065 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:49:40,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:49:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:49:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:49:40,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:40,065 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:49:40,066 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:49:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:40,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:49:40,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:40,277 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:49:40,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:49:40,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:49:40,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:49:40,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:40,279 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:49:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:40,404 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:49:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:49:40,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:49:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:40,410 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:49:40,410 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:40,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:49:40,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:49:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:40,413 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:49:40,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:49:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:49:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:49:40,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:40,414 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:49:40,414 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:49:40,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:40,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:49:40,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:40,954 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:49:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:49:40,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:49:40,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:49:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:40,956 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:49:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,032 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:49:41,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:49:41,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:49:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,034 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:41,034 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:49:41,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:49:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:49:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:49:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:49:41,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:49:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,038 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:49:41,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:49:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:49:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:49:41,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,039 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:49:41,039 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,039 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:49:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:41,294 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:49:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:49:41,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:49:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:49:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:41,296 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:49:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,393 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:49:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:49:41,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:49:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,395 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:49:41,395 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:41,396 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:49:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:49:41,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:49:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,408 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:49:41,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:49:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:49:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:49:41,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,409 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:49:41,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:49:41,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:41,687 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:49:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:49:41,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:49:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:49:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:41,689 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:49:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:41,874 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:49:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:49:41,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:49:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:41,875 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:49:41,875 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:49:41,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:49:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:49:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:49:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:49:41,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:49:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:41,879 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:49:41,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:49:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:49:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:49:41,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:41,880 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:49:41,880 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:49:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:41,902 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:49:41,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:42,263 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:49:42,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:42,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:49:42,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:49:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:49:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:42,265 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:49:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,413 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:49:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:49:42,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:49:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,415 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:49:42,415 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:49:42,416 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:49:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:49:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:49:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:49:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:49:42,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:49:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,419 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:49:42,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:49:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:49:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:49:42,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,420 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:49:42,420 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:49:42,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:42,880 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:49:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:42,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:49:42,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:49:42,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:49:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:42,882 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:49:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:43,026 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:49:43,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:49:43,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:49:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:43,033 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:49:43,033 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:49:43,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:49:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:49:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:49:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:49:43,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:49:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:43,037 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:49:43,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:49:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:49:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:49:43,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:43,038 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:49:43,038 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:49:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:43,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:49:43,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,414 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:49:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:49:43,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:49:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:49:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:43,416 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:49:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:43,556 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:49:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:49:43,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:49:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:43,558 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:49:43,558 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:49:43,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:49:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:49:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:49:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:49:43,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:49:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:43,562 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:49:43,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:49:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:49:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:49:43,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:43,563 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:49:43,563 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:49:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:43,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:49:43,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:44,059 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:49:44,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:44,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:49:44,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:49:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:49:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:44,061 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:49:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:44,244 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:49:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:49:44,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:49:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:44,249 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:49:44,249 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:49:44,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:49:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:49:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:49:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:49:44,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:49:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:44,255 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:49:44,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:49:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:49:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:49:44,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:44,256 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:49:44,256 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:49:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:44,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:49:44,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:44,692 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:49:44,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:44,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:49:44,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:49:44,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:49:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:44,693 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:49:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:44,897 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:49:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:49:44,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:49:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:44,899 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:49:44,899 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:49:44,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:49:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:49:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:49:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:49:44,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:49:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:44,903 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:49:44,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:49:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:49:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:49:44,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:44,904 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:49:44,904 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:44,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:49:44,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:44,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:49:44,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:45,306 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:49:45,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:45,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:49:45,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:49:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:49:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:45,307 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:49:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,681 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:49:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:49:45,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:49:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,682 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:49:45,682 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:49:45,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:49:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:49:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:49:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:49:45,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:49:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,686 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:49:45,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:49:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:49:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:49:45,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,687 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:49:45,687 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:49:45,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:45,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:49:45,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,126 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:49:46,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:49:46,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:49:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:49:46,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:46,128 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:49:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,363 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:49:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:49:46,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:49:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,365 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:49:46,365 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:49:46,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:49:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:49:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:49:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:49:46,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:49:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,369 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:49:46,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:49:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:49:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:49:46,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,370 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:49:46,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:49:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,748 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:49:46,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:46,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:49:46,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:49:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:49:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:46,751 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:49:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:47,105 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:49:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:49:47,106 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:49:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:47,106 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:49:47,106 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:49:47,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:49:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:49:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:49:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:49:47,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:49:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:47,110 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:49:47,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:49:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:49:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:49:47,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:47,111 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:49:47,111 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:49:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:47,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:49:47,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:47,580 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:49:47,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:49:47,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:49:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:49:47,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:47,582 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:49:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:47,967 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:49:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:49:47,968 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:49:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:47,968 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:49:47,969 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:49:47,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:49:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:49:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:49:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:49:47,972 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:49:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:47,973 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:49:47,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:49:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:49:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:49:47,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:47,974 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:49:47,974 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:49:47,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:47,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:49:47,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:48,382 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:49:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:49:48,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:49:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:49:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:48,384 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:49:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:48,705 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:49:48,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:49:48,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:49:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:48,707 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:49:48,707 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:49:48,708 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:49:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:49:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:49:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:49:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:49:48,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:49:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:48,711 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:49:48,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:49:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:49:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:49:48,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:48,712 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:49:48,713 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:49:48,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:48,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:49:48,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:49,454 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:49:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:49,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:49:49,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:49:49,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:49:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:49,457 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:49:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:49,825 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:49:49,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:49:49,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:49:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:49,827 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:49:49,827 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:49:49,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:49:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:49:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:49:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:49:49,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:49:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:49,831 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:49:49,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:49:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:49:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:49:49,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:49,832 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:49:49,832 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:49:49,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:49,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:49:49,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:50,567 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:49:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:49:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:49:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:49:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:50,569 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:49:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:50,966 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:49:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:49:50,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:49:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:50,968 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:49:50,968 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:49:50,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:49:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:49:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:49:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:49:50,974 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:49:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:50,974 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:49:50,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:49:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:49:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:49:50,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:50,975 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:49:50,975 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:49:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:50,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,680 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:49:52,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:52,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:49:52,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:49:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:49:52,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:52,682 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:49:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,173 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:49:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:49:53,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:49:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,176 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:49:53,177 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:49:53,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:49:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:49:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:49:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:49:53,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:49:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,180 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:49:53,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:49:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:49:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:49:53,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,181 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:49:53,181 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,182 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:49:53,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,216 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,664 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:49:53,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:49:53,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:49:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:49:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:53,665 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:49:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,541 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:49:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:49:54,542 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:49:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,543 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:49:54,543 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:49:54,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:49:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:49:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:49:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:49:54,546 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:49:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,547 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:49:54,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:49:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:49:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:49:54,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,548 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:49:54,548 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:49:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,055 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:49:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:49:56,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:49:56,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:49:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:56,057 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:49:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,712 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:49:56,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:49:56,713 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:49:56,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,714 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:49:56,714 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:49:56,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:49:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:49:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:49:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:49:56,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:49:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,720 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:49:56,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:49:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:49:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:49:56,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,722 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:49:56,722 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:49:56,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:57,532 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:49:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:49:57,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:49:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:49:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:57,534 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:49:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:58,054 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:49:58,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:49:58,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:49:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:58,056 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:49:58,056 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:49:58,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:49:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:49:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:49:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:49:58,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:49:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:49:58,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:49:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:49:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:49:58,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:58,062 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:49:58,062 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:49:58,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:58,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:49:58,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:58,582 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:49:58,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:58,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:49:58,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:49:58,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:49:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:58,584 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:49:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,153 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:49:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:49:59,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:49:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,154 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:49:59,154 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:49:59,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:49:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:49:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:49:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:49:59,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:49:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,158 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:49:59,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:49:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:49:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:49:59,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,159 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:49:59,159 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:49:59,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,739 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:49:59,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:49:59,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:49:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:49:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:59,740 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:50:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:00,364 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:50:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:50:00,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:50:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:00,365 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:50:00,365 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:50:00,366 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:50:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:50:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:50:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:50:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:50:00,370 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:50:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:00,370 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:50:00,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:50:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:50:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:50:00,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:00,371 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:50:00,371 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:50:00,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:00,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:50:00,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,012 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:50:01,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:50:01,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:50:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:50:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:50:01,015 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:50:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,754 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:50:01,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:50:01,755 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:50:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,756 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:50:01,756 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:50:01,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:50:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:50:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:50:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:50:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:50:01,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:50:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,762 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:50:01,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:50:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:50:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:50:01,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:01,763 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:50:01,763 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:50:01,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:01,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:50:01,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:02,908 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:50:02,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:02,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:50:02,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:50:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:50:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:50:02,909 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:50:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,666 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:50:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:50:03,667 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:50:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,668 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:50:03,668 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:50:03,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:50:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:50:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:50:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:50:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:50:03,672 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:50:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,672 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:50:03,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:50:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:50:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:50:03,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:03,673 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:50:03,673 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:50:03,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:03,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:50:03,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:04,372 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:50:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:50:04,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:50:04,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:50:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:50:04,374 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:50:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:05,095 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:50:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:50:05,095 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:50:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:05,096 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:50:05,096 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:50:05,097 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:50:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:50:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:50:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:50:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:50:05,101 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:50:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:05,101 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:50:05,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:50:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:50:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:50:05,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:05,102 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:50:05,103 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:50:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:05,136 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:50:05,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:05,867 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:50:05,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:05,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:50:05,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:50:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:50:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:50:05,868 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:50:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:06,691 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:50:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:50:06,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:50:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:06,693 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:50:06,693 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:50:06,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:50:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:50:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:50:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:50:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:50:06,696 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:50:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:06,696 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:50:06,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:50:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:50:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:50:06,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:06,697 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:50:06,697 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:50:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:06,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:50:06,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,599 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:50:07,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:50:07,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:50:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:50:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:50:07,600 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:50:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:08,475 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:50:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:50:08,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:50:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:08,476 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:50:08,477 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:50:08,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:50:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:50:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:50:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:50:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:50:08,480 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:50:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:08,481 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:50:08,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:50:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:50:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:50:08,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:08,481 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:50:08,482 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:50:08,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:09,291 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:50:09,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:50:09,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:50:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:50:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:50:09,293 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:50:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:10,188 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:50:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:50:10,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:50:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:10,190 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:50:10,190 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:50:10,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:50:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:50:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:50:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:50:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:50:10,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:50:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:10,194 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:50:10,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:50:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:50:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:50:10,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:10,195 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:50:10,195 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:50:10,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:10,233 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:50:10,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,208 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:50:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:50:11,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:50:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:50:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:50:11,210 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:50:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:12,156 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:50:12,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:50:12,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:50:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:12,158 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:50:12,158 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:50:12,159 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:50:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:50:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:50:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:50:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:50:12,161 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:50:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:12,161 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:50:12,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:50:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:50:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:50:12,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:12,162 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:50:12,162 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:50:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:12,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:50:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,177 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:50:13,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:50:13,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:50:13,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:50:13,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:50:13,179 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:50:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,158 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:50:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:50:14,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:50:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,159 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:50:14,159 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:50:14,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:50:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:50:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:50:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:50:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:50:14,163 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:50:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:14,163 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:50:14,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:50:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:50:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:50:14,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:14,164 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:50:14,164 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:50:14,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:14,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:50:14,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:15,442 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:50:15,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:15,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:50:15,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:50:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:50:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:50:15,444 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:50:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:16,517 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:50:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:50:16,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:50:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:16,518 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:50:16,518 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:50:16,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:50:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:50:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:50:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:50:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:50:16,521 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:50:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:16,521 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:50:16,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:50:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:50:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:50:16,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:16,522 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:50:16,522 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:50:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:16,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:50:16,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:17,495 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:50:17,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:17,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:50:17,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:50:17,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:50:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:50:17,497 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:50:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:18,732 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:50:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:50:18,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:50:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:18,733 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:50:18,734 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:50:18,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:50:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:50:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:50:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:50:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:50:18,737 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:50:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:18,737 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:50:18,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:50:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:50:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:50:18,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:18,738 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:50:18,738 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:50:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:18,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:50:18,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:19,681 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:50:19,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:19,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:50:19,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:50:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:50:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:50:19,683 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:50:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:20,837 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:50:20,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:50:20,838 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:50:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:20,839 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:50:20,839 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:50:20,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:50:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:50:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:50:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:50:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:50:20,842 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:50:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:20,842 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:50:20,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:50:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:50:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:50:20,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:20,843 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:50:20,843 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:50:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:20,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:50:20,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:22,174 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:50:22,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:22,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:50:22,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:50:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:50:22,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:50:22,175 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:50:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:23,543 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:50:23,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:50:23,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:50:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:23,545 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:50:23,545 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:50:23,546 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:50:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:50:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:50:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:50:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:50:23,548 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:50:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:23,549 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:50:23,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:50:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:50:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:50:23,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:23,549 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:50:23,550 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:50:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:23,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:50:23,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:24,610 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:50:24,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:24,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:50:24,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:50:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:50:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:50:24,612 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:50:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:25,869 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:50:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:50:25,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:50:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:25,870 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:50:25,870 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:50:25,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:50:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:50:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:50:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:50:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:50:25,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:50:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:25,873 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:50:25,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:50:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:50:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:50:25,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:25,874 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:50:25,874 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:50:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:25,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:50:25,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:27,149 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:50:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:50:27,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:50:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:50:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:50:27,150 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:50:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:28,631 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:50:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:50:28,632 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:50:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:28,632 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:50:28,632 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:50:28,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:50:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:50:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:50:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:50:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:50:28,636 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:50:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:28,636 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:50:28,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:50:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:50:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:50:28,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:28,637 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:50:28,638 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:50:28,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:28,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:50:28,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:29,798 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:50:29,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:29,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:50:29,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:50:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:50:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:50:29,800 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:50:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:31,237 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:50:31,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:50:31,237 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:50:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:31,238 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:50:31,238 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:50:31,239 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:50:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:50:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:50:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:50:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:50:31,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:50:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:31,242 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:50:31,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:50:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:50:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:50:31,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:31,242 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:50:31,243 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:50:31,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:31,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:50:31,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:32,458 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:50:32,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:32,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:50:32,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:50:32,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:50:32,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:50:32,460 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:50:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:34,019 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:50:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:50:34,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:50:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:34,020 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:50:34,020 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:50:34,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:50:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:50:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:50:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:50:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:50:34,024 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:50:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:34,024 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:50:34,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:50:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:50:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:50:34,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:34,025 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:50:34,026 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:50:34,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:34,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:50:34,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:35,300 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:50:35,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:35,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:50:35,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:50:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:50:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:50:35,301 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:50:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:36,844 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:50:36,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:50:36,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:50:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:36,845 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:50:36,845 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:50:36,846 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:50:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:50:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:50:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:50:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:50:36,848 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:50:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:36,849 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:50:36,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:50:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:50:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:50:36,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:36,849 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:50:36,850 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:36,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:50:36,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:36,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:50:36,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:38,868 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:50:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:38,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:50:38,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:50:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:50:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:50:38,869 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:50:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,515 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:50:40,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:50:40,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:50:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,517 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:50:40,517 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:50:40,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:50:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:50:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:50:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:50:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:50:40,520 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:50:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,520 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:50:40,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:50:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:50:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:50:40,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,522 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:50:40,522 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:50:40,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:41,934 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:50:41,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:41,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:50:41,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:50:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:50:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:50:41,935 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:50:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:43,753 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:50:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:50:43,753 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:50:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:43,754 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:50:43,754 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:50:43,755 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:50:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:50:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:50:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:50:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:50:43,757 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:50:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:43,757 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:50:43,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:50:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:50:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:50:43,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:43,758 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:50:43,758 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:50:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:43,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:50:43,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:45,216 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:50:45,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:45,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:50:45,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:50:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:50:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:50:45,218 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:50:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:46,943 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:50:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:50:46,944 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:50:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:46,945 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:50:46,945 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:50:46,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:50:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:50:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:50:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:50:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:50:46,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:50:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:46,947 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:50:46,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:50:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:50:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:50:46,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:46,948 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:50:46,949 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:50:46,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:46,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:50:46,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:48,400 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:50:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:48,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:50:48,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:50:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:50:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:50:48,401 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:50:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:50,296 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:50:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:50:50,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:50:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:50,297 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:50:50,297 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:50:50,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:50:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:50:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:50:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:50:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:50:50,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:50:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:50,301 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:50:50,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:50:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:50:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:50:50,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:50,301 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:50:50,302 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:50:50,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:50,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:50:50,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,989 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:50:51,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:51,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:50:51,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:50:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:50:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:50:51,990 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:50:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:54,029 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:50:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:50:54,029 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:50:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:54,030 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:50:54,030 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:50:54,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:50:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:50:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:50:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:50:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:50:54,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:50:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:54,034 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:50:54,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:50:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:50:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:50:54,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:54,035 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:50:54,035 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:50:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:54,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:50:54,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:55,712 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:50:55,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:55,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:50:55,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:50:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:50:55,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:50:55,713 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:50:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:57,727 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:50:57,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:50:57,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:50:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:57,728 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:50:57,728 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:50:57,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:50:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:50:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:50:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:50:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:50:57,732 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:50:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:57,732 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:50:57,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:50:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:50:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:50:57,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:57,733 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:50:57,733 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:50:57,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:57,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:50:57,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:59,532 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:50:59,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:59,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:50:59,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:50:59,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:50:59,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:50:59,533 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:51:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:01,555 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:51:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:51:01,556 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:51:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:01,557 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:51:01,557 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:51:01,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:51:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:51:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:51:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:51:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:51:01,560 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:51:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:01,560 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:51:01,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:51:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:51:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:51:01,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:01,561 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:51:01,561 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:51:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:01,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 312 conjunts are in the unsatisfiable core [2019-08-05 10:51:01,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:03,252 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:51:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:03,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:51:03,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:51:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:51:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:51:03,254 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:51:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:05,503 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:51:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:51:05,503 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:51:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:05,504 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:51:05,504 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:51:05,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:51:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:51:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:51:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:51:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:51:05,507 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:51:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:05,507 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:51:05,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:51:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:51:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:51:05,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:05,508 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:51:05,508 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:51:05,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:05,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 318 conjunts are in the unsatisfiable core [2019-08-05 10:51:05,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:07,205 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:51:07,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:07,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:51:07,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:51:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:51:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:51:07,206 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:51:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:09,646 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:51:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:51:09,646 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:51:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:09,647 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:51:09,647 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:51:09,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:51:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:51:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:51:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:51:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:51:09,651 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:51:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:09,651 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:51:09,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:51:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:51:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:51:09,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:09,652 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:51:09,652 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:51:09,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:09,736 WARN L254 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 324 conjunts are in the unsatisfiable core [2019-08-05 10:51:09,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:11,395 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:51:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:51:11,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:51:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:51:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:51:11,397 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:51:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:13,734 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:51:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:51:13,734 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:51:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:13,735 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:51:13,735 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:51:13,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:51:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:51:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:51:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:51:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:51:13,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:51:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:13,738 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:51:13,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:51:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:51:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:51:13,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:13,739 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:51:13,739 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:51:13,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:13,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 330 conjunts are in the unsatisfiable core [2019-08-05 10:51:13,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:15,764 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:51:15,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:15,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:51:15,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:51:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:51:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:51:15,766 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:51:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:18,136 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:51:18,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:51:18,137 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:51:18,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:18,138 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:51:18,138 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:51:18,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:51:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:51:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:51:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:51:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:51:18,139 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:51:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:18,140 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:51:18,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:51:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:51:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:51:18,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:18,140 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:51:18,141 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:18,141 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:51:18,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:18,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 336 conjunts are in the unsatisfiable core [2019-08-05 10:51:18,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:20,272 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:51:20,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:20,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:51:20,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:51:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:51:20,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:51:20,273 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:51:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:22,710 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:51:22,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:51:22,710 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:51:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:22,711 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:51:22,711 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:51:22,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:51:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:51:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:51:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:51:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:51:22,714 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:51:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:22,715 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:51:22,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:51:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:51:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:51:22,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:22,716 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:51:22,716 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:51:22,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:22,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 342 conjunts are in the unsatisfiable core [2019-08-05 10:51:22,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:24,828 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:51:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:24,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:51:24,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:51:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:51:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:51:24,829 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:51:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:27,432 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:51:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:51:27,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:51:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:27,434 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:51:27,434 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:51:27,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:51:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:51:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:51:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:51:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:51:27,436 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:51:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:27,436 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:51:27,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:51:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:51:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:51:27,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:27,438 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:51:27,438 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:51:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:27,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 348 conjunts are in the unsatisfiable core [2019-08-05 10:51:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:29,488 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:51:29,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:29,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:51:29,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:51:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:51:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:51:29,490 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:51:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:32,237 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:51:32,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:51:32,237 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:51:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:32,238 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:51:32,238 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:51:32,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:51:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:51:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:51:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:51:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:51:32,241 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:51:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:32,242 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:51:32,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:51:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:51:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:51:32,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:32,242 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:51:32,243 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:32,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:51:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:32,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 354 conjunts are in the unsatisfiable core [2019-08-05 10:51:32,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:34,563 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:51:34,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:34,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:51:34,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:51:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:51:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:51:34,564 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:51:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:37,446 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:51:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:51:37,447 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:51:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:37,448 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:51:37,448 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:51:37,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:51:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:51:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:51:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:51:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:51:37,450 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:51:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:37,451 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:51:37,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:51:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:51:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:51:37,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:37,451 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:51:37,452 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:51:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:37,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 360 conjunts are in the unsatisfiable core [2019-08-05 10:51:37,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:39,666 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:51:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:39,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:51:39,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:51:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:51:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:51:39,668 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:51:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:42,623 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:51:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:51:42,624 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:51:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:42,625 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:51:42,625 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:51:42,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:51:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:51:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:51:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:51:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:51:42,628 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:51:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:42,628 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:51:42,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:51:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:51:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:51:42,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:42,629 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:51:42,629 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:51:42,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:42,710 WARN L254 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 366 conjunts are in the unsatisfiable core [2019-08-05 10:51:42,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:45,078 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:51:45,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:45,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:51:45,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:51:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:51:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:51:45,080 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:51:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:48,013 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:51:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:51:48,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:51:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:48,014 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:51:48,014 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:51:48,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:51:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:51:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:51:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:51:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:51:48,017 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:51:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:48,017 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:51:48,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:51:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:51:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:51:48,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:48,018 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:51:48,018 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:51:48,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:48,097 WARN L254 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 372 conjunts are in the unsatisfiable core [2019-08-05 10:51:48,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:50,524 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:51:50,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:50,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:51:50,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:51:50,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:51:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:51:50,525 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:51:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:53,533 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:51:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:51:53,534 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:51:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:53,535 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:51:53,535 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:51:53,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:51:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:51:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:51:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:51:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:51:53,537 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:51:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:53,538 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:51:53,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:51:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:51:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:51:53,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:53,539 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:51:53,539 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:51:53,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:53,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 378 conjunts are in the unsatisfiable core [2019-08-05 10:51:53,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:56,024 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:51:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:51:56,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:51:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:51:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:51:56,026 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:51:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:59,120 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:51:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:51:59,120 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:51:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:59,121 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:51:59,121 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:51:59,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:51:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:51:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:51:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:51:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:51:59,124 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:51:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:59,125 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:51:59,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:51:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:51:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:51:59,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:59,125 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:51:59,126 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:51:59,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:59,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 384 conjunts are in the unsatisfiable core [2019-08-05 10:51:59,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:01,671 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:52:01,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:52:01,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:52:01,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:52:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:52:01,673 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:52:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:04,847 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:52:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:52:04,847 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:52:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:04,848 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:52:04,848 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:52:04,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:52:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:52:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:52:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:52:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:52:04,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:52:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:04,852 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:52:04,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:52:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:52:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:52:04,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:04,853 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:52:04,853 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:52:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:04,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 390 conjunts are in the unsatisfiable core [2019-08-05 10:52:04,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,017 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:52:08,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:08,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:52:08,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:52:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:52:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:08,018 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:52:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,462 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:52:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:52:11,463 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:52:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,464 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:52:11,464 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:52:11,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:52:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:52:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:52:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:52:11,467 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:52:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,467 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:52:11,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:52:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:52:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:52:11,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,468 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:52:11,468 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:52:11,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 396 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:14,109 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:52:14,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:14,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:52:14,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:52:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:52:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:14,110 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:52:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:17,688 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:52:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:52:17,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:52:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:17,689 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:52:17,689 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:52:17,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:52:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:52:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:52:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:52:17,692 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:52:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:17,692 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:52:17,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:52:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:52:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:52:17,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:17,693 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:52:17,693 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:52:17,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:17,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 402 conjunts are in the unsatisfiable core [2019-08-05 10:52:17,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:21,440 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:52:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:21,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:52:21,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:52:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:52:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:52:21,441 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:52:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:25,037 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:52:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:52:25,037 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:52:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:25,038 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:52:25,038 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:52:25,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:52:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:52:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:52:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:52:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:52:25,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:52:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:25,041 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:52:25,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:52:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:52:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:52:25,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:25,043 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:52:25,043 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:52:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:25,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 408 conjunts are in the unsatisfiable core [2019-08-05 10:52:25,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:28,021 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:52:28,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:52:28,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:52:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:52:28,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:52:28,023 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:52:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:31,817 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:52:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:52:31,818 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:52:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:31,819 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:52:31,819 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:52:31,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:52:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:52:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:52:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:52:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:52:31,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:52:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:31,822 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:52:31,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:52:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:52:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:52:31,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:31,823 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:52:31,823 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:31,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:52:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:31,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 414 conjunts are in the unsatisfiable core [2019-08-05 10:52:31,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:34,555 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:52:34,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:52:34,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:52:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:52:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:52:34,557 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:52:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:38,482 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:52:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:52:38,482 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:52:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:38,483 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:52:38,483 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:52:38,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:52:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:52:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:52:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:52:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:52:38,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:52:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:38,487 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:52:38,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:52:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:52:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:52:38,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:38,488 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:52:38,488 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:52:38,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:38,612 WARN L254 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 420 conjunts are in the unsatisfiable core [2019-08-05 10:52:38,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:41,444 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:52:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:41,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:52:41,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:52:41,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:52:41,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:52:41,445 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:52:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:45,234 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:52:45,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:52:45,235 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:52:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:45,236 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:52:45,236 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:52:45,237 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:52:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:52:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:52:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:52:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:52:45,239 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:52:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:45,240 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:52:45,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:52:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:52:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:52:45,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:45,241 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:52:45,241 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:45,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:45,241 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:52:45,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:45,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 426 conjunts are in the unsatisfiable core [2019-08-05 10:52:45,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:48,392 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:52:48,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:52:48,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:52:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:52:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:52:48,393 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:52:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:52,347 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:52:52,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:52:52,347 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:52:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:52,348 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:52:52,349 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:52:52,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:52:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:52:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:52:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:52:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:52:52,352 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:52:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:52,352 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:52:52,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:52:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:52:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:52:52,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:52,353 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:52:52,353 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:52:52,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:52,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 432 conjunts are in the unsatisfiable core [2019-08-05 10:52:52,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:55,330 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:52:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:52:55,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:52:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:52:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:52:55,331 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:52:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:59,432 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:52:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:52:59,433 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:52:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:59,434 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:52:59,434 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:52:59,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:52:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:52:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:52:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:52:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:52:59,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:52:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:59,437 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:52:59,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:52:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:52:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:52:59,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:59,438 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:52:59,438 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:52:59,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:59,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 438 conjunts are in the unsatisfiable core [2019-08-05 10:52:59,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:02,776 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:53:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:53:02,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:53:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:53:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:02,777 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:53:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:07,023 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:53:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:53:07,023 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:53:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:07,024 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:53:07,024 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:53:07,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:53:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:53:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:53:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:53:07,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:53:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:07,027 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:53:07,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:53:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:53:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:53:07,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:07,028 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:53:07,028 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:53:07,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:07,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 444 conjunts are in the unsatisfiable core [2019-08-05 10:53:07,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:10,018 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:53:10,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:10,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:53:10,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:53:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:53:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:10,019 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:53:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:14,425 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:53:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:53:14,426 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:53:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:14,426 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:53:14,427 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:53:14,427 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:53:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:53:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:53:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:53:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:53:14,430 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:53:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:14,430 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:53:14,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:53:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:53:14,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:53:14,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:14,431 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:53:14,431 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:53:14,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:14,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 450 conjunts are in the unsatisfiable core [2019-08-05 10:53:14,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,895 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:53:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:53:19,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:53:19,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:53:19,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:53:19,897 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:53:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:24,616 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:53:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:53:24,617 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:53:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:24,618 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:53:24,618 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:53:24,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:53:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:53:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:53:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:53:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:53:24,621 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:53:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:24,622 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:53:24,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:53:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:53:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:53:24,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:24,622 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:53:24,623 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:53:24,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:24,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 456 conjunts are in the unsatisfiable core [2019-08-05 10:53:24,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:28,065 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:53:28,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:28,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:53:28,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:53:28,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:53:28,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:53:28,066 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:53:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:32,633 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:53:32,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:53:32,634 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:53:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:32,634 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:53:32,634 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:53:32,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:53:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:53:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:53:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:53:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:53:32,637 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:53:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:32,637 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:53:32,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:53:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:53:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:53:32,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:32,638 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:53:32,638 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:53:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:32,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 462 conjunts are in the unsatisfiable core [2019-08-05 10:53:32,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:35,905 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:53:35,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:35,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:53:35,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:53:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:53:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:53:35,906 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:53:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:40,641 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:53:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:53:40,641 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:53:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:40,642 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:53:40,642 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:53:40,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:53:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:53:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:53:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:53:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:53:40,645 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:53:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:40,645 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:53:40,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:53:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:53:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:53:40,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:40,646 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:53:40,646 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:53:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:40,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 468 conjunts are in the unsatisfiable core [2019-08-05 10:53:40,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:44,329 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:53:44,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:44,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:53:44,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:53:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:53:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:53:44,331 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. Received shutdown request... [2019-08-05 10:53:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:53:47,739 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:53:47,747 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:53:47,747 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:53:47 BoogieIcfgContainer [2019-08-05 10:53:47,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:53:47,749 INFO L168 Benchmark]: Toolchain (without parser) took 249841.20 ms. Allocated memory was 141.6 MB in the beginning and 507.0 MB in the end (delta: 365.4 MB). Free memory was 108.7 MB in the beginning and 93.5 MB in the end (delta: 15.2 MB). Peak memory consumption was 380.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:47,749 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:53:47,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 141.6 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:47,750 INFO L168 Benchmark]: Boogie Preprocessor took 22.11 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:47,751 INFO L168 Benchmark]: RCFGBuilder took 333.95 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 96.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:47,752 INFO L168 Benchmark]: TraceAbstraction took 249444.97 ms. Allocated memory was 141.6 MB in the beginning and 507.0 MB in the end (delta: 365.4 MB). Free memory was 95.8 MB in the beginning and 93.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 367.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:47,754 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.86 ms. Allocated memory is still 141.6 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.11 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.95 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 96.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249444.97 ms. Allocated memory was 141.6 MB in the beginning and 507.0 MB in the end (delta: 365.4 MB). Free memory was 95.8 MB in the beginning and 93.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 367.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 52 states, 80 states before enhancement),while ReachableStatesComputation was computing reachable states (50 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.3s OverallTime, 78 OverallIterations, 77 TraceHistogramMax, 131.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 0 SDslu, 3003 SDs, 0 SdLazy, 165060 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 110.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 109.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 77 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 112.6s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 77 QuantifiedInterpolants, 1835920 SizeOfPredicates, 231 NumberOfNonLiveVariables, 22659 ConjunctsInSsa, 18482 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown