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/20181010-MemSafetyPathprograms/optional_data_creation_test04_true-valid-memsafety.i_32.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:00:33,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:00:33,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:00:33,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:00:33,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:00:33,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:00:33,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:00:33,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:00:33,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:00:33,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:00:33,275 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:00:33,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:00:33,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:00:33,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:00:33,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:00:33,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:00:33,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:00:33,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:00:33,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:00:33,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:00:33,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:00:33,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:00:33,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:00:33,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:00:33,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:00:33,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:00:33,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:00:33,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:00:33,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:00:33,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:00:33,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:00:33,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:00:33,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:00:33,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:00:33,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:00:33,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:00:33,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:00:33,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:00:33,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:00:33,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:00:33,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:00:33,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:00:33,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:00:33,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:00:33,361 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:00:33,362 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:00:33,362 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_true-valid-memsafety.i_32.bpl [2019-08-05 11:00:33,363 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_true-valid-memsafety.i_32.bpl' [2019-08-05 11:00:33,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:00:33,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:00:33,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:33,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:00:33,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:00:33,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:33,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:00:33,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:00:33,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:00:33,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/1) ... [2019-08-05 11:00:33,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:00:33,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:00:33,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:00:33,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:00:33,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (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:00:33,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:00:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:00:33,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:00:34,111 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:00:34,112 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:00:34,113 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:34 BoogieIcfgContainer [2019-08-05 11:00:34,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:00:34,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:00:34,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:00:34,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:00:34,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:33" (1/2) ... [2019-08-05 11:00:34,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b78854 and model type optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:00:34, skipping insertion in model container [2019-08-05 11:00:34,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:34" (2/2) ... [2019-08-05 11:00:34,124 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i_32.bpl [2019-08-05 11:00:34,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:00:34,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:00:34,161 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:00:34,191 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:00:34,191 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:00:34,192 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:00:34,192 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:00:34,192 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:00:34,192 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:00:34,192 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:00:34,192 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:00:34,193 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:00:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:00:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:00:34,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:34,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:00:34,215 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 11:00:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:34,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:00:34,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:34,412 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:00:34,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:34,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:00:34,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:00:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:00:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:34,439 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:00:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:34,479 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:00:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:00:34,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:00:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:34,492 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:00:34,492 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:00:34,494 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:00:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:00:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:00:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:00:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:00:34,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:00:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:34,528 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:00:34,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:00:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:00:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:00:34,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:34,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:00:34,530 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 11:00:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:34,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:00:34,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:34,744 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:00:34,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:00:34,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:00:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:00:34,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:00:34,747 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:00:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:34,837 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:00:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:00:34,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:00:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:34,838 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:00:34,838 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:00:34,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:00:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:00:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:00:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:00:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:00:34,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:00:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:34,842 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:00:34,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:00:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:00:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:00:34,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:34,843 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:00:34,843 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 11:00:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:34,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:00:34,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,032 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:00:35,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:00:35,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:00:35,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:00:35,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:35,035 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:00:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:35,083 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:00:35,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:00:35,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:00:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:35,084 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:00:35,084 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:00:35,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:00:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:00:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:00:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:00:35,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:00:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:35,087 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:00:35,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:00:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:00:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:00:35,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:35,088 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:00:35,089 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 11:00:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:35,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:00:35,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,263 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:00:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:00:35,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:00:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:00:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:00:35,265 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:00:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:35,319 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:00:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:00:35,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:00:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:35,320 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:00:35,320 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:00:35,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:00:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:00:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:00:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:00:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:00:35,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:00:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:00:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:00:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:00:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:00:35,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:35,325 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:00:35,325 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 11:00:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:35,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:00:35,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,668 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:00:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:35,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:00:35,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:00:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:00:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:35,670 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:00:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:35,796 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:00:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:00:35,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:00:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:35,800 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:00:35,800 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:00:35,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:35,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:00:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:00:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:00:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:00:35,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:00:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:35,804 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:00:35,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:00:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:00:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:00:35,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:35,805 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:00:35,805 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 11:00:35,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:00:35,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:36,017 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:00:36,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:36,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:00:36,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:00:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:00:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:36,020 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:00:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:36,085 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:00:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:00:36,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:00:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:36,086 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:00:36,086 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:00:36,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:00:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:00:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:00:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:00:36,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:00:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:36,090 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:00:36,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:00:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:00:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:00:36,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:36,091 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:00:36,091 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 11:00:36,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:36,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:00:36,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:36,398 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:00:36,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:36,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:00:36,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:00:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:00:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:00:36,401 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:00:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:36,446 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:00:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:00:36,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:00:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:36,447 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:00:36,447 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:00:36,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:00:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:00:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:00:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:00:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:00:36,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:00:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:36,450 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:00:36,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:00:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:00:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:00:36,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:36,451 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:00:36,451 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 11:00:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:36,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:00:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:36,681 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:00:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:36,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:00:36,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:00:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:00:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:00:36,684 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:00:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:36,745 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:00:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:00:36,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:00:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:36,747 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:00:36,747 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:00:36,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:00:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:00:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:00:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:00:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:00:36,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:00:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:36,752 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:00:36,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:00:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:00:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:00:36,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:36,753 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:00:36,753 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 11:00:36,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:36,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:00:36,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:37,329 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:00:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:00:37,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:00:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:00:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:37,330 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:00:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:37,376 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:00:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:00:37,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:00:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:37,378 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:00:37,379 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:00:37,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:00:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:00:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:00:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:00:37,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:00:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:37,381 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:00:37,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:00:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:00:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:00:37,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:37,382 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:00:37,382 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 11:00:37,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:37,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:00:37,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,169 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:00:38,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:38,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:00:38,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:00:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:00:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:00:38,171 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:00:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:38,213 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:00:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:00:38,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:00:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:38,214 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:00:38,215 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:00:38,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:00:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:00:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:00:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:00:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:00:38,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:00:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:38,219 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:00:38,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:00:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:00:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:00:38,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:38,219 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:00:38,220 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 11:00:38,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:38,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:00:38,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,554 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:00:38,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:38,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:00:38,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:00:38,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:00:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:38,556 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:00:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:38,591 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:00:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:00:38,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:00:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:38,592 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:00:38,592 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:00:38,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:00:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:00:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:00:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:00:38,595 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:00:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:38,595 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:00:38,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:00:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:00:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:00:38,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:38,596 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:00:38,596 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 11:00:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:38,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:00:38,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:39,514 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:00:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:00:39,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:00:39,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:00:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:00:39,517 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:00:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:39,564 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:00:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:00:39,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:00:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:39,566 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:00:39,566 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:00:39,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:00:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:00:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:00:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:00:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:00:39,570 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:00:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:39,570 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:00:39,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:00:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:00:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:00:39,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:39,571 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:00:39,572 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 11:00:39,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:39,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:00:39,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:39,904 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:00:39,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:00:39,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:00:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:00:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:39,906 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:00:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:39,939 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:00:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:00:39,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:00:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:39,941 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:00:39,941 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:00:39,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:00:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:00:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:00:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:00:39,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:00:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:39,945 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:00:39,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:00:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:00:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:00:39,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:39,946 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:00:39,946 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 11:00:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:39,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:00:39,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:40,254 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:00:40,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:40,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:00:40,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:00:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:00:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:00:40,256 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:00:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:40,296 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:00:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:00:40,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:00:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:40,298 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:00:40,298 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:00:40,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:00:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:00:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:00:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:00:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:00:40,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:00:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:40,303 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:00:40,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:00:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:00:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:00:40,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:40,304 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:00:40,304 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 11:00:40,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:40,825 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:00:40,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:00:40,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:00:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:00:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:40,828 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:00:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:41,100 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:00:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:00:41,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:00:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:41,101 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:00:41,101 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:00:41,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:00:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:00:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:00:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:00:41,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:00:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:41,105 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:00:41,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:00:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:00:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:00:41,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:41,105 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:00:41,106 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 11:00:41,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:41,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:00:41,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:41,391 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:00:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:41,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:00:41,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:00:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:00:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:00:41,394 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:00:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:41,666 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:00:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:00:41,666 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:00:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:41,667 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:00:41,667 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:00:41,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:00:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:00:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:00:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:00:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:00:41,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:00:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:41,672 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:00:41,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:00:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:00:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:00:41,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:41,673 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:00:41,673 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 11:00:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:41,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:00:41,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:42,063 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:00:42,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:00:42,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:00:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:00:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:42,065 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:00:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:42,119 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:00:42,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:00:42,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:00:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:42,121 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:00:42,121 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:00:42,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:00:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:00:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:00:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:00:42,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:00:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:42,125 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:00:42,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:00:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:00:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:00:42,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:42,125 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:00:42,126 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 11:00:42,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:42,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:00:42,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:42,487 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:00:42,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:42,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:00:42,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:00:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:00:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:42,489 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:00:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:42,539 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:00:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:00:42,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:00:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:42,542 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:00:42,542 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:00:42,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:00:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:00:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:00:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:00:42,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:00:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:42,549 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:00:42,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:00:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:00:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:00:42,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:42,551 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:00:42,551 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 11:00:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:42,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:00:42,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:42,948 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:00:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:00:42,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:00:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:00:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:42,949 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:00:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:42,994 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:00:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:00:42,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:00:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:42,995 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:00:42,995 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:00:42,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:00:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:00:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:00:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:00:43,001 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:00:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:43,001 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:00:43,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:00:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:00:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:00:43,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:43,002 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:00:43,002 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 11:00:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:43,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:00:43,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:43,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:43,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:00:43,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:00:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:00:43,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:00:43,668 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:00:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:43,709 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:00:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:00:43,709 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:00:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:43,710 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:00:43,710 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:00:43,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:00:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:00:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:00:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:00:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:00:43,714 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:00:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:43,715 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:00:43,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:00:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:00:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:00:43,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:43,716 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:00:43,716 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 11:00:43,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:43,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:00:43,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 11:00:43,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:00:43,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:00:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:00:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:43,965 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2019-08-05 11:00:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:43,980 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:00:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:00:43,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-08-05 11:00:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:43,981 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:00:43,981 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:00:43,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:00:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:00:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:00:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:00:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:00:43,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-08-05 11:00:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:43,982 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:00:43,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:00:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:00:43,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:00:43,988 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_true-valid-memsafety.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:00:43 BoogieIcfgContainer [2019-08-05 11:00:43,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:00:43,991 INFO L168 Benchmark]: Toolchain (without parser) took 10549.53 ms. Allocated memory was 137.9 MB in the beginning and 277.3 MB in the end (delta: 139.5 MB). Free memory was 110.8 MB in the beginning and 115.3 MB in the end (delta: -4.5 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,992 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.18 ms. Allocated memory is still 137.9 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,993 INFO L168 Benchmark]: Boogie Preprocessor took 51.46 ms. Allocated memory is still 137.9 MB. Free memory was 109.1 MB in the beginning and 107.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,994 INFO L168 Benchmark]: RCFGBuilder took 566.02 ms. Allocated memory is still 137.9 MB. Free memory was 107.4 MB in the beginning and 87.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,995 INFO L168 Benchmark]: TraceAbstraction took 9871.45 ms. Allocated memory was 137.9 MB in the beginning and 277.3 MB in the end (delta: 139.5 MB). Free memory was 87.0 MB in the beginning and 115.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:43,999 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 137.9 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.18 ms. Allocated memory is still 137.9 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.46 ms. Allocated memory is still 137.9 MB. Free memory was 109.1 MB in the beginning and 107.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 566.02 ms. Allocated memory is still 137.9 MB. Free memory was 107.4 MB in the beginning and 87.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9871.45 ms. Allocated memory was 137.9 MB in the beginning and 277.3 MB in the end (delta: 139.5 MB). Free memory was 87.0 MB in the beginning and 115.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 111.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 226]: 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, 9.8s OverallTime, 21 OverallIterations, 20 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 0 SDslu, 76 SDs, 0 SdLazy, 307 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 14574 SizeOfPredicates, 32 NumberOfNonLiveVariables, 10248 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 210/1540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...