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/PricedTimedAutomata/u2b05_broadcast_guards_vars_SAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:34,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:34,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:34,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:34,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:34,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:34,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:34,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:34,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:34,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:34,801 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:34,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:34,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:34,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:34,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:34,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:34,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:34,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:34,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:34,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:34,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:34,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:34,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:34,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:34,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:34,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:34,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:34,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:34,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:34,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:34,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:34,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:34,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:34,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:34,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:34,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:34,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:34,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:34,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:34,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:34,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:34,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:34,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:34,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:34,874 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:34,874 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:34,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b05_broadcast_guards_vars_SAFE.bpl [2019-08-05 10:12:34,875 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b05_broadcast_guards_vars_SAFE.bpl' [2019-08-05 10:12:34,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:34,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:34,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:34,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:34,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:34,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,974 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:34,974 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:34,974 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:34,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:34,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:34,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:34,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:34,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:35,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:35,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:35,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:35,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (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:12:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:35,088 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:35,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:35,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:35,089 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_v [2019-08-05 10:12:35,208 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:36,379 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:36,379 INFO L283 CfgBuilder]: Removed 19 assume(true) statements. [2019-08-05 10:12:36,381 INFO L202 PluginConnector]: Adding new model u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:36 BoogieIcfgContainer [2019-08-05 10:12:36,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:36,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:36,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:36,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:36,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/2) ... [2019-08-05 10:12:36,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c27672 and model type u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:36, skipping insertion in model container [2019-08-05 10:12:36,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:36" (2/2) ... [2019-08-05 10:12:36,390 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b05_broadcast_guards_vars_SAFE.bpl [2019-08-05 10:12:36,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:36,408 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:36,423 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:36,445 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:36,446 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:36,446 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:36,446 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:36,446 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:36,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:36,447 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:36,447 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:36,447 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-08-05 10:12:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:36,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:36,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:36,484 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 7722, now seen corresponding path program 1 times [2019-08-05 10:12:36,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:36,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:36,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:36,610 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:12:36,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:36,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:36,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:36,629 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-08-05 10:12:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:36,788 INFO L93 Difference]: Finished difference Result 55 states and 101 transitions. [2019-08-05 10:12:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:36,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:36,803 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:12:36,803 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:12:36,805 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:12:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:12:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:12:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:12:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:12:36,845 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 2 [2019-08-05 10:12:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:36,846 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:12:36,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:12:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:12:36,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:36,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:36,848 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1915356777, now seen corresponding path program 1 times [2019-08-05 10:12:36,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:36,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:36,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:36,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:36,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:36,911 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:12:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:36,984 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2019-08-05 10:12:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:36,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-08-05 10:12:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:36,986 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:12:36,986 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:12:36,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:12:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:12:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-08-05 10:12:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:12:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2019-08-05 10:12:36,996 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 9 [2019-08-05 10:12:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:36,997 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-08-05 10:12:36,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2019-08-05 10:12:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:12:36,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:36,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:36,999 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 895723758, now seen corresponding path program 1 times [2019-08-05 10:12:37,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:37,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:37,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:37,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:37,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:37,062 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand 3 states. [2019-08-05 10:12:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,240 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2019-08-05 10:12:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:37,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:12:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,247 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:12:37,250 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:12:37,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:12:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:12:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2019-08-05 10:12:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:12:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2019-08-05 10:12:37,272 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 11 [2019-08-05 10:12:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:37,272 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2019-08-05 10:12:37,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2019-08-05 10:12:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:12:37,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:37,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:37,275 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash 861204539, now seen corresponding path program 1 times [2019-08-05 10:12:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:37,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:37,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:37,353 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand 3 states. [2019-08-05 10:12:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,451 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2019-08-05 10:12:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:12:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,460 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:12:37,460 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:12:37,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:12:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:12:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-08-05 10:12:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:12:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-08-05 10:12:37,476 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 14 [2019-08-05 10:12:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:37,476 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-08-05 10:12:37,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-08-05 10:12:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:12:37,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:37,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:37,478 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:37,478 INFO L82 PathProgramCache]: Analyzing trace with hash 970606724, now seen corresponding path program 1 times [2019-08-05 10:12:37,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:37,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:37,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:37,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:12:37,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:37,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:37,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:37,680 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 4 states. [2019-08-05 10:12:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,146 INFO L93 Difference]: Finished difference Result 230 states and 325 transitions. [2019-08-05 10:12:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:38,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 10:12:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,149 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:12:38,149 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:12:38,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:12:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2019-08-05 10:12:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:12:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2019-08-05 10:12:38,165 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 15 [2019-08-05 10:12:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,166 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2019-08-05 10:12:38,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2019-08-05 10:12:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:12:38,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,167 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:38,168 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -980000049, now seen corresponding path program 1 times [2019-08-05 10:12:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:38,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:38,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:38,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:38,216 INFO L87 Difference]: Start difference. First operand 182 states and 261 transitions. Second operand 3 states. [2019-08-05 10:12:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,298 INFO L93 Difference]: Finished difference Result 227 states and 315 transitions. [2019-08-05 10:12:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:38,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:12:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,300 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:12:38,301 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 10:12:38,301 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:12:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 10:12:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-08-05 10:12:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:12:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 310 transitions. [2019-08-05 10:12:38,315 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 310 transitions. Word has length 22 [2019-08-05 10:12:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,316 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 310 transitions. [2019-08-05 10:12:38,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 310 transitions. [2019-08-05 10:12:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:12:38,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,318 INFO L399 BasicCegarLoop]: trace histogram [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:12:38,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1175627116, now seen corresponding path program 1 times [2019-08-05 10:12:38,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:38,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:38,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:38,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:38,376 INFO L87 Difference]: Start difference. First operand 221 states and 310 transitions. Second operand 3 states. [2019-08-05 10:12:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,421 INFO L93 Difference]: Finished difference Result 203 states and 278 transitions. [2019-08-05 10:12:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:38,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:12:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,423 INFO L225 Difference]: With dead ends: 203 [2019-08-05 10:12:38,424 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:12:38,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:12:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:12:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2019-08-05 10:12:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:12:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 248 transitions. [2019-08-05 10:12:38,434 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 248 transitions. Word has length 25 [2019-08-05 10:12:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,435 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 248 transitions. [2019-08-05 10:12:38,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 248 transitions. [2019-08-05 10:12:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:12:38,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,437 INFO L399 BasicCegarLoop]: trace histogram [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:12:38,437 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1022680010, now seen corresponding path program 1 times [2019-08-05 10:12:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:38,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:38,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:12:38,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:38,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:38,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:38,556 INFO L87 Difference]: Start difference. First operand 179 states and 248 transitions. Second operand 4 states. [2019-08-05 10:12:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,615 INFO L93 Difference]: Finished difference Result 272 states and 368 transitions. [2019-08-05 10:12:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:38,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:12:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,618 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:12:38,618 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:12:38,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:12:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2019-08-05 10:12:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:12:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 329 transitions. [2019-08-05 10:12:38,644 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 329 transitions. Word has length 28 [2019-08-05 10:12:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,644 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 329 transitions. [2019-08-05 10:12:38,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 329 transitions. [2019-08-05 10:12:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:12:38,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,646 INFO L399 BasicCegarLoop]: trace histogram [2, 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:12:38,646 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1031479941, now seen corresponding path program 1 times [2019-08-05 10:12:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:12:38,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:38,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:38,756 INFO L87 Difference]: Start difference. First operand 238 states and 329 transitions. Second operand 4 states. [2019-08-05 10:12:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,844 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2019-08-05 10:12:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:38,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-08-05 10:12:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,854 INFO L225 Difference]: With dead ends: 247 [2019-08-05 10:12:38,854 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:12:38,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:12:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2019-08-05 10:12:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:12:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 319 transitions. [2019-08-05 10:12:38,861 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 319 transitions. Word has length 30 [2019-08-05 10:12:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,862 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 319 transitions. [2019-08-05 10:12:38,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 319 transitions. [2019-08-05 10:12:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:12:38,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,865 INFO L399 BasicCegarLoop]: trace histogram [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:12:38,866 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 342860023, now seen corresponding path program 1 times [2019-08-05 10:12:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:39,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:39,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:39,150 INFO L87 Difference]: Start difference. First operand 232 states and 319 transitions. Second operand 6 states. [2019-08-05 10:12:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:39,427 INFO L93 Difference]: Finished difference Result 304 states and 404 transitions. [2019-08-05 10:12:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:39,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-08-05 10:12:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:39,431 INFO L225 Difference]: With dead ends: 304 [2019-08-05 10:12:39,431 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:12:39,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:12:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 273. [2019-08-05 10:12:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:12:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2019-08-05 10:12:39,439 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 31 [2019-08-05 10:12:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:39,439 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2019-08-05 10:12:39,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2019-08-05 10:12:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:12:39,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,441 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:39,441 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1763343507, now seen corresponding path program 1 times [2019-08-05 10:12:39,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:12:39,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:39,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:39,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:39,490 INFO L87 Difference]: Start difference. First operand 273 states and 371 transitions. Second operand 3 states. [2019-08-05 10:12:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:39,563 INFO L93 Difference]: Finished difference Result 396 states and 514 transitions. [2019-08-05 10:12:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:39,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-08-05 10:12:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:39,566 INFO L225 Difference]: With dead ends: 396 [2019-08-05 10:12:39,566 INFO L226 Difference]: Without dead ends: 368 [2019-08-05 10:12:39,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:12:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-08-05 10:12:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 354. [2019-08-05 10:12:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-08-05 10:12:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 470 transitions. [2019-08-05 10:12:39,576 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 470 transitions. Word has length 41 [2019-08-05 10:12:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:39,576 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 470 transitions. [2019-08-05 10:12:39,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 470 transitions. [2019-08-05 10:12:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:12:39,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,578 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-08-05 10:12:39,578 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -973144686, now seen corresponding path program 1 times [2019-08-05 10:12:39,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:12:39,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:39,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:39,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:39,631 INFO L87 Difference]: Start difference. First operand 354 states and 470 transitions. Second operand 3 states. [2019-08-05 10:12:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:39,682 INFO L93 Difference]: Finished difference Result 313 states and 393 transitions. [2019-08-05 10:12:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:39,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-08-05 10:12:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:39,685 INFO L225 Difference]: With dead ends: 313 [2019-08-05 10:12:39,685 INFO L226 Difference]: Without dead ends: 313 [2019-08-05 10:12:39,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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:12:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-08-05 10:12:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2019-08-05 10:12:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-08-05 10:12:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 378 transitions. [2019-08-05 10:12:39,692 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 378 transitions. Word has length 43 [2019-08-05 10:12:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:39,692 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 378 transitions. [2019-08-05 10:12:39,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 378 transitions. [2019-08-05 10:12:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:12:39,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,694 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:39,694 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1563709286, now seen corresponding path program 1 times [2019-08-05 10:12:39,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:12:39,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:39,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:39,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:39,780 INFO L87 Difference]: Start difference. First operand 299 states and 378 transitions. Second operand 4 states. [2019-08-05 10:12:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,149 INFO L93 Difference]: Finished difference Result 189 states and 209 transitions. [2019-08-05 10:12:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:40,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-08-05 10:12:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,150 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:12:40,151 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:12:40,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:12:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-08-05 10:12:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:12:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2019-08-05 10:12:40,156 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 57 [2019-08-05 10:12:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,156 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2019-08-05 10:12:40,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2019-08-05 10:12:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:12:40,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,158 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:40,158 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1219057278, now seen corresponding path program 1 times [2019-08-05 10:12:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,051 WARN L188 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2019-08-05 10:12:41,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:12:41,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:41,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:12:41,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:12:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:12:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:12:41,283 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 9 states. [2019-08-05 10:12:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:41,700 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2019-08-05 10:12:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:12:41,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-08-05 10:12:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:41,703 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:12:41,703 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:12:41,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:12:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:12:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2019-08-05 10:12:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:12:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 188 transitions. [2019-08-05 10:12:41,707 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 188 transitions. Word has length 60 [2019-08-05 10:12:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:41,707 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 188 transitions. [2019-08-05 10:12:41,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:12:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 188 transitions. [2019-08-05 10:12:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:12:41,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:41,709 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 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:12:41,709 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1964084305, now seen corresponding path program 1 times [2019-08-05 10:12:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:41,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:41,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:41,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,125 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-08-05 10:12:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:12:42,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:42,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:12:42,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:12:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:12:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:42,514 INFO L87 Difference]: Start difference. First operand 169 states and 188 transitions. Second operand 8 states. [2019-08-05 10:12:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:42,699 INFO L93 Difference]: Finished difference Result 65 states and 64 transitions. [2019-08-05 10:12:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:42,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-08-05 10:12:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:42,700 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:12:42,700 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:12:42,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:12:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:12:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:12:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:12:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:12:42,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-08-05 10:12:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:42,702 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:12:42,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:12:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:12:42,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:12:42,708 INFO L202 PluginConnector]: Adding new model u2b05_broadcast_guards_vars_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:12:42 BoogieIcfgContainer [2019-08-05 10:12:42,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:12:42,711 INFO L168 Benchmark]: Toolchain (without parser) took 7780.95 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 110.8 MB in the beginning and 110.2 MB in the end (delta: 562.0 kB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:42,711 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory is still 112.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:12:42,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 142.1 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:42,713 INFO L168 Benchmark]: Boogie Preprocessor took 50.05 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:42,714 INFO L168 Benchmark]: RCFGBuilder took 1353.59 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 68.1 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:42,715 INFO L168 Benchmark]: TraceAbstraction took 6326.06 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 68.1 MB in the beginning and 110.2 MB in the end (delta: -42.1 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:42,719 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.22 ms. Allocated memory is still 142.1 MB. Free memory is still 112.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 142.1 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.05 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1353.59 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 68.1 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6326.06 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 68.1 MB in the beginning and 110.2 MB in the end (delta: -42.1 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 187]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 2 error locations. SAFE Result, 6.2s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 657 SDtfs, 563 SDslu, 602 SDs, 0 SdLazy, 540 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 407 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 207 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 89093 SizeOfPredicates, 38 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 207/391 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...