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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:44:52,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:44:52,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:44:52,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:44:52,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:44:52,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:44:52,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:44:52,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:44:52,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:44:52,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:44:52,847 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:44:52,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:44:52,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:44:52,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:44:52,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:44:52,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:44:52,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:44:52,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:44:52,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:44:52,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:44:52,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:44:52,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:44:52,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:44:52,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:44:52,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:44:52,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:44:52,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:44:52,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:44:52,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:44:52,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:44:52,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:44:52,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:44:52,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:44:52,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:44:52,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:44:52,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:44:52,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:44:52,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:44:52,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:44:52,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:44:52,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:44:52,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:44:52,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:44:52,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:44:52,919 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:44:52,920 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:44:52,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:44:52,921 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:44:52,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:44:52,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:44:52,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:52,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:44:52,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:44:52,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:52,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:52,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:52,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:44:52,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:44:52,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:44:53,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/1) ... [2019-08-05 10:44:53,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:44:53,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:44:53,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:44:53,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:44:53,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (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:44:53,080 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:44:53,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:44:53,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:44:53,313 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:44:53,315 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:44:53,316 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:44:53,317 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:53 BoogieIcfgContainer [2019-08-05 10:44:53,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:44:53,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:44:53,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:44:53,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:44:53,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:52" (1/2) ... [2019-08-05 10:44:53,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e23ad60 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:44:53, skipping insertion in model container [2019-08-05 10:44:53,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:53" (2/2) ... [2019-08-05 10:44:53,326 INFO L109 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:44:53,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:44:53,344 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:44:53,361 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:44:53,389 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:44:53,390 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:44:53,390 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:44:53,390 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:44:53,390 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:44:53,390 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:44:53,391 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:44:53,391 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:44:53,391 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:44:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:44:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:44:53,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:44:53,419 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:44:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,633 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:44:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:44:53,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:44:53,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:44:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:44:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:44:53,674 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:44:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,776 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:44:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:44:53,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:44:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,789 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:44:53,789 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:44:53,791 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:44:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:44:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:44:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:44:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:44:53,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:44:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,827 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:44:53,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:44:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:44:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:44:53,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:44:53,828 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2019-08-05 10:44:53,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:44:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:44:53,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:44:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:44:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:53,950 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:44:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,980 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:44:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:44:53,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:44:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,981 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:44:53,981 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:44:53,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:44:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:44:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:44:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:44:53,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:44:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,986 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:44:53,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:44:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:44:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:44:53,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:44:53,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2019-08-05 10:44:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:54,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:44:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:44:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:54,122 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 10:44:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,160 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:44:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:44:54,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:44:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,162 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:44:54,162 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:44:54,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:44:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:44:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:44:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:44:54,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:44:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,165 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:44:54,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:44:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:44:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:44:54,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,167 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:44:54,167 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2019-08-05 10:44:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:44:54,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:44:54,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:44:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:44:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:54,273 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 10:44:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,316 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 10:44:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:44:54,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:44:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,317 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:44:54,317 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:54,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:44:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:44:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:44:54,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-05 10:44:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,323 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:44:54,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:44:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:44:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:54,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,325 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 10:44:54,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2019-08-05 10:44:54,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:44:54,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:54,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:54,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:54,642 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2019-08-05 10:44:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,718 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 10:44:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:54,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:44:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,720 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:44:54,720 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:44:54,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:44:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:44:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:44:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 10:44:54,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2019-08-05 10:44:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,724 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 10:44:54,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 10:44:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:54,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,725 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 10:44:54,726 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2019-08-05 10:44:54,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:44:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:54,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:54,936 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2019-08-05 10:44:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,985 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 10:44:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:54,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:44:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,987 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:44:54,987 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:44:54,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:44:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:44:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 10:44:54,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-05 10:44:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,991 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 10:44:54,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 10:44:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:54,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,993 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 10:44:54,993 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2019-08-05 10:44:54,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:55,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:44:55,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:44:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:55,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:55,291 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-05 10:44:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:55,349 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 10:44:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:55,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:44:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:55,352 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:44:55,353 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:55,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:44:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 10:44:55,357 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-05 10:44:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:55,357 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 10:44:55,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 10:44:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:55,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:55,358 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-05 10:44:55,358 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:55,359 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 6 times [2019-08-05 10:44:55,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:55,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:44:55,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 10:44:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:55,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:55,576 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2019-08-05 10:44:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:55,739 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 10:44:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:55,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-05 10:44:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:55,740 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:44:55,741 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:44:55,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:44:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:44:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 10:44:55,745 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-08-05 10:44:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:55,745 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 10:44:55,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 10:44:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:44:55,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:55,746 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-05 10:44:55,747 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 7 times [2019-08-05 10:44:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:55,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:44:55,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 10:44:56,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:56,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:56,107 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-08-05 10:44:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,224 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 10:44:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:56,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-05 10:44:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,226 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:56,226 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:44:56,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:44:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:44:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 10:44:56,231 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-08-05 10:44:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,231 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 10:44:56,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 10:44:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:44:56,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,233 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2019-08-05 10:44:56,233 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1207878301, now seen corresponding path program 8 times [2019-08-05 10:44:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:44:56,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:56,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:56,447 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2019-08-05 10:44:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,517 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-08-05 10:44:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:56,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-05 10:44:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,519 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:44:56,527 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:56,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:44:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 10:44:56,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-05 10:44:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,532 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 10:44:56,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 10:44:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:44:56,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,533 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2019-08-05 10:44:56,533 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash 207974103, now seen corresponding path program 9 times [2019-08-05 10:44:56,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 10:44:56,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:56,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:56,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:56,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:56,933 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2019-08-05 10:44:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,993 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-08-05 10:44:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:56,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-05 10:44:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,995 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:44:56,995 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:44:56,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:44:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:44:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 10:44:57,000 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2019-08-05 10:44:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,000 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 10:44:57,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 10:44:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:44:57,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,001 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2019-08-05 10:44:57,002 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 864577571, now seen corresponding path program 10 times [2019-08-05 10:44:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 10:44:57,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:57,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:57,255 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2019-08-05 10:44:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,306 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 10:44:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:57,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-05 10:44:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,307 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:57,307 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:44:57,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:44:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:44:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 10:44:57,313 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-05 10:44:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,313 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 10:44:57,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 10:44:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:44:57,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,315 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-05 10:44:57,315 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash 595035287, now seen corresponding path program 11 times [2019-08-05 10:44:57,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 10:44:57,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:57,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:44:57,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:44:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:57,423 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-08-05 10:44:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,452 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:44:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:44:57,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 10:44:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,456 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:44:57,456 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:57,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:44:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:44:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-08-05 10:44:57,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-08-05 10:44:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,461 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-08-05 10:44:57,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:44:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-08-05 10:44:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:44:57,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,462 INFO L399 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2019-08-05 10:44:57,463 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 12 times [2019-08-05 10:44:57,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:44:57,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:57,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:57,667 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-08-05 10:44:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,691 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:44:57,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:57,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-08-05 10:44:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,694 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:44:57,694 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:44:57,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:44:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-08-05 10:44:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:44:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-05 10:44:57,704 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2019-08-05 10:44:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,704 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-05 10:44:57,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-05 10:44:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:44:57,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,706 INFO L399 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2019-08-05 10:44:57,706 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 13 times [2019-08-05 10:44:57,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-08-05 10:44:58,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:58,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:58,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:58,236 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2019-08-05 10:44:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,287 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-05 10:44:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:58,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-08-05 10:44:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,294 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:44:58,294 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:44:58,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:44:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-05 10:44:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:44:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-05 10:44:58,305 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2019-08-05 10:44:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,305 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-05 10:44:58,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-05 10:44:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:44:58,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,307 INFO L399 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2019-08-05 10:44:58,308 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 14 times [2019-08-05 10:44:58,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-08-05 10:44:58,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:58,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:58,520 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-08-05 10:44:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,562 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-05 10:44:58,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:58,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-08-05 10:44:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,569 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:44:58,570 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:44:58,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:44:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-08-05 10:44:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:44:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-08-05 10:44:58,575 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2019-08-05 10:44:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,576 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-08-05 10:44:58,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-08-05 10:44:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:44:58,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,578 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2019-08-05 10:44:58,578 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 15 times [2019-08-05 10:44:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-08-05 10:44:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:58,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:58,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:58,835 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2019-08-05 10:44:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,888 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-08-05 10:44:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:58,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-08-05 10:44:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,891 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:44:58,891 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:44:58,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:44:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-05 10:44:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:44:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-05 10:44:58,897 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2019-08-05 10:44:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,897 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-05 10:44:58,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-05 10:44:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:44:58,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,899 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2019-08-05 10:44:58,899 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 16 times [2019-08-05 10:44:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 10:44:59,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:59,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:59,332 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2019-08-05 10:44:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,607 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-08-05 10:44:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:59,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-08-05 10:44:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,612 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:44:59,612 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:44:59,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:44:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-05 10:44:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:44:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-08-05 10:44:59,618 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2019-08-05 10:44:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,619 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-08-05 10:44:59,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-08-05 10:44:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:44:59,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,621 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2019-08-05 10:44:59,621 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2019-08-05 10:44:59,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-08-05 10:45:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:45:00,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:45:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:45:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:00,485 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-08-05 10:45:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,577 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:45:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:45:00,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-08-05 10:45:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,579 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:45:00,579 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:45:00,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:45:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:45:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-05 10:45:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:45:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-08-05 10:45:00,584 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2019-08-05 10:45:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,585 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-08-05 10:45:00,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:45:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-08-05 10:45:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:45:00,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,587 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2019-08-05 10:45:00,587 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2019-08-05 10:45:00,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-08-05 10:45:01,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:01,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:45:01,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:45:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:45:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:01,749 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2019-08-05 10:45:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,821 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:45:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:45:01,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-08-05 10:45:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,828 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:45:01,828 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:45:01,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:45:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:45:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-05 10:45:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:45:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-08-05 10:45:01,834 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2019-08-05 10:45:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,835 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-08-05 10:45:01,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:45:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-08-05 10:45:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:45:01,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,836 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2019-08-05 10:45:01,837 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2019-08-05 10:45:01,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 10:45:07,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:45:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-05 10:45:07,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:45:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:45:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:45:07,887 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2019-08-05 10:45:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,168 INFO L93 Difference]: Finished difference Result 5117 states and 5577 transitions. [2019-08-05 10:45:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:45:09,168 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2019-08-05 10:45:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,169 INFO L225 Difference]: With dead ends: 5117 [2019-08-05 10:45:09,169 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:45:09,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:45:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:45:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:45:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:45:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:45:09,173 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2019-08-05 10:45:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,173 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:45:09,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:45:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:45:09,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:45:09,179 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:45:09 BoogieIcfgContainer [2019-08-05 10:45:09,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:45:09,183 INFO L168 Benchmark]: Toolchain (without parser) took 16218.71 ms. Allocated memory was 141.0 MB in the beginning and 362.8 MB in the end (delta: 221.8 MB). Free memory was 109.4 MB in the beginning and 172.7 MB in the end (delta: -63.3 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:45:09,184 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 110.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:45:09,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 141.0 MB. Free memory was 109.2 MB in the beginning and 107.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:45:09,185 INFO L168 Benchmark]: Boogie Preprocessor took 19.03 ms. Allocated memory is still 141.0 MB. Free memory was 107.6 MB in the beginning and 106.4 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:45:09,186 INFO L168 Benchmark]: RCFGBuilder took 299.89 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 96.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:45:09,187 INFO L168 Benchmark]: TraceAbstraction took 15860.82 ms. Allocated memory was 141.0 MB in the beginning and 362.8 MB in the end (delta: 221.8 MB). Free memory was 96.1 MB in the beginning and 172.7 MB in the end (delta: -76.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:45:09,191 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.0 MB. Free memory was 110.7 MB in the beginning and 110.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 141.0 MB. Free memory was 109.2 MB in the beginning and 107.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.03 ms. Allocated memory is still 141.0 MB. Free memory was 107.6 MB in the beginning and 106.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 299.89 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 96.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15860.82 ms. Allocated memory was 141.0 MB in the beginning and 362.8 MB in the end (delta: 221.8 MB). Free memory was 96.1 MB in the beginning and 172.7 MB in the end (delta: -76.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 15.7s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 324 SDslu, 410 SDs, 0 SdLazy, 538 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=20, 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, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 351359 SizeOfPredicates, 40 NumberOfNonLiveVariables, 4160 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 9043/23893 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...