java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/loopAcceleration/loopAccelerationFastUPR/OctagonTest_UpperAndLowerBounds.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:06,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:06,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:06,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:06,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:06,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:06,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:06,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:06,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:06,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:06,227 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:06,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:06,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:06,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:06,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:06,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:06,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:06,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:06,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:06,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:06,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:06,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:06,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:06,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:06,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:06,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:06,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:06,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:06,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:06,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:06,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:06,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:06,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:06,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:06,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:06,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:06,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:06,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:06,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:06,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:06,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:06,300 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:06,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:06,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:06,316 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:06,317 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:06,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationFastUPR/OctagonTest_UpperAndLowerBounds.bpl [2019-08-05 11:21:06,318 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationFastUPR/OctagonTest_UpperAndLowerBounds.bpl' [2019-08-05 11:21:06,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:06,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:06,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:06,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:06,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:06,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,384 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:06,384 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:06,384 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:06,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:06,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:06,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:06,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:06,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... [2019-08-05 11:21:06,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:06,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:06,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:06,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:06,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:21:06,478 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:06,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:06,705 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:06,706 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:21:06,707 INFO L202 PluginConnector]: Adding new model OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:06 BoogieIcfgContainer [2019-08-05 11:21:06,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:06,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:06,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:06,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:06,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:06" (1/2) ... [2019-08-05 11:21:06,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba8da6e and model type OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:06, skipping insertion in model container [2019-08-05 11:21:06,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:06" (2/2) ... [2019-08-05 11:21:06,716 INFO L109 eAbstractionObserver]: Analyzing ICFG OctagonTest_UpperAndLowerBounds.bpl [2019-08-05 11:21:06,726 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:06,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:06,753 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:06,785 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:06,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:06,786 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:06,786 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:06,787 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:06,787 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:06,787 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:06,787 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:06,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:21:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:21:06,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:21:06,823 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 11:21:06,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:07,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:07,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:07,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:07,034 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:21:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,077 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:21:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:07,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:21:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,090 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:21:07,090 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:21:07,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:21:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:21:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:21:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:21:07,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:21:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,132 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:21:07,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:21:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:21:07,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:21:07,138 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:21:07,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:07,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:21:07,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:07,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:07,261 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:21:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,328 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:21:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:07,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:21:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,330 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:21:07,330 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:21:07,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:21:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:21:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:21:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:21:07,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:21:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,334 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:21:07,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:21:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:07,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,336 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:21:07,336 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 11:21:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:07,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:21:07,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:07,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:07,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:07,609 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:21:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:07,764 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:21:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:07,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:21:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:07,765 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:21:07,766 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:21:07,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:21:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:21:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:21:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:21:07,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:21:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:07,769 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:21:07,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:21:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:21:07,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:07,770 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:21:07,770 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 11:21:07,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:07,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:21:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:07,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:21:07,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:07,931 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:21:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,197 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:21:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:21:08,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:21:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,203 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:21:08,203 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:21:08,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:21:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:21:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:21:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:21:08,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:21:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,206 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:21:08,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:21:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:21:08,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,207 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:21:08,207 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 11:21:08,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:21:08,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:08,368 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:21:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,601 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:21:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:08,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:21:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,603 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:21:08,603 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:21:08,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:21:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:21:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:21:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:21:08,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:21:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,611 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:21:08,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:21:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:21:08,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,613 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:21:08,613 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 11:21:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:08,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:21:08,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:08,744 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:21:09,136 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:21:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,182 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:21:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:21:09,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:21:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,183 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:21:09,184 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:21:09,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:21:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:21:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:21:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:21:09,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:21:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,189 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:21:09,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:21:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:21:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:21:09,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,190 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:21:09,190 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 11:21:09,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:21:09,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:21:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:21:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:09,342 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:21:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,502 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:21:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:09,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:21:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,503 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:21:09,503 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:21:09,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:21:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:21:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:21:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:21:09,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:21:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,507 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:21:09,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:21:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:21:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:09,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,508 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:21:09,508 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 11:21:09,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:09,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:09,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:21:09,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:21:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:21:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:21:09,647 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:21:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:09,932 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:21:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:21:09,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:21:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:09,933 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:21:09,933 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:21:09,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:21:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:21:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:21:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:21:09,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:21:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:09,937 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:21:09,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:21:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:21:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:21:09,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:09,938 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:21:09,938 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 11:21:09,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:09,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:21:09,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:21:10,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:21:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:21:10,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:21:10,135 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:21:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,296 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:21:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:21:10,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:21:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,298 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:21:10,298 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:21:10,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:21:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:21:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:21:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:21:10,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:21:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,302 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:21:10,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:21:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:21:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:21:10,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,302 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:21:10,303 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 11:21:10,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:21:10,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:21:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:21:10,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:21:10,441 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:21:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,631 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:21:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:21:10,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:21:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,633 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:21:10,633 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:21:10,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:21:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:21:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:21:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:21:10,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:21:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,638 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:21:10,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:21:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:21:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:21:10,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,639 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:21:10,639 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 11:21:10,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:10,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:21:10,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:21:10,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:21:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:21:10,777 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:21:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,017 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:21:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:21:11,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:21:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,019 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:21:11,019 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:21:11,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:21:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:21:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:21:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:21:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:21:11,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:21:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,024 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:21:11,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:21:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:21:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:21:11,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,025 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:21:11,025 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 11:21:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:21:11,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:21:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:21:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:21:11,182 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:21:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,502 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:21:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:21:11,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:21:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,503 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:21:11,504 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:21:11,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:21:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:21:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:21:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:21:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:21:11,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:21:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,507 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:21:11,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:21:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:21:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:21:11,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,508 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:21:11,509 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 11:21:11,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:21:11,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:21:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:21:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:11,679 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:21:12,119 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:21:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,135 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:21:12,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:12,135 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:21:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,136 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:21:12,136 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:21:12,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:21:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:21:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:21:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:21:12,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:21:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,141 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:21:12,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:21:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:21:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:12,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,142 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:21:12,142 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 11:21:12,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:12,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:21:12,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:21:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:21:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:21:12,458 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:21:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,709 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:21:12,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:21:12,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:21:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,710 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:21:12,710 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:21:12,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:21:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:21:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:21:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:21:12,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:21:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,715 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:21:12,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:21:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:21:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:21:12,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,716 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:21:12,716 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 11:21:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:12,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:21:12,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:21:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:21:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:21:12,943 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:21:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,429 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:21:13,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:21:13,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:21:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,432 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:21:13,433 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:21:13,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:21:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:21:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:21:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:21:13,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:21:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,438 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:21:13,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:21:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:21:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:21:13,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,440 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:21:13,440 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 11:21:13,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:21:13,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:21:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:21:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:21:13,784 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:21:13,977 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:21:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,344 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:21:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:21:14,345 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:21:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,346 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:21:14,346 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:21:14,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:21:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:21:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:21:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:21:14,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:21:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,350 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:21:14,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:21:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:21:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:21:14,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,351 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:21:14,352 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 11:21:14,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:21:14,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:21:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:21:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:21:14,558 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:21:14,684 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:21:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,001 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:21:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:21:15,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:21:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,003 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:21:15,003 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:21:15,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:21:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:21:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:21:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:21:15,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:21:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,006 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:21:15,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:21:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:21:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:21:15,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,007 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:21:15,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 11:21:15,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:21:15,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:21:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:21:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:21:15,335 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:21:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,715 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:21:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:21:15,715 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:21:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,716 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:21:15,717 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:21:15,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:21:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:21:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:21:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:21:15,722 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:21:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,722 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:21:15,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:21:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:21:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:21:15,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,723 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:21:15,723 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 11:21:15,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:15,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:21:15,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:21:15,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:21:15,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:21:15,975 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:21:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,289 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:21:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:21:16,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:21:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,290 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:21:16,290 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:21:16,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:21:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:21:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:21:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:21:16,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:21:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,295 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:21:16,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:21:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:21:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:21:16,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:16,296 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:21:16,296 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 11:21:16,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:16,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:21:16,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:16,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:16,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-08-05 11:21:16,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:21:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:21:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:16,795 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:21:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:16,871 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-08-05 11:21:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:21:16,872 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:21:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:16,873 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:21:16,873 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:21:16,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:21:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:21:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:21:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:21:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:21:16,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-08-05 11:21:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:16,875 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:21:16,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:21:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:21:16,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:21:16,880 INFO L202 PluginConnector]: Adding new model OctagonTest_UpperAndLowerBounds.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:16 BoogieIcfgContainer [2019-08-05 11:21:16,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:16,882 INFO L168 Benchmark]: Toolchain (without parser) took 10530.96 ms. Allocated memory was 140.5 MB in the beginning and 289.9 MB in the end (delta: 149.4 MB). Free memory was 110.1 MB in the beginning and 132.0 MB in the end (delta: -21.9 MB). Peak memory consumption was 127.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:16,882 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:21:16,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.78 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:16,884 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:16,885 INFO L168 Benchmark]: RCFGBuilder took 295.81 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 98.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:16,886 INFO L168 Benchmark]: TraceAbstraction took 10171.26 ms. Allocated memory was 140.5 MB in the beginning and 289.9 MB in the end (delta: 149.4 MB). Free memory was 97.6 MB in the beginning and 132.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:16,889 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.23 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.78 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.69 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 909.9 kB). Peak memory consumption was 909.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 295.81 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 98.0 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10171.26 ms. Allocated memory was 140.5 MB in the beginning and 289.9 MB in the end (delta: 149.4 MB). Free memory was 97.6 MB in the beginning and 132.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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, 5 locations, 1 error locations. SAFE Result, 10.1s OverallTime, 20 OverallIterations, 19 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 7 SDslu, 0 SDs, 0 SdLazy, 419 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=19, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 10496 SizeOfPredicates, 19 NumberOfNonLiveVariables, 880 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 190/1330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...