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/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:56:41,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:56:41,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:56:41,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:56:41,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:56:41,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:56:41,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:56:41,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:56:41,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:56:41,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:56:41,779 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:56:41,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:56:41,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:56:41,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:56:41,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:56:41,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:56:41,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:56:41,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:56:41,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:56:41,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:56:41,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:56:41,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:56:41,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:56:41,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:56:41,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:56:41,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:56:41,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:56:41,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:56:41,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:56:41,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:56:41,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:56:41,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:56:41,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:56:41,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:56:41,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:56:41,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:56:41,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:56:41,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:56:41,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:56:41,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:56:41,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:56:41,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:56:41,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:56:41,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:56:41,849 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:56:41,849 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:56:41,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl [2019-08-05 10:56:41,850 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl' [2019-08-05 10:56:41,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:56:41,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:56:41,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:41,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:56:41,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:56:41,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:41,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:41,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:41,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:56:41,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:56:41,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:56:41,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:41,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:41,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:41,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:42,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:42,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:42,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/1) ... [2019-08-05 10:56:42,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:56:42,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:56:42,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:56:42,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:56:42,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (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:56:42,081 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:56:42,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:56:42,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:56:42,573 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:56:42,573 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:56:42,575 INFO L202 PluginConnector]: Adding new model sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:42 BoogieIcfgContainer [2019-08-05 10:56:42,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:56:42,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:56:42,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:56:42,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:56:42,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:41" (1/2) ... [2019-08-05 10:56:42,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbfc994 and model type sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:56:42, skipping insertion in model container [2019-08-05 10:56:42,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:42" (2/2) ... [2019-08-05 10:56:42,590 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl [2019-08-05 10:56:42,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:56:42,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:56:42,628 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:56:42,656 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:56:42,656 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:56:42,657 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:56:42,657 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:56:42,657 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:56:42,657 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:56:42,657 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:56:42,658 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:56:42,658 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:56:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:56:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:56:42,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:42,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:56:42,684 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 28787175, now seen corresponding path program 1 times [2019-08-05 10:56:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:42,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:56:42,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:42,983 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:56:42,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:56:42,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:56:42,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:56:43,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:56:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:56:43,003 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 5 states. [2019-08-05 10:56:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:43,215 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 10:56:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:56:43,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:56:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:43,231 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:56:43,232 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:56:43,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:56:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:56:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:56:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:56:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:56:43,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-08-05 10:56:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:43,286 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:56:43,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:56:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:56:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:56:43,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:43,287 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:56:43,287 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:43,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1894723713, now seen corresponding path program 1 times [2019-08-05 10:56:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:43,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:56:43,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:43,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 10:56:43,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:43,636 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:43,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:43,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:43,655 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:43,779 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-08-05 10:56:43,780 INFO L567 ElimStorePlain]: treesize reduction 3, result has 85.0 percent of original size [2019-08-05 10:56:43,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:43,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:4 [2019-08-05 10:56:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:56:43,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:56:43,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:56:43,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:56:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:56:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:56:43,805 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-08-05 10:56:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:43,840 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:56:43,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:56:43,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 10:56:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:43,842 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:56:43,842 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:56:43,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:56:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:56:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:56:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:56:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:56:43,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 10:56:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:43,846 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:56:43,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:56:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:56:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:56:43,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:43,847 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:56:43,847 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash 262017386, now seen corresponding path program 1 times [2019-08-05 10:56:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:44,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:56:44,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:44,278 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-08-05 10:56:44,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:56:44,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:44,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:44,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-08-05 10:56:44,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:44,451 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:44,451 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:44,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:44,453 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:44,564 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:56:44,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:44,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:44,568 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:49, output treesize:25 [2019-08-05 10:56:44,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:44,945 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:56:45,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:45,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-08-05 10:56:45,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:45,155 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 10:56:45,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:45,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:45,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:45,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:45,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2019-08-05 10:56:45,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:45,367 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-08-05 10:56:45,368 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-08-05 10:56:45,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:45,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:65, output treesize:15 [2019-08-05 10:56:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:45,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:45,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:56:45,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:56:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:56:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:56:45,422 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 8 states. [2019-08-05 10:56:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:45,783 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 10:56:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:56:45,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:56:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:45,790 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:56:45,790 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:56:45,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:56:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:56:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 10:56:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:56:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:56:45,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-08-05 10:56:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:56:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:56:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:56:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:56:45,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:45,797 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:56:45,798 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:45,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1187728801, now seen corresponding path program 2 times [2019-08-05 10:56:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:45,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:56:45,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:46,297 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-08-05 10:56:46,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:56:46,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:46,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:46,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:56:46,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:46,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:46,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:46,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:43 [2019-08-05 10:56:46,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:46,570 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:46,580 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:46,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:46,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2019-08-05 10:56:46,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:46,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:46,628 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:46,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:46,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 70 [2019-08-05 10:56:46,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:46,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:46,805 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-08-05 10:56:46,806 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.3 percent of original size [2019-08-05 10:56:46,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:46,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:46,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:157, output treesize:63 [2019-08-05 10:56:46,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:46,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-08-05 10:56:47,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:47,143 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.2 percent of original size [2019-08-05 10:56:47,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:47,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:47,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:47,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 54 [2019-08-05 10:56:47,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,180 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:47,291 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-08-05 10:56:47,292 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-08-05 10:56:47,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:47,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:80, output treesize:46 [2019-08-05 10:56:47,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:47,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:56:47,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:56:47,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:56:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:56:47,431 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2019-08-05 10:56:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:47,876 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 10:56:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:56:47,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:56:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:47,878 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:56:47,878 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:56:47,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:56:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:56:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-08-05 10:56:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:56:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-05 10:56:47,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 9 [2019-08-05 10:56:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:47,882 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-05 10:56:47,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:56:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-05 10:56:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:56:47,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:47,883 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:56:47,883 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1604310204, now seen corresponding path program 3 times [2019-08-05 10:56:47,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:47,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:56:47,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:48,075 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-08-05 10:56:48,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:56:48,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:56:48,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:48,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:38 [2019-08-05 10:56:48,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:48,399 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:48,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:48,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 51 [2019-08-05 10:56:48,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:48,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:48,418 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:48,499 INFO L567 ElimStorePlain]: treesize reduction 7, result has 90.1 percent of original size [2019-08-05 10:56:48,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:48,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:48,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 41 [2019-08-05 10:56:48,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:48,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:48,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,597 INFO L567 ElimStorePlain]: treesize reduction 43, result has 49.4 percent of original size [2019-08-05 10:56:48,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,599 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:90, output treesize:10 [2019-08-05 10:56:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:48,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:48,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:56:48,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:56:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:56:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2019-08-05 10:56:48,622 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 9 states. [2019-08-05 10:56:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:49,007 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2019-08-05 10:56:49,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:56:49,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 10:56:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:49,008 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:56:49,008 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:56:49,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=158, Unknown=11, NotChecked=0, Total=210 [2019-08-05 10:56:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:56:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:56:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:56:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:56:49,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-08-05 10:56:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:49,010 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:56:49,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:56:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:56:49,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:56:49,015 INFO L202 PluginConnector]: Adding new model sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_49.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:49 BoogieIcfgContainer [2019-08-05 10:56:49,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:49,017 INFO L168 Benchmark]: Toolchain (without parser) took 7095.01 ms. Allocated memory was 133.7 MB in the beginning and 237.0 MB in the end (delta: 103.3 MB). Free memory was 109.1 MB in the beginning and 63.8 MB in the end (delta: 45.3 MB). Peak memory consumption was 148.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:49,018 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 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:56:49,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.27 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 107.2 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:56:49,020 INFO L168 Benchmark]: Boogie Preprocessor took 32.96 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 105.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:49,020 INFO L168 Benchmark]: RCFGBuilder took 564.09 ms. Allocated memory is still 133.7 MB. Free memory was 105.5 MB in the beginning and 86.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:49,021 INFO L168 Benchmark]: TraceAbstraction took 6435.69 ms. Allocated memory was 133.7 MB in the beginning and 237.0 MB in the end (delta: 103.3 MB). Free memory was 86.2 MB in the beginning and 63.8 MB in the end (delta: 22.4 MB). Peak memory consumption was 125.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:49,025 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 111.0 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 54.27 ms. Allocated memory is still 133.7 MB. Free memory was 108.9 MB in the beginning and 107.2 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.96 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 105.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 564.09 ms. Allocated memory is still 133.7 MB. Free memory was 105.5 MB in the beginning and 86.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6435.69 ms. Allocated memory was 133.7 MB in the beginning and 237.0 MB in the end (delta: 103.3 MB). Free memory was 86.2 MB in the beginning and 63.8 MB in the end (delta: 22.4 MB). Peak memory consumption was 125.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 237]: 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, 7 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 6 SDslu, 19 SDs, 0 SdLazy, 195 SolverSat, 27 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 34 ConstructedInterpolants, 19 QuantifiedInterpolants, 8323 SizeOfPredicates, 128 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...