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/random/RanFile058.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:04:23,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:04:23,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:04:23,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:04:23,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:04:23,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:04:23,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:04:23,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:04:23,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:04:23,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:04:23,443 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:04:23,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:04:23,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:04:23,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:04:23,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:04:23,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:04:23,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:04:23,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:04:23,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:04:23,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:04:23,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:04:23,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:04:23,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:04:23,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:04:23,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:04:23,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:04:23,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:04:23,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:04:23,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:04:23,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:04:23,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:04:23,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:04:23,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:04:23,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:04:23,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:04:23,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:04:23,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:04:23,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:04:23,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:04:23,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:04:23,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:04:23,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:04:23,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:04:23,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:04:23,565 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:04:23,566 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:04:23,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile058.bpl [2019-08-05 10:04:23,567 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile058.bpl' [2019-08-05 10:04:23,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:04:23,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:04:23,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:23,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:04:23,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:04:23,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,690 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:04:23,690 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:04:23,690 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:04:23,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:23,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:04:23,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:04:23,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:04:23,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... [2019-08-05 10:04:23,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:04:23,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:04:23,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:04:23,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:04:23,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:04:23,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:04:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:04:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:04:26,945 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:04:26,946 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:04:26,947 INFO L202 PluginConnector]: Adding new model RanFile058.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:26 BoogieIcfgContainer [2019-08-05 10:04:26,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:04:26,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:04:26,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:04:26,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:04:26,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:23" (1/2) ... [2019-08-05 10:04:26,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca9d91b and model type RanFile058.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:04:26, skipping insertion in model container [2019-08-05 10:04:26,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile058.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:26" (2/2) ... [2019-08-05 10:04:26,956 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile058.bpl [2019-08-05 10:04:26,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:04:26,973 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:04:26,991 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:04:27,018 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:04:27,018 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:04:27,019 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:04:27,019 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:04:27,019 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:04:27,019 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:04:27,021 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:04:27,022 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:04:27,022 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:04:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-08-05 10:04:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:27,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,055 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1295176043, now seen corresponding path program 1 times [2019-08-05 10:04:27,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:27,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:27,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,329 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 3 states. [2019-08-05 10:04:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,909 INFO L93 Difference]: Finished difference Result 138 states and 248 transitions. [2019-08-05 10:04:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:27,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:04:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,926 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:04:27,926 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:04:27,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:04:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-08-05 10:04:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:04:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 212 transitions. [2019-08-05 10:04:27,972 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 212 transitions. Word has length 27 [2019-08-05 10:04:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,972 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 212 transitions. [2019-08-05 10:04:27,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 212 transitions. [2019-08-05 10:04:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:27,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,975 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1785862284, now seen corresponding path program 1 times [2019-08-05 10:04:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:28,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:28,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:04:28,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:28,026 INFO L87 Difference]: Start difference. First operand 115 states and 212 transitions. Second operand 3 states. [2019-08-05 10:04:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:28,531 INFO L93 Difference]: Finished difference Result 134 states and 243 transitions. [2019-08-05 10:04:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:28,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:28,536 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:04:28,536 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:04:28,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:04:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-08-05 10:04:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:04:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 235 transitions. [2019-08-05 10:04:28,550 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 235 transitions. Word has length 28 [2019-08-05 10:04:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:28,550 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 235 transitions. [2019-08-05 10:04:28,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 235 transitions. [2019-08-05 10:04:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:28,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:28,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:28,553 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1389332965, now seen corresponding path program 1 times [2019-08-05 10:04:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:28,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:28,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:28,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:28,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:28,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:28,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:28,645 INFO L87 Difference]: Start difference. First operand 130 states and 235 transitions. Second operand 3 states. [2019-08-05 10:04:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:28,913 INFO L93 Difference]: Finished difference Result 145 states and 259 transitions. [2019-08-05 10:04:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:28,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-08-05 10:04:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:28,916 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:04:28,917 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:04:28,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:04:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-08-05 10:04:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:04:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2019-08-05 10:04:28,929 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 29 [2019-08-05 10:04:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:28,930 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2019-08-05 10:04:28,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2019-08-05 10:04:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:28,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:28,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:28,932 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1428668418, now seen corresponding path program 1 times [2019-08-05 10:04:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:28,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:04:28,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:30,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:30,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:04:30,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:30,018 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand 11 states. [2019-08-05 10:04:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:32,301 INFO L93 Difference]: Finished difference Result 259 states and 428 transitions. [2019-08-05 10:04:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:32,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-08-05 10:04:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:32,305 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:04:32,306 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 10:04:32,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 10:04:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 174. [2019-08-05 10:04:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:04:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 306 transitions. [2019-08-05 10:04:32,321 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 306 transitions. Word has length 30 [2019-08-05 10:04:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:32,321 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 306 transitions. [2019-08-05 10:04:32,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 306 transitions. [2019-08-05 10:04:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:32,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:32,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:32,324 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 245528743, now seen corresponding path program 1 times [2019-08-05 10:04:32,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:32,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:32,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:32,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:32,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:32,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:32,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:32,995 INFO L87 Difference]: Start difference. First operand 174 states and 306 transitions. Second operand 10 states. [2019-08-05 10:04:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,695 INFO L93 Difference]: Finished difference Result 308 states and 547 transitions. [2019-08-05 10:04:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:34,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-08-05 10:04:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,699 INFO L225 Difference]: With dead ends: 308 [2019-08-05 10:04:34,700 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 10:04:34,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 10:04:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 193. [2019-08-05 10:04:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:04:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 340 transitions. [2019-08-05 10:04:34,713 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 340 transitions. Word has length 30 [2019-08-05 10:04:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,713 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 340 transitions. [2019-08-05 10:04:34,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 340 transitions. [2019-08-05 10:04:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:34,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:34,716 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 419463848, now seen corresponding path program 1 times [2019-08-05 10:04:34,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:35,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:35,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:35,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:35,361 INFO L87 Difference]: Start difference. First operand 193 states and 340 transitions. Second operand 7 states. [2019-08-05 10:04:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:42,184 INFO L93 Difference]: Finished difference Result 226 states and 395 transitions. [2019-08-05 10:04:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:42,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 10:04:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:42,188 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:04:42,188 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 10:04:42,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 10:04:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 201. [2019-08-05 10:04:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:04:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 354 transitions. [2019-08-05 10:04:42,197 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 354 transitions. Word has length 31 [2019-08-05 10:04:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:42,198 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 354 transitions. [2019-08-05 10:04:42,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 354 transitions. [2019-08-05 10:04:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:42,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:42,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:42,201 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash -925416240, now seen corresponding path program 1 times [2019-08-05 10:04:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:42,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:42,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:42,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:42,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:42,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:42,486 INFO L87 Difference]: Start difference. First operand 201 states and 354 transitions. Second operand 7 states. [2019-08-05 10:04:45,590 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:04:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:45,825 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2019-08-05 10:04:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:45,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 10:04:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:45,828 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:04:45,829 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:04:45,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:04:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 203. [2019-08-05 10:04:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:04:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 358 transitions. [2019-08-05 10:04:45,836 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 358 transitions. Word has length 31 [2019-08-05 10:04:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:45,837 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 358 transitions. [2019-08-05 10:04:45,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 358 transitions. [2019-08-05 10:04:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:45,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:45,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:45,840 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:45,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1114712465, now seen corresponding path program 1 times [2019-08-05 10:04:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:45,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:04:45,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:46,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,395 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-08-05 10:04:46,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:04:46,799 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-08-05 10:04:46,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:46,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:48,033 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 10:04:48,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:04:48,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:48,072 INFO L87 Difference]: Start difference. First operand 203 states and 358 transitions. Second operand 12 states. [2019-08-05 10:04:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:52,300 INFO L93 Difference]: Finished difference Result 314 states and 554 transitions. [2019-08-05 10:04:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:52,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 10:04:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:52,304 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:04:52,304 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:04:52,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:04:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 221. [2019-08-05 10:04:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:04:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 389 transitions. [2019-08-05 10:04:52,312 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 389 transitions. Word has length 31 [2019-08-05 10:04:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:52,312 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 389 transitions. [2019-08-05 10:04:52,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 389 transitions. [2019-08-05 10:04:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:52,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:52,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:52,314 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash 142025543, now seen corresponding path program 1 times [2019-08-05 10:04:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:52,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:52,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:52,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:52,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:52,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:52,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:52,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:04:52,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:52,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:52,553 INFO L87 Difference]: Start difference. First operand 221 states and 389 transitions. Second operand 10 states. [2019-08-05 10:04:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:54,877 INFO L93 Difference]: Finished difference Result 488 states and 846 transitions. [2019-08-05 10:04:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:04:54,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-08-05 10:04:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:54,883 INFO L225 Difference]: With dead ends: 488 [2019-08-05 10:04:54,883 INFO L226 Difference]: Without dead ends: 483 [2019-08-05 10:04:54,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-08-05 10:04:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 279. [2019-08-05 10:04:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-08-05 10:04:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 499 transitions. [2019-08-05 10:04:54,893 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 499 transitions. Word has length 31 [2019-08-05 10:04:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:54,893 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 499 transitions. [2019-08-05 10:04:54,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 499 transitions. [2019-08-05 10:04:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:54,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:54,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:54,895 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 118535603, now seen corresponding path program 1 times [2019-08-05 10:04:54,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:54,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:54,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:55,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:55,034 INFO L87 Difference]: Start difference. First operand 279 states and 499 transitions. Second operand 6 states. [2019-08-05 10:04:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:56,992 INFO L93 Difference]: Finished difference Result 317 states and 558 transitions. [2019-08-05 10:04:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:56,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-08-05 10:04:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:57,000 INFO L225 Difference]: With dead ends: 317 [2019-08-05 10:04:57,000 INFO L226 Difference]: Without dead ends: 317 [2019-08-05 10:04:57,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-08-05 10:04:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2019-08-05 10:04:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-05 10:04:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 499 transitions. [2019-08-05 10:04:57,009 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 499 transitions. Word has length 32 [2019-08-05 10:04:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:57,009 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 499 transitions. [2019-08-05 10:04:57,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 499 transitions. [2019-08-05 10:04:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:57,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:57,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:57,013 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1376925835, now seen corresponding path program 1 times [2019-08-05 10:04:57,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:57,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:57,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:57,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:57,170 INFO L87 Difference]: Start difference. First operand 278 states and 499 transitions. Second operand 6 states. [2019-08-05 10:04:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,400 INFO L93 Difference]: Finished difference Result 346 states and 602 transitions. [2019-08-05 10:04:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:58,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-08-05 10:04:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,405 INFO L225 Difference]: With dead ends: 346 [2019-08-05 10:04:58,405 INFO L226 Difference]: Without dead ends: 345 [2019-08-05 10:04:58,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-08-05 10:04:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 283. [2019-08-05 10:04:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-08-05 10:04:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 506 transitions. [2019-08-05 10:04:58,418 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 506 transitions. Word has length 32 [2019-08-05 10:04:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:58,419 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 506 transitions. [2019-08-05 10:04:58,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 506 transitions. [2019-08-05 10:04:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:58,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:58,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:58,422 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1461053398, now seen corresponding path program 1 times [2019-08-05 10:04:58,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:58,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:04:58,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:59,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:59,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:59,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:59,524 INFO L87 Difference]: Start difference. First operand 283 states and 506 transitions. Second operand 13 states. [2019-08-05 10:05:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:01,405 INFO L93 Difference]: Finished difference Result 371 states and 632 transitions. [2019-08-05 10:05:01,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:01,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-08-05 10:05:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:01,411 INFO L225 Difference]: With dead ends: 371 [2019-08-05 10:05:01,411 INFO L226 Difference]: Without dead ends: 369 [2019-08-05 10:05:01,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-08-05 10:05:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 288. [2019-08-05 10:05:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-05 10:05:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 512 transitions. [2019-08-05 10:05:01,419 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 512 transitions. Word has length 32 [2019-08-05 10:05:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:01,420 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 512 transitions. [2019-08-05 10:05:01,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 512 transitions. [2019-08-05 10:05:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:05:01,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:01,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:01,421 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 468946496, now seen corresponding path program 1 times [2019-08-05 10:05:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:01,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:01,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:02,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:02,022 INFO L87 Difference]: Start difference. First operand 288 states and 512 transitions. Second operand 7 states. [2019-08-05 10:05:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:03,464 INFO L93 Difference]: Finished difference Result 342 states and 610 transitions. [2019-08-05 10:05:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:03,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-08-05 10:05:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:03,467 INFO L225 Difference]: With dead ends: 342 [2019-08-05 10:05:03,468 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 10:05:03,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 10:05:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 323. [2019-08-05 10:05:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-08-05 10:05:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 578 transitions. [2019-08-05 10:05:03,475 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 578 transitions. Word has length 32 [2019-08-05 10:05:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:03,475 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 578 transitions. [2019-08-05 10:05:03,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 578 transitions. [2019-08-05 10:05:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:05:03,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:03,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:03,477 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:03,478 INFO L82 PathProgramCache]: Analyzing trace with hash 320494798, now seen corresponding path program 1 times [2019-08-05 10:05:03,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:03,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:03,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:03,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:03,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:03,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:03,630 INFO L87 Difference]: Start difference. First operand 323 states and 578 transitions. Second operand 7 states. [2019-08-05 10:05:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:05,825 INFO L93 Difference]: Finished difference Result 408 states and 722 transitions. [2019-08-05 10:05:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:05,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-08-05 10:05:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:05,829 INFO L225 Difference]: With dead ends: 408 [2019-08-05 10:05:05,829 INFO L226 Difference]: Without dead ends: 408 [2019-08-05 10:05:05,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-08-05 10:05:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 334. [2019-08-05 10:05:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-08-05 10:05:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 598 transitions. [2019-08-05 10:05:05,837 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 598 transitions. Word has length 32 [2019-08-05 10:05:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:05,838 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 598 transitions. [2019-08-05 10:05:05,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 598 transitions. [2019-08-05 10:05:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:05:05,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:05,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:05,840 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1316917149, now seen corresponding path program 1 times [2019-08-05 10:05:05,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:05,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:05:05,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:05,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:05:05,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:05:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:05:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:05:05,911 INFO L87 Difference]: Start difference. First operand 334 states and 598 transitions. Second operand 4 states. [2019-08-05 10:05:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:06,421 INFO L93 Difference]: Finished difference Result 363 states and 649 transitions. [2019-08-05 10:05:06,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:05:06,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-08-05 10:05:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:06,424 INFO L225 Difference]: With dead ends: 363 [2019-08-05 10:05:06,424 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:05:06,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:05:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:05:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 351. [2019-08-05 10:05:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-08-05 10:05:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 629 transitions. [2019-08-05 10:05:06,432 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 629 transitions. Word has length 32 [2019-08-05 10:05:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:06,432 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 629 transitions. [2019-08-05 10:05:06,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:05:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 629 transitions. [2019-08-05 10:05:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:05:06,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:06,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:06,434 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash -535566479, now seen corresponding path program 1 times [2019-08-05 10:05:06,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:06,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:06,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:06,820 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-08-05 10:05:06,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:06,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:06,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:06,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:06,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:07,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:07,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:07,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:07,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:07,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:05:07,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:07,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:07,202 INFO L87 Difference]: Start difference. First operand 351 states and 629 transitions. Second operand 12 states. [2019-08-05 10:05:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:09,696 INFO L93 Difference]: Finished difference Result 587 states and 1034 transitions. [2019-08-05 10:05:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:09,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-08-05 10:05:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:09,700 INFO L225 Difference]: With dead ends: 587 [2019-08-05 10:05:09,700 INFO L226 Difference]: Without dead ends: 581 [2019-08-05 10:05:09,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:05:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-08-05 10:05:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 401. [2019-08-05 10:05:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-08-05 10:05:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 712 transitions. [2019-08-05 10:05:09,710 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 712 transitions. Word has length 32 [2019-08-05 10:05:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:09,711 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 712 transitions. [2019-08-05 10:05:09,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 712 transitions. [2019-08-05 10:05:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:05:09,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:09,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:09,712 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:09,713 INFO L82 PathProgramCache]: Analyzing trace with hash -783073705, now seen corresponding path program 1 times [2019-08-05 10:05:09,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:09,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:09,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:10,170 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:05:10,501 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:05:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:10,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:10,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:05:10,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:10,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:10,936 INFO L87 Difference]: Start difference. First operand 401 states and 712 transitions. Second operand 12 states. [2019-08-05 10:05:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:12,815 INFO L93 Difference]: Finished difference Result 527 states and 915 transitions. [2019-08-05 10:05:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:05:12,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-08-05 10:05:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:12,819 INFO L225 Difference]: With dead ends: 527 [2019-08-05 10:05:12,820 INFO L226 Difference]: Without dead ends: 527 [2019-08-05 10:05:12,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-08-05 10:05:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 411. [2019-08-05 10:05:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-08-05 10:05:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 731 transitions. [2019-08-05 10:05:12,828 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 731 transitions. Word has length 32 [2019-08-05 10:05:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:12,828 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 731 transitions. [2019-08-05 10:05:12,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 731 transitions. [2019-08-05 10:05:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:05:12,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:12,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:12,830 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -644036272, now seen corresponding path program 1 times [2019-08-05 10:05:12,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:12,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:12,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:13,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,748 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-08-05 10:05:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:14,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:14,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:05:14,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2019-08-05 10:05:14,162 INFO L87 Difference]: Start difference. First operand 411 states and 731 transitions. Second operand 13 states. [2019-08-05 10:06:25,082 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-08-05 10:07:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:23,673 INFO L93 Difference]: Finished difference Result 594 states and 1007 transitions. [2019-08-05 10:07:23,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:07:23,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-08-05 10:07:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:23,677 INFO L225 Difference]: With dead ends: 594 [2019-08-05 10:07:23,677 INFO L226 Difference]: Without dead ends: 594 [2019-08-05 10:07:23,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=112, Invalid=378, Unknown=16, NotChecked=0, Total=506 [2019-08-05 10:07:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-08-05 10:07:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 429. [2019-08-05 10:07:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-08-05 10:07:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 761 transitions. [2019-08-05 10:07:23,687 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 761 transitions. Word has length 33 [2019-08-05 10:07:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:23,687 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 761 transitions. [2019-08-05 10:07:23,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 761 transitions. [2019-08-05 10:07:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:23,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:23,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:23,689 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1345462349, now seen corresponding path program 1 times [2019-08-05 10:07:23,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:23,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:07:23,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:24,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:24,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:07:24,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:24,832 INFO L87 Difference]: Start difference. First operand 429 states and 761 transitions. Second operand 11 states. [2019-08-05 10:07:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:26,220 INFO L93 Difference]: Finished difference Result 544 states and 928 transitions. [2019-08-05 10:07:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:07:26,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 10:07:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:26,223 INFO L225 Difference]: With dead ends: 544 [2019-08-05 10:07:26,224 INFO L226 Difference]: Without dead ends: 544 [2019-08-05 10:07:26,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-08-05 10:07:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 440. [2019-08-05 10:07:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-08-05 10:07:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 781 transitions. [2019-08-05 10:07:26,232 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 781 transitions. Word has length 33 [2019-08-05 10:07:26,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:26,232 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 781 transitions. [2019-08-05 10:07:26,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:07:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 781 transitions. [2019-08-05 10:07:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:26,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:26,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:26,234 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1769953785, now seen corresponding path program 1 times [2019-08-05 10:07:26,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:26,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:07:26,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:26,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:26,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:07:26,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:26,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:26,320 INFO L87 Difference]: Start difference. First operand 440 states and 781 transitions. Second operand 6 states. [2019-08-05 10:07:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:27,153 INFO L93 Difference]: Finished difference Result 837 states and 1476 transitions. [2019-08-05 10:07:27,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:27,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-08-05 10:07:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:27,158 INFO L225 Difference]: With dead ends: 837 [2019-08-05 10:07:27,158 INFO L226 Difference]: Without dead ends: 833 [2019-08-05 10:07:27,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-08-05 10:07:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 588. [2019-08-05 10:07:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-08-05 10:07:27,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1054 transitions. [2019-08-05 10:07:27,169 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1054 transitions. Word has length 33 [2019-08-05 10:07:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:27,170 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 1054 transitions. [2019-08-05 10:07:27,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1054 transitions. [2019-08-05 10:07:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:27,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:27,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:27,172 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 25002365, now seen corresponding path program 1 times [2019-08-05 10:07:27,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:27,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:07:27,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:27,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:07:27,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:07:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:07:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:27,706 INFO L87 Difference]: Start difference. First operand 588 states and 1054 transitions. Second operand 13 states. [2019-08-05 10:07:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:29,528 INFO L93 Difference]: Finished difference Result 798 states and 1419 transitions. [2019-08-05 10:07:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:07:29,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-08-05 10:07:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:29,533 INFO L225 Difference]: With dead ends: 798 [2019-08-05 10:07:29,533 INFO L226 Difference]: Without dead ends: 798 [2019-08-05 10:07:29,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:07:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-08-05 10:07:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 631. [2019-08-05 10:07:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-08-05 10:07:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1127 transitions. [2019-08-05 10:07:29,542 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1127 transitions. Word has length 33 [2019-08-05 10:07:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:29,543 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 1127 transitions. [2019-08-05 10:07:29,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1127 transitions. [2019-08-05 10:07:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:29,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:29,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:29,545 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash 574934771, now seen corresponding path program 1 times [2019-08-05 10:07:29,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:29,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:07:29,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:31,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:07:31,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:07:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:07:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:07:31,282 INFO L87 Difference]: Start difference. First operand 631 states and 1127 transitions. Second operand 15 states. [2019-08-05 10:08:04,019 WARN L188 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 10:08:42,484 WARN L188 SmtUtils]: Spent 24.14 s on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:08:58,028 WARN L188 SmtUtils]: Spent 15.25 s on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:08:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:58,101 INFO L93 Difference]: Finished difference Result 809 states and 1416 transitions. [2019-08-05 10:08:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:08:58,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-08-05 10:08:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:58,107 INFO L225 Difference]: With dead ends: 809 [2019-08-05 10:08:58,107 INFO L226 Difference]: Without dead ends: 804 [2019-08-05 10:08:58,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=112, Invalid=537, Unknown=1, NotChecked=0, Total=650 [2019-08-05 10:08:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-08-05 10:08:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 644. [2019-08-05 10:08:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-08-05 10:08:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1148 transitions. [2019-08-05 10:08:58,116 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1148 transitions. Word has length 33 [2019-08-05 10:08:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:58,117 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1148 transitions. [2019-08-05 10:08:58,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:08:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1148 transitions. [2019-08-05 10:08:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:08:58,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:58,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:58,119 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2088042420, now seen corresponding path program 1 times [2019-08-05 10:08:58,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:58,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:08:58,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:58,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:08:58,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:08:58,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:08:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:08:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:08:58,177 INFO L87 Difference]: Start difference. First operand 644 states and 1148 transitions. Second operand 3 states. Received shutdown request... [2019-08-05 10:08:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 10:08:58,202 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:08:58,208 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:08:58,209 INFO L202 PluginConnector]: Adding new model RanFile058.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:08:58 BoogieIcfgContainer [2019-08-05 10:08:58,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:08:58,212 INFO L168 Benchmark]: Toolchain (without parser) took 274562.55 ms. Allocated memory was 138.9 MB in the beginning and 353.4 MB in the end (delta: 214.4 MB). Free memory was 107.1 MB in the beginning and 220.9 MB in the end (delta: -113.8 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,212 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 138.9 MB. Free memory was 106.9 MB in the beginning and 104.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,214 INFO L168 Benchmark]: Boogie Preprocessor took 98.34 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 102.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,216 INFO L168 Benchmark]: RCFGBuilder took 3155.75 ms. Allocated memory was 138.9 MB in the beginning and 178.3 MB in the end (delta: 39.3 MB). Free memory was 102.4 MB in the beginning and 92.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,218 INFO L168 Benchmark]: TraceAbstraction took 271259.91 ms. Allocated memory was 178.3 MB in the beginning and 353.4 MB in the end (delta: 175.1 MB). Free memory was 92.4 MB in the beginning and 220.9 MB in the end (delta: -128.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:58,224 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.27 ms. Allocated memory is still 138.9 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 138.9 MB. Free memory was 106.9 MB in the beginning and 104.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.34 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 102.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3155.75 ms. Allocated memory was 138.9 MB in the beginning and 178.3 MB in the end (delta: 39.3 MB). Free memory was 102.4 MB in the beginning and 92.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 271259.91 ms. Allocated memory was 178.3 MB in the beginning and 353.4 MB in the end (delta: 175.1 MB). Free memory was 92.4 MB in the beginning and 220.9 MB in the end (delta: -128.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 424]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 424). Cancelled while BasicCegarLoop was constructing difference of abstraction (644states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 423]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 423). Cancelled while BasicCegarLoop was constructing difference of abstraction (644states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 425]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 425). Cancelled while BasicCegarLoop was constructing difference of abstraction (644states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 3 error locations. TIMEOUT Result, 271.1s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 256.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2246 SDtfs, 3372 SDslu, 2484 SDs, 0 SdLazy, 20479 SolverSat, 509 SolverUnsat, 121 SolverUnknown, 0 SolverNotchecked, 181.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 547 SyntacticMatches, 6 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 83.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=22, 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.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1983 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 699 ConstructedInterpolants, 154 QuantifiedInterpolants, 239134 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1608 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 29/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown