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/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:45,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:45,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:45,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:45,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:45,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:45,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:45,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:45,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:45,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:45,106 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:45,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:45,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:45,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:45,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:45,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:45,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:45,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:45,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:45,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:45,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:45,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:45,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:45,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:45,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:45,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:45,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:45,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:45,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:45,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:45,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:45,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:45,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:45,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:45,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:45,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:45,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:45,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:45,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:45,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:45,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:45,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:45,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:45,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:45,200 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:45,201 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:45,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2019-08-04 21:38:45,202 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2019-08-04 21:38:45,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:45,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:45,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:45,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:45,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:45,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:45,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:45,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:45,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:45,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/1) ... [2019-08-04 21:38:45,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:45,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:45,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:45,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:45,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (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:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:46,101 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:38:46,894 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:46,894 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-08-04 21:38:46,896 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:46 BoogieIcfgContainer [2019-08-04 21:38:46,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:46,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:46,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:46,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:46,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:45" (1/2) ... [2019-08-04 21:38:46,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476d6ce2 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:46, skipping insertion in model container [2019-08-04 21:38:46,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:46" (2/2) ... [2019-08-04 21:38:46,904 INFO L109 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2019-08-04 21:38:46,914 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:46,923 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:46,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:46,964 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:46,964 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:46,965 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:46,965 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:46,965 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:46,965 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:46,965 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:46,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:46,966 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-08-04 21:38:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:46,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:46,994 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2019-08-04 21:38:47,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,182 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:47,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:47,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:47,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:47,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:47,215 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-08-04 21:38:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,358 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-04 21:38:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:47,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-04 21:38:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,372 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:38:47,372 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:47,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:38:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-04 21:38:47,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 8 [2019-08-04 21:38:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,411 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-04 21:38:47,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-04 21:38:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:38:47,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,412 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:47,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1182290145, now seen corresponding path program 1 times [2019-08-04 21:38:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:47,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:47,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:47,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:47,526 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2019-08-04 21:38:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,632 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-08-04 21:38:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:47,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-04 21:38:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,634 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:38:47,634 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:38:47,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:38:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:38:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:38:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-08-04 21:38:47,641 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2019-08-04 21:38:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,641 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-08-04 21:38:47,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-08-04 21:38:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:38:47,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,643 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:47,643 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1341253337, now seen corresponding path program 1 times [2019-08-04 21:38:47,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:38:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:47,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:38:47,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:47,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:47,878 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-08-04 21:38:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,096 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-08-04 21:38:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:48,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-04 21:38:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,102 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:48,102 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:48,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-08-04 21:38:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:38:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-08-04 21:38:48,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 19 [2019-08-04 21:38:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,108 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-08-04 21:38:48,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-08-04 21:38:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:38:48,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,110 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:48,110 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1614133373, now seen corresponding path program 1 times [2019-08-04 21:38:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:48,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:48,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:48,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:48,522 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 8 states. [2019-08-04 21:38:48,951 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-08-04 21:38:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,302 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2019-08-04 21:38:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:49,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-04 21:38:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,307 INFO L225 Difference]: With dead ends: 102 [2019-08-04 21:38:49,307 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:38:49,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:38:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-08-04 21:38:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:38:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-08-04 21:38:49,317 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 24 [2019-08-04 21:38:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,318 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-08-04 21:38:49,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2019-08-04 21:38:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:38:49,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,319 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:49,320 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash -310818203, now seen corresponding path program 1 times [2019-08-04 21:38:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-04 21:38:49,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:49,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:49,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:49,401 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand 3 states. [2019-08-04 21:38:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,474 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-08-04 21:38:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:49,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-04 21:38:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,476 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:38:49,476 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:38:49,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:49,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:38:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:38:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:38:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-08-04 21:38:49,484 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 28 [2019-08-04 21:38:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,485 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-08-04 21:38:49,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-08-04 21:38:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:38:49,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,486 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:49,487 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 980277399, now seen corresponding path program 2 times [2019-08-04 21:38:49,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:49,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-04 21:38:49,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:49,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:49,731 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 5 states. [2019-08-04 21:38:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,908 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-08-04 21:38:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:49,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-04 21:38:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,909 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:38:49,909 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:38:49,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:38:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:38:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:38:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-08-04 21:38:49,915 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 29 [2019-08-04 21:38:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,915 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-08-04 21:38:49,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-08-04 21:38:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:38:49,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,917 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-04 21:38:49,917 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 153677137, now seen corresponding path program 3 times [2019-08-04 21:38:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-04 21:38:50,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:50,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:50,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:50,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:50,009 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 3 states. [2019-08-04 21:38:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:50,059 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-08-04 21:38:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:50,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-08-04 21:38:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:50,060 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:50,060 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:50,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:38:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:38:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-08-04 21:38:50,065 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 34 [2019-08-04 21:38:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:50,065 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-08-04 21:38:50,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-08-04 21:38:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:38:50,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:50,066 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:50,067 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1948286985, now seen corresponding path program 1 times [2019-08-04 21:38:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:50,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:38:50,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:50,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:50,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:50,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:50,627 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-08-04 21:38:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:51,529 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-04 21:38:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:38:51,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-08-04 21:38:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:51,533 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:38:51,534 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:38:51,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:38:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2019-08-04 21:38:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:38:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-08-04 21:38:51,538 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2019-08-04 21:38:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-08-04 21:38:51,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-08-04 21:38:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:38:51,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:51,541 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:51,541 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1271286031, now seen corresponding path program 2 times [2019-08-04 21:38:51,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:51,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:38:51,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-04 21:38:51,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:51,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:38:51,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:51,719 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-08-04 21:38:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:51,840 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:38:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:51,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-08-04 21:38:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:51,842 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:38:51,842 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:38:51,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:38:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:38:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:38:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:38:51,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 44 [2019-08-04 21:38:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:51,847 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:38:51,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:38:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:38:51,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:51,849 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-04 21:38:51,849 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1353494121, now seen corresponding path program 3 times [2019-08-04 21:38:51,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:51,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:51,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-04 21:38:51,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:51,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:51,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:51,964 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 3 states. [2019-08-04 21:38:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:52,096 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2019-08-04 21:38:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:52,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-08-04 21:38:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:52,098 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:38:52,098 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:38:52,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:38:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:38:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:38:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:38:52,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-08-04 21:38:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:52,100 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:38:52,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:38:52,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:38:52,109 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:52 BoogieIcfgContainer [2019-08-04 21:38:52,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:52,112 INFO L168 Benchmark]: Toolchain (without parser) took 6830.52 ms. Allocated memory was 134.2 MB in the beginning and 229.6 MB in the end (delta: 95.4 MB). Free memory was 109.7 MB in the beginning and 155.1 MB in the end (delta: -45.5 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:52,113 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:52,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.79 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 107.9 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:52,116 INFO L168 Benchmark]: Boogie Preprocessor took 32.54 ms. Allocated memory is still 134.2 MB. Free memory was 107.9 MB in the beginning and 106.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:52,117 INFO L168 Benchmark]: RCFGBuilder took 1541.36 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 106.4 MB in the beginning and 144.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:52,118 INFO L168 Benchmark]: TraceAbstraction took 5211.49 ms. Allocated memory was 169.9 MB in the beginning and 229.6 MB in the end (delta: 59.8 MB). Free memory was 144.7 MB in the beginning and 155.1 MB in the end (delta: -10.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:52,123 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.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.79 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 107.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.54 ms. Allocated memory is still 134.2 MB. Free memory was 107.9 MB in the beginning and 106.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1541.36 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 106.4 MB in the beginning and 144.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5211.49 ms. Allocated memory was 169.9 MB in the beginning and 229.6 MB in the end (delta: 59.8 MB). Free memory was 144.7 MB in the beginning and 155.1 MB in the end (delta: -10.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: 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, 13 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 120 SDslu, 262 SDs, 0 SdLazy, 349 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 56 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 31806 SizeOfPredicates, 71 NumberOfNonLiveVariables, 2116 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 388/427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...