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-05 10:21:39,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:39,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:39,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:39,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:39,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:39,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:39,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:39,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:39,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:39,582 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:39,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:39,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:39,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:39,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:39,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:39,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:39,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:39,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:39,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:39,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:39,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:39,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:39,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:39,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:39,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:39,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:39,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:39,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:39,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:39,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:39,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:39,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:39,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:39,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:39,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:39,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:39,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:39,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:39,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:39,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:39,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:39,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:39,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:39,663 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:39,664 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:39,664 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-05 10:21:39,665 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2019-08-05 10:21:39,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:39,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:39,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:39,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:39,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:39,765 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,778 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:39,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:39,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:39,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:39,809 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,810 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,815 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,815 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,839 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,846 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,849 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 05.08 10:21:39" (1/1) ... [2019-08-05 10:21:39,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:39,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:39,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:39,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:39,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:21:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:40,537 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:21:41,257 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:41,258 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-08-05 10:21:41,259 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:41 BoogieIcfgContainer [2019-08-05 10:21:41,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:41,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:41,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:41,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:41,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:39" (1/2) ... [2019-08-05 10:21:41,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daeb602 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:41, skipping insertion in model container [2019-08-05 10:21:41,269 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 05.08 10:21:41" (2/2) ... [2019-08-05 10:21:41,272 INFO L109 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2019-08-05 10:21:41,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:41,292 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:41,307 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:41,337 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:41,338 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:41,338 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:41,338 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:41,338 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:41,338 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:41,339 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:41,339 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:41,339 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-08-05 10:21:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:41,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:41,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:41,363 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2019-08-05 10:21:41,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:41,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:41,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:41,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:41,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:41,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:41,536 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-08-05 10:21:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:41,679 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 10:21:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:41,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:21:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:41,695 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:41,695 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:21:41,697 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-05 10:21:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:21:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:21:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 10:21:41,748 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 8 [2019-08-05 10:21:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:41,749 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 10:21:41,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 10:21:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:41,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:41,751 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:41,751 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1182290145, now seen corresponding path program 1 times [2019-08-05 10:21:41,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:41,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:41,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:41,923 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-05 10:21:41,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:41,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:41,931 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2019-08-05 10:21:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:42,076 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2019-08-05 10:21:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:42,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 10:21:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:42,078 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:21:42,078 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:21:42,079 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-05 10:21:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:21:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:21:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:21:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-08-05 10:21:42,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2019-08-05 10:21:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:42,087 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-08-05 10:21:42,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-08-05 10:21:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:42,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:42,089 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:42,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1341253337, now seen corresponding path program 1 times [2019-08-05 10:21:42,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:42,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:42,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:42,310 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-05 10:21:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:21:42,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:42,316 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-08-05 10:21:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:42,461 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-08-05 10:21:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:42,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-05 10:21:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:42,462 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:21:42,463 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:21:42,464 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-05 10:21:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:21:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-08-05 10:21:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:21:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-08-05 10:21:42,470 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 19 [2019-08-05 10:21:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:42,470 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-08-05 10:21:42,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-08-05 10:21:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:21:42,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:42,471 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:42,472 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1614133373, now seen corresponding path program 1 times [2019-08-05 10:21:42,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:42,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:21:42,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:42,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:43,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:43,127 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-05 10:21:43,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:43,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:43,129 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 8 states. [2019-08-05 10:21:43,423 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-08-05 10:21:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:43,662 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2019-08-05 10:21:43,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:43,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:21:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:43,666 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:21:43,666 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:21:43,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:21:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-08-05 10:21:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:21:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-08-05 10:21:43,676 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 24 [2019-08-05 10:21:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:43,676 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-08-05 10:21:43,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2019-08-05 10:21:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:21:43,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:43,678 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:43,678 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash -310818203, now seen corresponding path program 1 times [2019-08-05 10:21:43,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:43,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:43,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:43,756 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-05 10:21:43,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:43,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:43,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:43,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:43,758 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand 3 states. [2019-08-05 10:21:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:43,800 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-08-05 10:21:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:43,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:21:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:43,802 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:21:43,802 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:21:43,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:21:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:21:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:21:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-08-05 10:21:43,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 28 [2019-08-05 10:21:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:43,810 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-08-05 10:21:43,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-08-05 10:21:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:21:43,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:43,811 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:21:43,811 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash 980277399, now seen corresponding path program 2 times [2019-08-05 10:21:43,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:43,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:43,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:43,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:44,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:44,040 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-05 10:21:44,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:44,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:44,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:44,042 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 5 states. [2019-08-05 10:21:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:44,271 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-08-05 10:21:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:44,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 10:21:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:44,273 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:21:44,273 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:21:44,273 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-05 10:21:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:21:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:21:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:21:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-08-05 10:21:44,279 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 29 [2019-08-05 10:21:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:44,279 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-08-05 10:21:44,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-08-05 10:21:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:21:44,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,281 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:21:44,281 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 153677137, now seen corresponding path program 3 times [2019-08-05 10:21:44,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:44,386 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-05 10:21:44,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:44,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:44,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:44,389 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 3 states. [2019-08-05 10:21:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:44,492 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-08-05 10:21:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:44,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-08-05 10:21:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:44,493 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:21:44,493 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:21:44,494 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-05 10:21:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:21:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:21:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:21:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-08-05 10:21:44,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 34 [2019-08-05 10:21:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:44,504 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-08-05 10:21:44,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-08-05 10:21:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:21:44,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,508 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:44,508 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1948286985, now seen corresponding path program 1 times [2019-08-05 10:21:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:44,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:44,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:44,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:21:45,265 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-05 10:21:45,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:45,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:45,267 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-08-05 10:21:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,122 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:21:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:46,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-08-05 10:21:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,124 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:21:46,124 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:21:46,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:21:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2019-08-05 10:21:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:21:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-08-05 10:21:46,135 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2019-08-05 10:21:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,135 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-08-05 10:21:46,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-08-05 10:21:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:21:46,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,139 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:21:46,140 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1271286031, now seen corresponding path program 2 times [2019-08-05 10:21:46,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,365 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 10:21:46,389 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-05 10:21:46,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:21:46,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:46,393 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-08-05 10:21:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,457 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:21:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:46,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-08-05 10:21:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,459 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:21:46,459 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:21:46,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:21:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:21:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:21:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:21:46,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 44 [2019-08-05 10:21:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,465 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:21:46,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:21:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:21:46,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,467 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:21:46,467 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1353494121, now seen corresponding path program 3 times [2019-08-05 10:21:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,543 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-05 10:21:46,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:46,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:46,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:46,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:46,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:46,544 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 3 states. [2019-08-05 10:21:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,576 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2019-08-05 10:21:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:46,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-08-05 10:21:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,577 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:21:46,577 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:21:46,577 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-05 10:21:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:21:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:21:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:21:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:21:46,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-08-05 10:21:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,579 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:21:46,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:21:46,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:21:46,583 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:46 BoogieIcfgContainer [2019-08-05 10:21:46,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:46,586 INFO L168 Benchmark]: Toolchain (without parser) took 6840.59 ms. Allocated memory was 133.2 MB in the beginning and 234.9 MB in the end (delta: 101.7 MB). Free memory was 109.8 MB in the beginning and 162.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,587 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.60 ms. Allocated memory is still 133.2 MB. Free memory was 109.8 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,589 INFO L168 Benchmark]: Boogie Preprocessor took 57.62 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 106.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,590 INFO L168 Benchmark]: RCFGBuilder took 1403.50 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 106.5 MB in the beginning and 147.0 MB in the end (delta: -40.5 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,591 INFO L168 Benchmark]: TraceAbstraction took 5321.02 ms. Allocated memory was 170.9 MB in the beginning and 234.9 MB in the end (delta: 64.0 MB). Free memory was 147.0 MB in the beginning and 162.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:46,595 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 133.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.60 ms. Allocated memory is still 133.2 MB. Free memory was 109.8 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.62 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 106.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1403.50 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 106.5 MB in the beginning and 147.0 MB in the end (delta: -40.5 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5321.02 ms. Allocated memory was 170.9 MB in the beginning and 234.9 MB in the end (delta: 64.0 MB). Free memory was 147.0 MB in the beginning and 162.8 MB in the end (delta: -15.8 MB). Peak memory consumption was 48.2 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.2s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 2.3s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.1s 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.5s SatisfiabilityAnalysisTime, 1.9s 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...