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-04 21:26:49,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:26:49,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:26:49,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:26:49,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:26:49,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:26:49,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:26:49,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:26:49,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:26:49,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:26:49,963 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:26:49,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:26:49,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:26:49,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:26:49,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:26:49,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:26:49,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:26:49,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:26:49,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:26:49,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:26:49,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:26:49,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:26:49,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:26:49,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:26:49,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:26:49,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:26:49,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:26:49,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:26:49,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:26:49,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:26:49,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:26:49,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:26:49,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:26:49,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:26:49,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:26:49,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:26:49,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:26:49,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:26:49,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:26:49,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:26:50,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:26:50,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:26:50,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:26:50,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:26:50,054 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:26:50,055 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:26:50,056 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-04 21:26:50,056 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-04 21:26:50,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:26:50,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:26:50,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:26:50,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:26:50,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:26:50,112 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,119 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:26:50,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:26:50,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:26:50,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:26:50,138 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,139 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,139 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,140 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,143 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,144 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,145 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 04.08 09:26:50" (1/1) ... [2019-08-04 21:26:50,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:26:50,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:26:50,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:26:50,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:26:50,148 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 04.08 09:26:50" (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-04 21:26:50,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:26:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:26:50,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:26:50,373 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:26:50,376 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:26:50,376 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:26:50,377 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:26:50 BoogieIcfgContainer [2019-08-04 21:26:50,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:26:50,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:26:50,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:26:50,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:26:50,382 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 04.08 09:26:50" (1/2) ... [2019-08-04 21:26:50,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d97c39 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:26:50, skipping insertion in model container [2019-08-04 21:26:50,383 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 04.08 09:26:50" (2/2) ... [2019-08-04 21:26:50,385 INFO L109 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:26:50,394 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:26:50,402 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:26:50,415 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:26:50,438 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:26:50,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:26:50,439 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:26:50,439 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:26:50,440 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:26:50,440 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:26:50,440 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:26:50,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:26:50,440 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:26:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:26:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:26:50,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:50,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:26:50,465 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:26:50,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:50,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:26:50,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:50,664 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-04 21:26:50,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:26:50,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:26:50,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:26:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:26:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:26:50,744 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:26:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:50,823 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-04 21:26:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:26:50,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:26:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:50,835 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:26:50,836 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:26:50,838 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-04 21:26:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:26:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-04 21:26:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:26:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-04 21:26:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-04 21:26:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:50,872 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-04 21:26:50,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:26:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-04 21:26:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:26:50,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:50,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:26:50,874 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2019-08-04 21:26:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:50,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:26:50,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:50,959 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-04 21:26:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:26:50,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:26:50,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:26:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:26:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:26:50,962 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-04 21:26:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:50,988 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-04 21:26:50,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:26:50,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-04 21:26:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:50,989 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:26:50,989 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:26:50,990 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-04 21:26:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:26:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:26:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:26:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-04 21:26:50,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-04 21:26:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:50,993 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-04 21:26:50,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:26:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-04 21:26:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:26:50,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:50,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:26:50,994 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2019-08-04 21:26:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:51,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:26:51,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,133 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-04 21:26:51,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:26:51,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:26:51,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:26:51,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:26:51,135 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-04 21:26:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:51,195 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-04 21:26:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:26:51,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-04 21:26:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:51,197 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:26:51,198 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:26:51,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:26:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:26:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:26:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:26:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-04 21:26:51,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-04 21:26:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:51,202 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-04 21:26:51,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:26:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-04 21:26:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:26:51,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:51,203 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-04 21:26:51,204 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2019-08-04 21:26:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:26:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,299 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-04 21:26:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:26:51,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:26:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:26:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:26:51,313 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-04 21:26:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:51,368 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-04 21:26:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:26:51,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-04 21:26:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:51,370 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:26:51,370 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:26:51,371 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-04 21:26:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:26:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-04 21:26:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:26:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-04 21:26:51,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-04 21:26:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:51,374 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-04 21:26:51,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:26:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-04 21:26:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:26:51,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:51,375 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-04 21:26:51,376 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:51,376 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2019-08-04 21:26:51,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:51,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:26:51,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,630 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-04 21:26:51,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:26:51,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:26:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:26:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:26:51,632 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2019-08-04 21:26:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:51,709 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-04 21:26:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:26:51,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-04 21:26:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:51,710 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:26:51,710 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:26:51,711 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-04 21:26:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:26:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:26:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:26:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-04 21:26:51,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2019-08-04 21:26:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:51,714 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-04 21:26:51,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:26:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-04 21:26:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:26:51,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:51,715 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-04 21:26:51,716 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2019-08-04 21:26:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:51,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:26:51,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,908 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-04 21:26:51,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:26:51,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:26:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:26:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:26:51,910 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2019-08-04 21:26:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:51,981 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-04 21:26:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:26:51,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-04 21:26:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:51,988 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:26:51,988 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:26:51,989 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-04 21:26:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:26:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:26:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:26:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-04 21:26:51,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-04 21:26:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:51,992 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-04 21:26:51,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:26:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-04 21:26:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:26:51,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:51,993 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-04 21:26:51,994 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2019-08-04 21:26:51,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:52,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:26:52,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:52,260 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-04 21:26:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:26:52,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:26:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:26:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:26:52,266 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-04 21:26:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:52,312 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-04 21:26:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:26:52,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-04 21:26:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:52,314 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:26:52,315 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:26:52,315 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-04 21:26:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:26:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:26:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:26:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-04 21:26:52,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-04 21:26:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:52,319 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-04 21:26:52,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:26:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-04 21:26:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:26:52,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:52,320 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-04 21:26:52,321 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 6 times [2019-08-04 21:26:52,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:52,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:26:52,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:52,516 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-04 21:26:52,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:52,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:26:52,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:26:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:26:52,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:26:52,520 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2019-08-04 21:26:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:52,708 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-04 21:26:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:26:52,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-04 21:26:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:52,709 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:26:52,709 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:26:52,710 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-04 21:26:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:26:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:26:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:26:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-04 21:26:52,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-08-04 21:26:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:52,714 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-04 21:26:52,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:26:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-04 21:26:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:26:52,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:52,715 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-04 21:26:52,715 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 7 times [2019-08-04 21:26:52,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:52,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:26:52,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:53,031 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-04 21:26:53,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:53,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:26:53,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:26:53,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:26:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:26:53,033 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-08-04 21:26:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:53,092 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-04 21:26:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:26:53,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-04 21:26:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:53,095 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:26:53,095 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:26:53,095 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-04 21:26:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:26:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:26:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:26:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-04 21:26:53,099 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-08-04 21:26:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:53,099 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-04 21:26:53,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:26:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-04 21:26:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:26:53,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:53,101 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2019-08-04 21:26:53,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1207878301, now seen corresponding path program 8 times [2019-08-04 21:26:53,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:53,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:26:53,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:53,318 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-04 21:26:53,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:53,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:26:53,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:26:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:26:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:26:53,320 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2019-08-04 21:26:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:53,403 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-08-04 21:26:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:26:53,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-04 21:26:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:53,405 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:26:53,405 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:26:53,406 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-04 21:26:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:26:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:26:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:26:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-04 21:26:53,410 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-04 21:26:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:53,410 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-04 21:26:53,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:26:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-04 21:26:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:26:53,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:53,411 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2019-08-04 21:26:53,412 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 207974103, now seen corresponding path program 9 times [2019-08-04 21:26:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:53,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:26:53,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:53,816 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-04 21:26:53,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:53,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:26:53,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:26:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:26:53,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:26:53,818 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2019-08-04 21:26:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:53,893 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-08-04 21:26:53,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:26:53,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-04 21:26:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:53,895 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:26:53,895 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:26:53,896 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-04 21:26:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:26:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:26:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:26:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-04 21:26:53,900 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2019-08-04 21:26:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:53,900 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-04 21:26:53,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:26:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-04 21:26:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:26:53,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:53,901 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2019-08-04 21:26:53,902 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:53,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 864577571, now seen corresponding path program 10 times [2019-08-04 21:26:53,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:53,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:26:53,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:54,170 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-04 21:26:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:26:54,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:26:54,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:26:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:26:54,172 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2019-08-04 21:26:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:54,225 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-04 21:26:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:26:54,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-04 21:26:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:54,226 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:26:54,226 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:26:54,227 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-04 21:26:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:26:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:26:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:26:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-04 21:26:54,230 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-04 21:26:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:54,231 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-04 21:26:54,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:26:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-04 21:26:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:26:54,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:54,233 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-04 21:26:54,233 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 595035287, now seen corresponding path program 11 times [2019-08-04 21:26:54,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:54,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:26:54,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:54,363 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-04 21:26:54,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:54,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:26:54,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:26:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:26:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:26:54,364 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-08-04 21:26:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:54,391 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-04 21:26:54,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:26:54,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-04 21:26:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:54,395 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:26:54,395 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:26:54,396 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-04 21:26:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:26:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-04 21:26:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:26:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-08-04 21:26:54,400 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-08-04 21:26:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:54,400 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-08-04 21:26:54,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:26:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-08-04 21:26:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:26:54,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:54,402 INFO L399 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2019-08-04 21:26:54,402 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 12 times [2019-08-04 21:26:54,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:54,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:26:54,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:54,594 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-04 21:26:54,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:26:54,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:26:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:26:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:26:54,596 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-08-04 21:26:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:54,624 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-04 21:26:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:26:54,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-08-04 21:26:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:54,627 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:26:54,627 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:26:54,628 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-04 21:26:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:26:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-08-04 21:26:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:26:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-04 21:26:54,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2019-08-04 21:26:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:54,635 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-04 21:26:54,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:26:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-04 21:26:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:26:54,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:54,636 INFO L399 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2019-08-04 21:26:54,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 13 times [2019-08-04 21:26:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:54,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:26:54,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:55,154 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-04 21:26:55,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:26:55,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:26:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:26:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:26:55,156 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2019-08-04 21:26:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:55,209 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-04 21:26:55,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:26:55,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-08-04 21:26:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:55,214 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:26:55,214 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:26:55,214 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-04 21:26:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:26:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-04 21:26:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:26:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-04 21:26:55,220 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2019-08-04 21:26:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:55,221 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-04 21:26:55,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:26:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-04 21:26:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:26:55,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:55,222 INFO L399 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2019-08-04 21:26:55,223 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 14 times [2019-08-04 21:26:55,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:55,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:26:55,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:55,445 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-04 21:26:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:26:55,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:26:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:26:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:26:55,447 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-08-04 21:26:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:55,499 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-04 21:26:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:26:55,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-08-04 21:26:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:55,507 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:26:55,508 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:26:55,508 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-04 21:26:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:26:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-08-04 21:26:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:26:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-08-04 21:26:55,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2019-08-04 21:26:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:55,519 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-08-04 21:26:55,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:26:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-08-04 21:26:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:26:55,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:55,520 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2019-08-04 21:26:55,520 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 15 times [2019-08-04 21:26:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:55,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:26:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:55,841 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-04 21:26:55,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:26:55,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:26:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:26:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:26:55,843 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2019-08-04 21:26:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:55,899 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-08-04 21:26:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:26:55,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-08-04 21:26:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:55,901 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:26:55,901 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:26:55,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:26:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:26:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-04 21:26:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-04 21:26:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-04 21:26:55,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2019-08-04 21:26:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:55,908 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-04 21:26:55,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:26:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-04 21:26:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-04 21:26:55,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:55,909 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2019-08-04 21:26:55,910 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 16 times [2019-08-04 21:26:55,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:55,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:26:55,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:56,314 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-04 21:26:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:56,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:26:56,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:26:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:26:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:26:56,315 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2019-08-04 21:26:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:56,612 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-08-04 21:26:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:26:56,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-08-04 21:26:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:56,613 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:26:56,613 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:26:56,614 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-04 21:26:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:26:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-04 21:26:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-04 21:26:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-08-04 21:26:56,618 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2019-08-04 21:26:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:56,619 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-08-04 21:26:56,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:26:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-08-04 21:26:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-04 21:26:56,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:56,621 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2019-08-04 21:26:56,621 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2019-08-04 21:26:56,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:56,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:26:56,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:57,373 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-04 21:26:57,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:57,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:26:57,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:26:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:26:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:26:57,374 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-08-04 21:26:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:57,414 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-04 21:26:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:26:57,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-08-04 21:26:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:57,417 INFO L225 Difference]: With dead ends: 123 [2019-08-04 21:26:57,417 INFO L226 Difference]: Without dead ends: 123 [2019-08-04 21:26:57,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:26:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-04 21:26:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-04 21:26:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:26:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-08-04 21:26:57,423 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2019-08-04 21:26:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:57,423 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-08-04 21:26:57,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:26:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-08-04 21:26:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-04 21:26:57,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:57,425 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2019-08-04 21:26:57,425 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2019-08-04 21:26:57,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:57,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:26:57,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:58,635 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-04 21:26:58,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:58,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:26:58,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:26:58,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:26:58,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:26:58,637 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2019-08-04 21:26:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:58,688 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-04 21:26:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:26:58,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-08-04 21:26:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:58,690 INFO L225 Difference]: With dead ends: 135 [2019-08-04 21:26:58,690 INFO L226 Difference]: Without dead ends: 135 [2019-08-04 21:26:58,690 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-04 21:26:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-04 21:26:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-04 21:26:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-04 21:26:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-08-04 21:26:58,695 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2019-08-04 21:26:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:58,696 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-08-04 21:26:58,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:26:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-08-04 21:26:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-04 21:26:58,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:58,698 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2019-08-04 21:26:58,698 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2019-08-04 21:26:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:58,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:26:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:04,807 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-04 21:27:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:27:04,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-04 21:27:04,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:27:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:27:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:27:04,816 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2019-08-04 21:27:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:06,039 INFO L93 Difference]: Finished difference Result 5117 states and 5577 transitions. [2019-08-04 21:27:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:27:06,047 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2019-08-04 21:27:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:06,048 INFO L225 Difference]: With dead ends: 5117 [2019-08-04 21:27:06,048 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:27:06,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:27:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:27:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:27:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:27:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:27:06,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2019-08-04 21:27:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:06,053 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:27:06,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:27:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:27:06,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:27:06,058 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:27:06 BoogieIcfgContainer [2019-08-04 21:27:06,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:27:06,061 INFO L168 Benchmark]: Toolchain (without parser) took 15963.46 ms. Allocated memory was 132.1 MB in the beginning and 361.8 MB in the end (delta: 229.6 MB). Free memory was 107.6 MB in the beginning and 92.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 244.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,062 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.99 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 105.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,063 INFO L168 Benchmark]: Boogie Preprocessor took 19.59 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,064 INFO L168 Benchmark]: RCFGBuilder took 230.00 ms. Allocated memory is still 132.1 MB. Free memory was 104.5 MB in the beginning and 94.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,065 INFO L168 Benchmark]: TraceAbstraction took 15679.83 ms. Allocated memory was 132.1 MB in the beginning and 361.8 MB in the end (delta: 229.6 MB). Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 231.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:06,068 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 108.8 MB in the beginning and 108.6 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 29.99 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 105.8 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.59 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 230.00 ms. Allocated memory is still 132.1 MB. Free memory was 104.5 MB in the beginning and 94.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15679.83 ms. Allocated memory was 132.1 MB in the beginning and 361.8 MB in the end (delta: 229.6 MB). Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 231.0 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.6s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 2.8s 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.0s 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.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.5s 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...