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/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_756_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:09:12,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:09:12,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:09:12,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:09:12,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:09:12,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:09:12,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:09:12,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:09:12,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:09:12,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:09:12,897 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:09:12,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:09:12,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:09:12,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:09:12,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:09:12,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:09:12,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:09:12,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:09:12,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:09:12,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:09:12,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:09:12,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:09:12,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:09:12,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:09:12,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:09:12,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:09:12,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:09:12,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:09:12,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:09:12,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:09:12,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:09:12,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:09:12,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:09:12,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:09:12,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:09:12,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:09:12,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:09:12,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:09:12,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:09:12,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:09:12,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:09:12,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:09:12,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:09:12,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:09:12,987 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:09:12,988 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:09:12,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_756_25.bpl [2019-08-05 10:09:12,989 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_756_25.bpl' [2019-08-05 10:09:13,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:09:13,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:09:13,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:13,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:09:13,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:09:13,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,181 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:09:13,181 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:09:13,182 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:09:13,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:13,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:09:13,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:09:13,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:09:13,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/1) ... [2019-08-05 10:09:13,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:09:13,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:09:13,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:09:13,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:09:13,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (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:09:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:09:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:09:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:09:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:09:13,380 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:09:13,381 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:09:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:09:13,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:09:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:09:13,381 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:09:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:09:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:09:13,382 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:09:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:09:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:09:13,702 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:09:17,982 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:09:17,982 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:09:17,983 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:17 BoogieIcfgContainer [2019-08-05 10:09:17,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:09:17,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:09:17,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:09:17,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:09:17,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:13" (1/2) ... [2019-08-05 10:09:17,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2735cc and model type u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:09:17, skipping insertion in model container [2019-08-05 10:09:17,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:17" (2/2) ... [2019-08-05 10:09:17,992 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_756_25.bpl [2019-08-05 10:09:18,002 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:09:18,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:09:18,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:09:18,047 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:09:18,047 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:09:18,047 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:09:18,048 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:09:18,048 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:09:18,048 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:09:18,048 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:09:18,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:09:18,049 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:09:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:09:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:09:18,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:18,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:09:18,075 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:09:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:18,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:18,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:18,292 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:09:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:18,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:09:18,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:18,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:18,314 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:09:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:18,408 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:09:18,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:18,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:09:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:18,424 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:09:18,424 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:09:18,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:09:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:09:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:09:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:09:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:09:18,485 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:09:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:18,485 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:09:18,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:09:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:18,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:18,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:18,487 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:09:18,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:18,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:18,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:18,631 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:09:18,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:18,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:18,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:18,635 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:09:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,075 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:09:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:19,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:09:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,078 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:09:19,078 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:09:19,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 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:09:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:09:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:09:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:09:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:09:19,094 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:09:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,095 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:09:19,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:09:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:09:19,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,096 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] [2019-08-05 10:09:19,096 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:09:19,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,195 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:09:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:19,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:19,197 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:09:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,262 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:09:19,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:19,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:09:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,267 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:09:19,267 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:09:19,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 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:09:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:09:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:09:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:09:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:09:19,291 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:09:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,292 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:09:19,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:09:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:09:19,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,293 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] [2019-08-05 10:09:19,293 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:09:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,410 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:09:19,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:19,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:19,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:19,412 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:09:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,460 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:09:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:19,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:09:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,470 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:09:19,470 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:09:19,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 1 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:09:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:09:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:09:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:09:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:09:19,520 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:09:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,520 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:09:19,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:09:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:19,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,523 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] [2019-08-05 10:09:19,523 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:09:19,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,594 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:09:19,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:19,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:19,595 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:09:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,771 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:09:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:19,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:09:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,778 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:09:19,779 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:09:19,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 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:09:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:09:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:09:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:09:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:09:19,804 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:09:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,804 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:09:19,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:09:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:09:19,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,806 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:09:19,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:09:19,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,859 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:09:19,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:19,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:19,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:19,861 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:09:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:20,153 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:09:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:20,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:09:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:20,165 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:09:20,166 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:09:20,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 1 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:09:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:09:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:09:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:09:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:09:20,213 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:09:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:20,213 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:09:20,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:09:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:20,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:20,215 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, 1, 1] [2019-08-05 10:09:20,215 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:09:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:20,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:20,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:20,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,800 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:09:21,139 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:09:21,153 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:09:21,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:21,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:21,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:21,154 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:09:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:21,774 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:09:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:21,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:09:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:21,788 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:09:21,788 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:09:21,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:09:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:09:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:09:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:09:21,825 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:09:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:21,826 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:09:21,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:09:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:09:21,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:21,829 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:21,829 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:09:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:21,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:21,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:21,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:21,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:21,892 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:09:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:22,333 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:09:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:22,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:09:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:22,347 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:09:22,347 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:09:22,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 1 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:09:22,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:09:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:09:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:09:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:09:22,483 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:09:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:22,484 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:09:22,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:09:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:09:22,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:22,488 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:22,488 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:09:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:22,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:22,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:22,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:22,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:22,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:22,584 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:09:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:23,459 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:09:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:23,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:09:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:23,483 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:09:23,484 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:09:23,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 1 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:09:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:09:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:09:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:09:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:09:23,583 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:09:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:23,584 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:09:23,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:09:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:09:23,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:23,591 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:23,592 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:09:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:23,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:23,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:23,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:23,712 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:09:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:24,164 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:09:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:24,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:09:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:24,187 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:09:24,188 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:09:24,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:09:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:09:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:09:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:09:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:09:24,281 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:09:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:24,282 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:09:24,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:09:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:24,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:24,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:24,287 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:09:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:24,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:24,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:24,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:24,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:24,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:24,622 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:09:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:25,796 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:09:25,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:25,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:09:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:25,821 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:09:25,821 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:09:25,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:09:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:09:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:09:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:09:25,911 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:09:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:25,912 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:09:25,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:09:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:25,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:25,913 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:25,914 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:09:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:25,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:25,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,076 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:09:26,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,554 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:26,827 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:26,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:26,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:27,017 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:27,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:27,151 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:09:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,640 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:09:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:09:27,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:09:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,676 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:09:27,676 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:09:27,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:09:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:09:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:09:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:09:27,769 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:09:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,769 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:09:27,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:09:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:09:27,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,770 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:27,771 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:09:27,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:28,080 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:09:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:28,511 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:09:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:28,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:09:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:28,528 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:09:28,528 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:09:28,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:09:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:09:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:09:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:09:28,642 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:09:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:28,642 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:09:28,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:09:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:09:28,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:28,644 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:28,645 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:09:28,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:28,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:28,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:28,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,228 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:29,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:09:29,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:29,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:29,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:29,480 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:09:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:29,852 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:09:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:29,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:09:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:29,862 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:09:29,863 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:09:29,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:09:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:09:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:09:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:09:29,928 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:09:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:29,929 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:09:29,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:09:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:09:29,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:29,931 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:29,932 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:29,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:09:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:29,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:09:29,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,401 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:30,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:30,940 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:09:30,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:09:30,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:30,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:30,963 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:09:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:31,152 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:09:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:31,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:09:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:31,164 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:09:31,165 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:09:31,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:09:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:09:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:09:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:09:31,233 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:09:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:31,234 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:09:31,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:09:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:09:31,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:31,236 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:31,236 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:09:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:31,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:09:31,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:09:31,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:31,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:31,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:09:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:09:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:09:31,421 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:09:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:32,206 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:09:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:32,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:09:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:32,224 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:09:32,224 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:09:32,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:09:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:09:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:09:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:09:32,469 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:09:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:32,470 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:09:32,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:09:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:09:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:09:32,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:32,472 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:32,472 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:09:32,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:32,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:32,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:09:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:32,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:32,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:32,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:32,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:32,578 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:09:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:32,706 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:09:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:32,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:09:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:32,726 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:09:32,726 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:09:32,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 1 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:09:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:09:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:09:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:09:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:09:32,930 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:09:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:32,931 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:09:32,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:09:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:09:32,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:32,935 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:32,935 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:09:32,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:32,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:32,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:09:33,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:33,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:33,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:33,055 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:09:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:34,399 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:09:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:34,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:09:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:34,427 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:09:34,428 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:09:34,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 1 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:09:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:09:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:09:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:09:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:09:34,651 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:09:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:34,652 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:09:34,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:09:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:09:34,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:34,654 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:34,655 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:09:34,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:34,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:09:34,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:34,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,181 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:35,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,618 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:09:35,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,897 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 9 [2019-08-05 10:09:35,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,367 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:09:36,733 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:09:36,991 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:09:37,249 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:09:37,483 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:09:37,700 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:09:37,909 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:09:38,104 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:09:38,279 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:09:38,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:09:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:38,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:38,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:09:38,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:09:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:09:38,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:38,381 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 20 states. [2019-08-05 10:09:39,540 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:09:39,926 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-08-05 10:09:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:40,170 INFO L93 Difference]: Finished difference Result 21935 states and 30075 transitions. [2019-08-05 10:09:40,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:40,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:09:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:40,191 INFO L225 Difference]: With dead ends: 21935 [2019-08-05 10:09:40,191 INFO L226 Difference]: Without dead ends: 21935 [2019-08-05 10:09:40,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:09:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2019-08-05 10:09:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21838. [2019-08-05 10:09:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21838 states. [2019-08-05 10:09:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21838 states to 21838 states and 29978 transitions. [2019-08-05 10:09:40,395 INFO L78 Accepts]: Start accepts. Automaton has 21838 states and 29978 transitions. Word has length 139 [2019-08-05 10:09:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:40,396 INFO L475 AbstractCegarLoop]: Abstraction has 21838 states and 29978 transitions. [2019-08-05 10:09:40,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:09:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21838 states and 29978 transitions. [2019-08-05 10:09:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:09:40,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:40,399 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:40,399 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:09:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:40,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:09:40,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:40,613 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:40,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:40,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:09:41,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:41,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:41,265 INFO L87 Difference]: Start difference. First operand 21838 states and 29978 transitions. Second operand 7 states. [2019-08-05 10:09:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:41,690 INFO L93 Difference]: Finished difference Result 23920 states and 32548 transitions. [2019-08-05 10:09:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:41,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:09:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:41,714 INFO L225 Difference]: With dead ends: 23920 [2019-08-05 10:09:41,714 INFO L226 Difference]: Without dead ends: 23920 [2019-08-05 10:09:41,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23920 states. [2019-08-05 10:09:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23920 to 23546. [2019-08-05 10:09:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23546 states. [2019-08-05 10:09:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23546 states to 23546 states and 32116 transitions. [2019-08-05 10:09:41,942 INFO L78 Accepts]: Start accepts. Automaton has 23546 states and 32116 transitions. Word has length 143 [2019-08-05 10:09:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:41,943 INFO L475 AbstractCegarLoop]: Abstraction has 23546 states and 32116 transitions. [2019-08-05 10:09:41,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23546 states and 32116 transitions. [2019-08-05 10:09:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:09:41,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:41,945 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:41,945 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1330469809, now seen corresponding path program 1 times [2019-08-05 10:09:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:41,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 10:09:42,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:42,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:42,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:42,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:42,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:42,151 INFO L87 Difference]: Start difference. First operand 23546 states and 32116 transitions. Second operand 5 states. [2019-08-05 10:09:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:42,341 INFO L93 Difference]: Finished difference Result 24324 states and 33161 transitions. [2019-08-05 10:09:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:42,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-08-05 10:09:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:42,370 INFO L225 Difference]: With dead ends: 24324 [2019-08-05 10:09:42,370 INFO L226 Difference]: Without dead ends: 24317 [2019-08-05 10:09:42,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-08-05 10:09:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 24035. [2019-08-05 10:09:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-08-05 10:09:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 32686 transitions. [2019-08-05 10:09:42,822 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 32686 transitions. Word has length 143 [2019-08-05 10:09:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:42,823 INFO L475 AbstractCegarLoop]: Abstraction has 24035 states and 32686 transitions. [2019-08-05 10:09:42,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 32686 transitions. [2019-08-05 10:09:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:09:42,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:42,830 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:42,830 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:09:42,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:42,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:42,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:09:42,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:42,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:42,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:42,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:42,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:42,948 INFO L87 Difference]: Start difference. First operand 24035 states and 32686 transitions. Second operand 3 states. [2019-08-05 10:09:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:43,679 INFO L93 Difference]: Finished difference Result 28005 states and 37776 transitions. [2019-08-05 10:09:43,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:43,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:09:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:43,708 INFO L225 Difference]: With dead ends: 28005 [2019-08-05 10:09:43,709 INFO L226 Difference]: Without dead ends: 27932 [2019-08-05 10:09:43,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 1 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:09:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-08-05 10:09:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 27882. [2019-08-05 10:09:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27882 states. [2019-08-05 10:09:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27882 states to 27882 states and 37631 transitions. [2019-08-05 10:09:43,931 INFO L78 Accepts]: Start accepts. Automaton has 27882 states and 37631 transitions. Word has length 171 [2019-08-05 10:09:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:43,931 INFO L475 AbstractCegarLoop]: Abstraction has 27882 states and 37631 transitions. [2019-08-05 10:09:43,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27882 states and 37631 transitions. [2019-08-05 10:09:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:09:43,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:43,936 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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:09:43,936 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:09:43,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:43,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:43,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:09:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:44,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:44,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:44,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:44,046 INFO L87 Difference]: Start difference. First operand 27882 states and 37631 transitions. Second operand 3 states. [2019-08-05 10:09:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:44,592 INFO L93 Difference]: Finished difference Result 31872 states and 42931 transitions. [2019-08-05 10:09:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:44,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:09:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:44,621 INFO L225 Difference]: With dead ends: 31872 [2019-08-05 10:09:44,621 INFO L226 Difference]: Without dead ends: 31824 [2019-08-05 10:09:44,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 1 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:09:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31824 states. [2019-08-05 10:09:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31824 to 29962. [2019-08-05 10:09:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29962 states. [2019-08-05 10:09:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29962 states to 29962 states and 40395 transitions. [2019-08-05 10:09:44,983 INFO L78 Accepts]: Start accepts. Automaton has 29962 states and 40395 transitions. Word has length 173 [2019-08-05 10:09:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:44,983 INFO L475 AbstractCegarLoop]: Abstraction has 29962 states and 40395 transitions. [2019-08-05 10:09:44,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 29962 states and 40395 transitions. [2019-08-05 10:09:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:09:44,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:44,988 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:09:44,988 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:09:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:45,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:09:45,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:45,183 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:45,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:45,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,895 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:46,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:46,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 10:09:47,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:47,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:47,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:47,282 INFO L87 Difference]: Start difference. First operand 29962 states and 40395 transitions. Second operand 8 states. [2019-08-05 10:09:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:47,925 INFO L93 Difference]: Finished difference Result 34159 states and 45568 transitions. [2019-08-05 10:09:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:47,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:09:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:47,959 INFO L225 Difference]: With dead ends: 34159 [2019-08-05 10:09:47,959 INFO L226 Difference]: Without dead ends: 34159 [2019-08-05 10:09:47,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2019-08-05 10:09:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 33905. [2019-08-05 10:09:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33905 states. [2019-08-05 10:09:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 45314 transitions. [2019-08-05 10:09:48,243 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 45314 transitions. Word has length 174 [2019-08-05 10:09:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:48,243 INFO L475 AbstractCegarLoop]: Abstraction has 33905 states and 45314 transitions. [2019-08-05 10:09:48,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 45314 transitions. [2019-08-05 10:09:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:09:48,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:48,248 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:48,249 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 570429234, now seen corresponding path program 1 times [2019-08-05 10:09:48,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:48,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:48,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 194 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:09:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:48,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:48,919 INFO L87 Difference]: Start difference. First operand 33905 states and 45314 transitions. Second operand 8 states. [2019-08-05 10:09:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:49,518 INFO L93 Difference]: Finished difference Result 63378 states and 85380 transitions. [2019-08-05 10:09:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:49,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-08-05 10:09:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:49,582 INFO L225 Difference]: With dead ends: 63378 [2019-08-05 10:09:49,583 INFO L226 Difference]: Without dead ends: 63288 [2019-08-05 10:09:49,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63288 states. [2019-08-05 10:09:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63288 to 47156. [2019-08-05 10:09:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47156 states. [2019-08-05 10:09:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 64161 transitions. [2019-08-05 10:09:50,026 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 64161 transitions. Word has length 175 [2019-08-05 10:09:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:50,027 INFO L475 AbstractCegarLoop]: Abstraction has 47156 states and 64161 transitions. [2019-08-05 10:09:50,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 64161 transitions. [2019-08-05 10:09:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:09:50,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:50,031 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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:09:50,031 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:09:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:50,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:09:50,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:50,256 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:50,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:50,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,481 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 83 DAG size of output: 11 [2019-08-05 10:09:51,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:51,974 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:52,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:52,424 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:09:53,555 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:09:53,796 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:09:54,040 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:09:54,248 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:09:54,445 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:09:54,640 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:09:54,828 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:09:54,968 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:09:54,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:09:55,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:09:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:55,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:09:55,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:09:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:09:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:09:55,212 INFO L87 Difference]: Start difference. First operand 47156 states and 64161 transitions. Second operand 23 states. [2019-08-05 10:09:55,881 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2019-08-05 10:09:56,130 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-08-05 10:09:57,570 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:09:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:57,964 INFO L93 Difference]: Finished difference Result 58363 states and 78277 transitions. [2019-08-05 10:09:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:09:57,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 177 [2019-08-05 10:09:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:58,035 INFO L225 Difference]: With dead ends: 58363 [2019-08-05 10:09:58,035 INFO L226 Difference]: Without dead ends: 58363 [2019-08-05 10:09:58,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:09:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58363 states. [2019-08-05 10:09:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58363 to 54535. [2019-08-05 10:09:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54535 states. [2019-08-05 10:09:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54535 states to 54535 states and 73601 transitions. [2019-08-05 10:09:58,637 INFO L78 Accepts]: Start accepts. Automaton has 54535 states and 73601 transitions. Word has length 177 [2019-08-05 10:09:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:58,637 INFO L475 AbstractCegarLoop]: Abstraction has 54535 states and 73601 transitions. [2019-08-05 10:09:58,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:09:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54535 states and 73601 transitions. [2019-08-05 10:09:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:09:58,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:58,642 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:58,642 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1753462791, now seen corresponding path program 1 times [2019-08-05 10:09:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:58,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:09:58,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:58,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:58,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,082 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:59,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,596 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 11 [2019-08-05 10:09:59,906 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:00,203 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:00,455 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:00,669 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:00,879 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:01,107 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:01,340 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:01,504 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:01,647 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:01,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:10:01,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:10:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:10:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:10:01,821 INFO L87 Difference]: Start difference. First operand 54535 states and 73601 transitions. Second operand 22 states. [2019-08-05 10:10:02,712 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-08-05 10:10:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:04,239 INFO L93 Difference]: Finished difference Result 57305 states and 76887 transitions. [2019-08-05 10:10:04,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:10:04,239 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-08-05 10:10:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:04,296 INFO L225 Difference]: With dead ends: 57305 [2019-08-05 10:10:04,296 INFO L226 Difference]: Without dead ends: 57305 [2019-08-05 10:10:04,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:10:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2019-08-05 10:10:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 55550. [2019-08-05 10:10:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55550 states. [2019-08-05 10:10:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55550 states to 55550 states and 74818 transitions. [2019-08-05 10:10:04,768 INFO L78 Accepts]: Start accepts. Automaton has 55550 states and 74818 transitions. Word has length 178 [2019-08-05 10:10:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:04,768 INFO L475 AbstractCegarLoop]: Abstraction has 55550 states and 74818 transitions. [2019-08-05 10:10:04,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:10:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55550 states and 74818 transitions. [2019-08-05 10:10:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:10:04,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:04,775 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:04,775 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash -275131603, now seen corresponding path program 1 times [2019-08-05 10:10:04,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:04,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:04,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:10:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:04,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:04,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:04,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:04,888 INFO L87 Difference]: Start difference. First operand 55550 states and 74818 transitions. Second operand 3 states. [2019-08-05 10:10:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:05,071 INFO L93 Difference]: Finished difference Result 54534 states and 70764 transitions. [2019-08-05 10:10:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:05,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-08-05 10:10:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:05,124 INFO L225 Difference]: With dead ends: 54534 [2019-08-05 10:10:05,124 INFO L226 Difference]: Without dead ends: 54414 [2019-08-05 10:10:05,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 1 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:10:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54414 states. [2019-08-05 10:10:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54414 to 47565. [2019-08-05 10:10:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47565 states. [2019-08-05 10:10:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47565 states to 47565 states and 62175 transitions. [2019-08-05 10:10:05,813 INFO L78 Accepts]: Start accepts. Automaton has 47565 states and 62175 transitions. Word has length 194 [2019-08-05 10:10:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:05,814 INFO L475 AbstractCegarLoop]: Abstraction has 47565 states and 62175 transitions. [2019-08-05 10:10:05,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47565 states and 62175 transitions. [2019-08-05 10:10:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:10:05,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:05,820 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:10:05,820 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1621474027, now seen corresponding path program 1 times [2019-08-05 10:10:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:10:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 142 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:10:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:05,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:10:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:10:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:05,998 INFO L87 Difference]: Start difference. First operand 47565 states and 62175 transitions. Second operand 6 states. [2019-08-05 10:10:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:06,656 INFO L93 Difference]: Finished difference Result 66827 states and 88079 transitions. [2019-08-05 10:10:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:06,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-08-05 10:10:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:06,721 INFO L225 Difference]: With dead ends: 66827 [2019-08-05 10:10:06,721 INFO L226 Difference]: Without dead ends: 66827 [2019-08-05 10:10:06,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-08-05 10:10:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 44927. [2019-08-05 10:10:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44927 states. [2019-08-05 10:10:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44927 states to 44927 states and 59012 transitions. [2019-08-05 10:10:07,175 INFO L78 Accepts]: Start accepts. Automaton has 44927 states and 59012 transitions. Word has length 195 [2019-08-05 10:10:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:07,176 INFO L475 AbstractCegarLoop]: Abstraction has 44927 states and 59012 transitions. [2019-08-05 10:10:07,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 44927 states and 59012 transitions. [2019-08-05 10:10:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:10:07,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:07,183 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:07,183 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1319648849, now seen corresponding path program 1 times [2019-08-05 10:10:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:07,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:10:07,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 128 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 10:10:07,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:07,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:10:07,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:07,451 INFO L87 Difference]: Start difference. First operand 44927 states and 59012 transitions. Second operand 8 states. [2019-08-05 10:10:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:08,024 INFO L93 Difference]: Finished difference Result 75763 states and 98574 transitions. [2019-08-05 10:10:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:10:08,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-08-05 10:10:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:08,111 INFO L225 Difference]: With dead ends: 75763 [2019-08-05 10:10:08,111 INFO L226 Difference]: Without dead ends: 75625 [2019-08-05 10:10:08,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:10:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75625 states. [2019-08-05 10:10:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75625 to 68588. [2019-08-05 10:10:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68588 states. [2019-08-05 10:10:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68588 states to 68588 states and 89202 transitions. [2019-08-05 10:10:09,019 INFO L78 Accepts]: Start accepts. Automaton has 68588 states and 89202 transitions. Word has length 196 [2019-08-05 10:10:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:09,020 INFO L475 AbstractCegarLoop]: Abstraction has 68588 states and 89202 transitions. [2019-08-05 10:10:09,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 68588 states and 89202 transitions. [2019-08-05 10:10:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:10:09,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:09,026 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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:10:09,026 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:10:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:09,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-08-05 10:10:09,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:09,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:09,150 INFO L87 Difference]: Start difference. First operand 68588 states and 89202 transitions. Second operand 3 states. [2019-08-05 10:10:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:09,460 INFO L93 Difference]: Finished difference Result 88546 states and 114684 transitions. [2019-08-05 10:10:09,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:09,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:10:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:09,561 INFO L225 Difference]: With dead ends: 88546 [2019-08-05 10:10:09,561 INFO L226 Difference]: Without dead ends: 87546 [2019-08-05 10:10:09,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 197 SyntacticMatches, 1 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:10:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87546 states. [2019-08-05 10:10:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87546 to 87544. [2019-08-05 10:10:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87544 states. [2019-08-05 10:10:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87544 states to 87544 states and 113300 transitions. [2019-08-05 10:10:12,126 INFO L78 Accepts]: Start accepts. Automaton has 87544 states and 113300 transitions. Word has length 200 [2019-08-05 10:10:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:12,126 INFO L475 AbstractCegarLoop]: Abstraction has 87544 states and 113300 transitions. [2019-08-05 10:10:12,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 87544 states and 113300 transitions. [2019-08-05 10:10:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:10:12,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:12,132 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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:10:12,132 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:12,133 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:10:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:12,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:10:12,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:12,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:12,805 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:13,443 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:13,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,689 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:10:13,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:13,936 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:10:14,296 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:14,554 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:14,850 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:15,082 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:15,299 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:15,497 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:15,679 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:15,850 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:15,991 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:15,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:16,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 20 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:16,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:16,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:10:16,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:10:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:10:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:10:16,895 INFO L87 Difference]: Start difference. First operand 87544 states and 113300 transitions. Second operand 30 states. [2019-08-05 10:10:18,104 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-05 10:10:21,063 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:22,293 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:22,611 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:10:23,516 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 10:10:24,665 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:10:25,353 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:25,598 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:10:25,785 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-08-05 10:10:25,944 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:26,197 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:10:26,567 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-08-05 10:10:27,072 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:10:27,243 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:29,692 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:10:29,952 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-08-05 10:10:30,351 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:10:30,661 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-08-05 10:10:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:35,165 INFO L93 Difference]: Finished difference Result 560683 states and 758394 transitions. [2019-08-05 10:10:35,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:10:35,166 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-08-05 10:10:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:36,008 INFO L225 Difference]: With dead ends: 560683 [2019-08-05 10:10:36,008 INFO L226 Difference]: Without dead ends: 556251 [2019-08-05 10:10:36,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=2667, Invalid=7839, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:10:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556251 states. [2019-08-05 10:10:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556251 to 413384. [2019-08-05 10:10:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413384 states. [2019-08-05 10:10:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413384 states to 413384 states and 572682 transitions. [2019-08-05 10:10:47,695 INFO L78 Accepts]: Start accepts. Automaton has 413384 states and 572682 transitions. Word has length 203 [2019-08-05 10:10:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:47,695 INFO L475 AbstractCegarLoop]: Abstraction has 413384 states and 572682 transitions. [2019-08-05 10:10:47,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:10:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 413384 states and 572682 transitions. [2019-08-05 10:10:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:10:47,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:47,700 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:10:47,700 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1638698119, now seen corresponding path program 1 times [2019-08-05 10:10:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:47,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:10:47,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:47,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,408 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:10:48,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 31 proven. 378 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:10:49,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:10:49,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:10:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:10:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:10:49,053 INFO L87 Difference]: Start difference. First operand 413384 states and 572682 transitions. Second operand 16 states. [2019-08-05 10:10:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:51,794 INFO L93 Difference]: Finished difference Result 414860 states and 574279 transitions. [2019-08-05 10:10:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:10:51,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 204 [2019-08-05 10:10:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:52,482 INFO L225 Difference]: With dead ends: 414860 [2019-08-05 10:10:52,482 INFO L226 Difference]: Without dead ends: 414860 [2019-08-05 10:10:52,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:10:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414860 states. [2019-08-05 10:11:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414860 to 413581. [2019-08-05 10:11:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413581 states. [2019-08-05 10:11:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413581 states to 413581 states and 572902 transitions. [2019-08-05 10:11:03,639 INFO L78 Accepts]: Start accepts. Automaton has 413581 states and 572902 transitions. Word has length 204 [2019-08-05 10:11:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:03,639 INFO L475 AbstractCegarLoop]: Abstraction has 413581 states and 572902 transitions. [2019-08-05 10:11:03,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:11:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 413581 states and 572902 transitions. [2019-08-05 10:11:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:11:03,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:03,644 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:11:03,645 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash -733642234, now seen corresponding path program 1 times [2019-08-05 10:11:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:03,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:11:03,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:03,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:05,725 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:11:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 10:11:06,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:06,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:11:06,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:11:06,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:11:06,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:11:06,391 INFO L87 Difference]: Start difference. First operand 413581 states and 572902 transitions. Second operand 19 states. [2019-08-05 10:11:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:10,895 INFO L93 Difference]: Finished difference Result 715237 states and 971408 transitions. [2019-08-05 10:11:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:11:10,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2019-08-05 10:11:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:20,155 INFO L225 Difference]: With dead ends: 715237 [2019-08-05 10:11:20,155 INFO L226 Difference]: Without dead ends: 709845 [2019-08-05 10:11:20,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709845 states. [2019-08-05 10:11:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709845 to 617880. [2019-08-05 10:11:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617880 states. [2019-08-05 10:11:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617880 states to 617880 states and 851738 transitions. [2019-08-05 10:11:29,455 INFO L78 Accepts]: Start accepts. Automaton has 617880 states and 851738 transitions. Word has length 204 [2019-08-05 10:11:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:29,456 INFO L475 AbstractCegarLoop]: Abstraction has 617880 states and 851738 transitions. [2019-08-05 10:11:29,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:11:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 617880 states and 851738 transitions. [2019-08-05 10:11:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:11:29,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:29,461 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:11:29,461 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -402574455, now seen corresponding path program 1 times [2019-08-05 10:11:29,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:29,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:29,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-08-05 10:11:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:29,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:29,558 INFO L87 Difference]: Start difference. First operand 617880 states and 851738 transitions. Second operand 3 states. [2019-08-05 10:11:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:32,619 INFO L93 Difference]: Finished difference Result 614256 states and 831608 transitions. [2019-08-05 10:11:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:32,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-08-05 10:11:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:33,584 INFO L225 Difference]: With dead ends: 614256 [2019-08-05 10:11:33,584 INFO L226 Difference]: Without dead ends: 600340 [2019-08-05 10:11:33,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 203 SyntacticMatches, 1 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:11:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600340 states. [2019-08-05 10:11:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600340 to 576854. [2019-08-05 10:11:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576854 states. [2019-08-05 10:11:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576854 states to 576854 states and 782792 transitions. [2019-08-05 10:11:50,471 INFO L78 Accepts]: Start accepts. Automaton has 576854 states and 782792 transitions. Word has length 206 [2019-08-05 10:11:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:50,471 INFO L475 AbstractCegarLoop]: Abstraction has 576854 states and 782792 transitions. [2019-08-05 10:11:50,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 576854 states and 782792 transitions. [2019-08-05 10:11:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:11:50,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:50,475 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:50,475 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash -947645514, now seen corresponding path program 1 times [2019-08-05 10:11:50,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:50,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:11:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 191 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-08-05 10:11:50,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:11:50,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:11:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:11:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:11:50,713 INFO L87 Difference]: Start difference. First operand 576854 states and 782792 transitions. Second operand 6 states. [2019-08-05 10:11:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:58,492 INFO L93 Difference]: Finished difference Result 573497 states and 778805 transitions. [2019-08-05 10:11:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:11:58,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-08-05 10:11:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:59,378 INFO L225 Difference]: With dead ends: 573497 [2019-08-05 10:11:59,378 INFO L226 Difference]: Without dead ends: 573137 [2019-08-05 10:11:59,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573137 states. [2019-08-05 10:12:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573137 to 573110. [2019-08-05 10:12:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573110 states. [2019-08-05 10:12:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573110 states to 573110 states and 778415 transitions. [2019-08-05 10:12:12,494 INFO L78 Accepts]: Start accepts. Automaton has 573110 states and 778415 transitions. Word has length 208 [2019-08-05 10:12:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:12,494 INFO L475 AbstractCegarLoop]: Abstraction has 573110 states and 778415 transitions. [2019-08-05 10:12:12,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 573110 states and 778415 transitions. [2019-08-05 10:12:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:12:12,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:12,499 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:12,499 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1925586360, now seen corresponding path program 1 times [2019-08-05 10:12:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:12,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:12,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:12,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:12,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,493 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:12:13,758 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:12:14,016 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:12:14,289 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:12:14,535 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:12:14,730 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-08-05 10:12:14,910 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:12:15,067 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:12:15,213 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-08-05 10:12:15,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 34 proven. 448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:22,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:22,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:12:22,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:12:22,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:12:22,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:12:22,411 INFO L87 Difference]: Start difference. First operand 573110 states and 778415 transitions. Second operand 23 states. [2019-08-05 10:12:23,239 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-08-05 10:12:23,455 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-08-05 10:12:23,925 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-08-05 10:12:26,559 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 Received shutdown request... [2019-08-05 10:12:29,599 WARN L196 SmtUtils]: Removed 12 from assertion stack [2019-08-05 10:12:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:12:29,600 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:12:29,605 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:12:29,605 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_756_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:12:29 BoogieIcfgContainer [2019-08-05 10:12:29,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:12:29,607 INFO L168 Benchmark]: Toolchain (without parser) took 196496.04 ms. Allocated memory was 134.2 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 106.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,607 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,609 INFO L168 Benchmark]: Boogie Preprocessor took 118.84 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 101.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,611 INFO L168 Benchmark]: RCFGBuilder took 4679.84 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 135.6 MB in the end (delta: -34.7 MB). Peak memory consumption was 85.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,612 INFO L168 Benchmark]: TraceAbstraction took 191620.26 ms. Allocated memory was 197.1 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 135.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:12:29,614 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.84 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 101.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4679.84 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 135.6 MB in the end (delta: -34.7 MB). Peak memory consumption was 85.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191620.26 ms. Allocated memory was 197.1 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 135.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 469]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 469). Cancelled while BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 39 states, 23 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 57 for 37ms.. - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 706). Cancelled while BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 39 states, 23 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 57 for 37ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. TIMEOUT Result, 191.5s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 77.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7039 SDtfs, 18460 SDslu, 26156 SDs, 0 SdLazy, 12941 SolverSat, 2056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4814 GetRequests, 4371 SyntacticMatches, 32 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6162 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617880occurred in iteration=34, 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: 71.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 321537 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 4651 NumberOfCodeBlocks, 4651 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4614 ConstructedInterpolants, 0 QuantifiedInterpolants, 4886368 SizeOfPredicates, 168 NumberOfNonLiveVariables, 13279 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4241/7526 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown