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/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:08,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:08,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:08,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:08,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:08,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:08,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:08,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:08,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:08,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:08,118 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:08,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:08,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:08,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:08,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:08,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:08,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:08,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:08,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:08,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:08,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:08,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:08,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:08,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:08,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:08,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:08,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:08,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:08,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:08,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:08,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:08,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:08,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:08,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:08,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:08,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:08,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:08,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:08,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:08,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:08,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:08,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:08,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:08,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:08,192 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:08,192 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:08,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2019-08-04 21:38:08,193 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2019-08-04 21:38:08,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:08,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:08,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:08,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:08,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:08,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:08,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:08,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:08,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:08,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/1) ... [2019-08-04 21:38:08,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:08,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:08,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:08,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:08,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (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-04 21:38:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:09,104 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:38:09,532 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:09,532 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:09,534 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:09 BoogieIcfgContainer [2019-08-04 21:38:09,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:09,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:09,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:09,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:09,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:08" (1/2) ... [2019-08-04 21:38:09,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fc847 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:09, skipping insertion in model container [2019-08-04 21:38:09,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:09" (2/2) ... [2019-08-04 21:38:09,552 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2019-08-04 21:38:09,577 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:09,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:09,613 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:09,642 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:09,642 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:09,643 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:09,643 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:09,643 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:09,643 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:09,643 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:09,644 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:09,644 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-04 21:38:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:09,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:09,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:09,695 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2019-08-04 21:38:09,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:09,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:09,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:09,879 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-04 21:38:09,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:09,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:09,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:09,904 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-04 21:38:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:10,106 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2019-08-04 21:38:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:10,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-04 21:38:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:10,123 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:38:10,124 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:38:10,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-04 21:38:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:38:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:38:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:38:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2019-08-04 21:38:10,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 10 [2019-08-04 21:38:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:10,172 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-08-04 21:38:10,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2019-08-04 21:38:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:10,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:10,174 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:10,174 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:10,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1998621291, now seen corresponding path program 1 times [2019-08-04 21:38:10,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:10,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:10,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:10,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:10,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:10,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:10,275 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 3 states. [2019-08-04 21:38:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:10,523 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2019-08-04 21:38:10,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:10,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-04 21:38:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:10,525 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:38:10,525 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:38:10,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-04 21:38:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:38:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:38:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:38:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-04 21:38:10,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 14 [2019-08-04 21:38:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:10,532 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-04 21:38:10,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-04 21:38:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:38:10,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:10,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:10,534 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1142573565, now seen corresponding path program 1 times [2019-08-04 21:38:10,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:10,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:10,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:38:10,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:10,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:10,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:10,605 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2019-08-04 21:38:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:10,753 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-08-04 21:38:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:10,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-04 21:38:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:10,755 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:38:10,756 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:38:10,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-04 21:38:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:38:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:38:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:38:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-08-04 21:38:10,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 19 [2019-08-04 21:38:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:10,763 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-08-04 21:38:10,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-08-04 21:38:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:38:10,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:10,764 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:10,765 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1071510880, now seen corresponding path program 1 times [2019-08-04 21:38:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:10,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:10,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-04 21:38:10,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:10,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:10,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:10,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:10,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:10,833 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 3 states. [2019-08-04 21:38:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:10,979 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-08-04 21:38:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:10,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-04 21:38:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:10,981 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:38:10,981 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:38:10,981 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-04 21:38:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:38:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:38:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:38:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-08-04 21:38:10,990 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2019-08-04 21:38:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:10,990 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-08-04 21:38:10,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2019-08-04 21:38:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:38:10,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:10,992 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:10,992 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:10,993 INFO L82 PathProgramCache]: Analyzing trace with hash -463581491, now seen corresponding path program 1 times [2019-08-04 21:38:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:11,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-04 21:38:11,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:11,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:11,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:11,090 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2019-08-04 21:38:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:11,190 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2019-08-04 21:38:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:11,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-04 21:38:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:11,192 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:38:11,192 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:38:11,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-04 21:38:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:38:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:38:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:38:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-08-04 21:38:11,199 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 32 [2019-08-04 21:38:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:11,200 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-08-04 21:38:11,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-08-04 21:38:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:38:11,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:11,201 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:11,201 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1711916507, now seen corresponding path program 1 times [2019-08-04 21:38:11,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:11,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:11,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:11,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:11,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:11,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:11,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:11,502 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 7 states. [2019-08-04 21:38:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:11,653 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-08-04 21:38:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:11,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-08-04 21:38:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:11,657 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:38:11,657 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:38:11,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:38:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2019-08-04 21:38:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:38:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-08-04 21:38:11,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 35 [2019-08-04 21:38:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:11,668 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-08-04 21:38:11,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-08-04 21:38:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:38:11,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:11,670 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:11,670 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1145499157, now seen corresponding path program 2 times [2019-08-04 21:38:11,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:11,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:11,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-04 21:38:11,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:11,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:11,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:11,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:11,779 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 3 states. [2019-08-04 21:38:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:11,925 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2019-08-04 21:38:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:11,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-08-04 21:38:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:11,931 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:38:11,931 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:38:11,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-04 21:38:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:38:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-08-04 21:38:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-04 21:38:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-08-04 21:38:11,941 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 48 [2019-08-04 21:38:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:11,941 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-08-04 21:38:11,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-08-04 21:38:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:38:11,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:11,944 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:11,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:11,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1373415361, now seen corresponding path program 3 times [2019-08-04 21:38:11,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:11,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:11,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-04 21:38:12,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:12,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:12,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:12,032 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 3 states. [2019-08-04 21:38:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:12,305 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-04 21:38:12,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:12,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-08-04 21:38:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:12,310 INFO L225 Difference]: With dead ends: 159 [2019-08-04 21:38:12,310 INFO L226 Difference]: Without dead ends: 159 [2019-08-04 21:38:12,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-04 21:38:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-04 21:38:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-08-04 21:38:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-04 21:38:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 195 transitions. [2019-08-04 21:38:12,325 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 195 transitions. Word has length 51 [2019-08-04 21:38:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:12,326 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 195 transitions. [2019-08-04 21:38:12,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 195 transitions. [2019-08-04 21:38:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:38:12,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:12,330 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:12,331 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1534825561, now seen corresponding path program 1 times [2019-08-04 21:38:12,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:12,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:12,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-04 21:38:12,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:12,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:12,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:12,421 INFO L87 Difference]: Start difference. First operand 156 states and 195 transitions. Second operand 3 states. [2019-08-04 21:38:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:12,639 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-04 21:38:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:12,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-04 21:38:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:12,643 INFO L225 Difference]: With dead ends: 159 [2019-08-04 21:38:12,643 INFO L226 Difference]: Without dead ends: 159 [2019-08-04 21:38:12,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-04 21:38:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-04 21:38:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-04 21:38:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:38:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2019-08-04 21:38:12,661 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 58 [2019-08-04 21:38:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:12,662 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2019-08-04 21:38:12,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2019-08-04 21:38:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:38:12,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:12,664 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:12,664 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2109828369, now seen corresponding path program 1 times [2019-08-04 21:38:12,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:12,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:12,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-04 21:38:12,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:12,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:12,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:12,754 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand 3 states. [2019-08-04 21:38:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:12,859 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-04 21:38:12,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:12,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-04 21:38:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:12,866 INFO L225 Difference]: With dead ends: 189 [2019-08-04 21:38:12,866 INFO L226 Difference]: Without dead ends: 189 [2019-08-04 21:38:12,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-04 21:38:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-04 21:38:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-08-04 21:38:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-04 21:38:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2019-08-04 21:38:12,872 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 60 [2019-08-04 21:38:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:12,873 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2019-08-04 21:38:12,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2019-08-04 21:38:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:38:12,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:12,874 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:12,874 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1969137301, now seen corresponding path program 1 times [2019-08-04 21:38:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:12,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:12,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-04 21:38:12,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:12,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:12,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:12,965 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand 3 states. [2019-08-04 21:38:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:13,046 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2019-08-04 21:38:13,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:13,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-04 21:38:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:13,049 INFO L225 Difference]: With dead ends: 186 [2019-08-04 21:38:13,049 INFO L226 Difference]: Without dead ends: 186 [2019-08-04 21:38:13,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-04 21:38:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-04 21:38:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-04 21:38:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-04 21:38:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2019-08-04 21:38:13,055 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 67 [2019-08-04 21:38:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:13,056 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2019-08-04 21:38:13,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2019-08-04 21:38:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:38:13,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:13,057 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:13,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1205794369, now seen corresponding path program 1 times [2019-08-04 21:38:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:13,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:13,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-04 21:38:13,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:13,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:13,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:13,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:13,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:13,152 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand 3 states. [2019-08-04 21:38:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:13,229 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2019-08-04 21:38:13,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-08-04 21:38:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:13,233 INFO L225 Difference]: With dead ends: 195 [2019-08-04 21:38:13,233 INFO L226 Difference]: Without dead ends: 195 [2019-08-04 21:38:13,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-04 21:38:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-04 21:38:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-08-04 21:38:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-04 21:38:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2019-08-04 21:38:13,239 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 69 [2019-08-04 21:38:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:13,240 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2019-08-04 21:38:13,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2019-08-04 21:38:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:38:13,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:13,241 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:13,242 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:13,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2078107493, now seen corresponding path program 1 times [2019-08-04 21:38:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:13,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:38:13,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-04 21:38:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:13,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:13,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:13,407 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand 4 states. [2019-08-04 21:38:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:13,595 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2019-08-04 21:38:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:13,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-08-04 21:38:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:13,598 INFO L225 Difference]: With dead ends: 225 [2019-08-04 21:38:13,598 INFO L226 Difference]: Without dead ends: 225 [2019-08-04 21:38:13,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 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-04 21:38:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-04 21:38:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2019-08-04 21:38:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-04 21:38:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2019-08-04 21:38:13,603 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 76 [2019-08-04 21:38:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:13,603 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2019-08-04 21:38:13,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2019-08-04 21:38:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:38:13,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:13,604 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:13,605 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1811919009, now seen corresponding path program 2 times [2019-08-04 21:38:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:13,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-04 21:38:13,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:13,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:13,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:13,849 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 5 states. [2019-08-04 21:38:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:14,335 INFO L93 Difference]: Finished difference Result 255 states and 291 transitions. [2019-08-04 21:38:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:14,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-08-04 21:38:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:14,338 INFO L225 Difference]: With dead ends: 255 [2019-08-04 21:38:14,338 INFO L226 Difference]: Without dead ends: 255 [2019-08-04 21:38:14,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-04 21:38:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-08-04 21:38:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-04 21:38:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 285 transitions. [2019-08-04 21:38:14,346 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 285 transitions. Word has length 86 [2019-08-04 21:38:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:14,346 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 285 transitions. [2019-08-04 21:38:14,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 285 transitions. [2019-08-04 21:38:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:38:14,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:14,348 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:14,348 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 909418205, now seen corresponding path program 3 times [2019-08-04 21:38:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:14,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:14,898 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-04 21:38:15,097 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-04 21:38:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-04 21:38:15,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:15,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:15,153 INFO L87 Difference]: Start difference. First operand 249 states and 285 transitions. Second operand 6 states. [2019-08-04 21:38:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:15,564 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2019-08-04 21:38:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:15,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-08-04 21:38:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:15,567 INFO L225 Difference]: With dead ends: 285 [2019-08-04 21:38:15,567 INFO L226 Difference]: Without dead ends: 285 [2019-08-04 21:38:15,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-04 21:38:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-08-04 21:38:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-08-04 21:38:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2019-08-04 21:38:15,575 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 96 [2019-08-04 21:38:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:15,575 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2019-08-04 21:38:15,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2019-08-04 21:38:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:38:15,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:15,577 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:15,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:15,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1395782169, now seen corresponding path program 4 times [2019-08-04 21:38:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:15,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:15,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:16,182 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-04 21:38:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-04 21:38:16,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:16,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:16,244 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 7 states. [2019-08-04 21:38:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:16,952 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2019-08-04 21:38:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:16,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-08-04 21:38:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:16,953 INFO L225 Difference]: With dead ends: 189 [2019-08-04 21:38:16,953 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:38:16,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:38:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:38:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:38:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:38:16,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-08-04 21:38:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:16,956 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:38:16,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:38:16,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:38:16,961 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:16 BoogieIcfgContainer [2019-08-04 21:38:16,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:16,963 INFO L168 Benchmark]: Toolchain (without parser) took 8711.23 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 108.9 MB in the beginning and 89.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,964 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:16,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,965 INFO L168 Benchmark]: Boogie Preprocessor took 60.02 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 105.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,966 INFO L168 Benchmark]: RCFGBuilder took 1180.78 ms. Allocated memory is still 132.6 MB. Free memory was 105.4 MB in the beginning and 64.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,967 INFO L168 Benchmark]: TraceAbstraction took 7425.33 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 64.8 MB in the beginning and 89.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:16,971 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.21 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.02 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 105.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1180.78 ms. Allocated memory is still 132.6 MB. Free memory was 105.4 MB in the beginning and 64.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7425.33 ms. Allocated memory was 132.6 MB in the beginning and 238.6 MB in the end (delta: 105.9 MB). Free memory was 64.8 MB in the beginning and 89.8 MB in the end (delta: -25.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 7.3s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 83 SDslu, 245 SDs, 0 SdLazy, 1058 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=15, 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, 16 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 296714 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4659 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 2670/2888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...