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/alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:57:58,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:57:58,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:57:58,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:57:58,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:57:58,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:57:58,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:57:58,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:57:58,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:57:58,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:57:58,557 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:57:58,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:57:58,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:57:58,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:57:58,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:57:58,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:57:58,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:57:58,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:57:58,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:57:58,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:57:58,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:57:58,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:57:58,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:57:58,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:57:58,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:57:58,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:57:58,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:57:58,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:57:58,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:57:58,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:57:58,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:57:58,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:57:58,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:57:58,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:57:58,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:57:58,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:57:58,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:57:58,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:57:58,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:57:58,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:57:58,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:57:58,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:57:58,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:57:58,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:57:58,645 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:57:58,646 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:57:58,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl [2019-08-05 10:57:58,647 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl' [2019-08-05 10:57:58,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:58,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:58,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:58,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:58,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:58,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:58,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:58,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:58,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:58,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:58,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:58,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:58,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:58,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (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:57:58,889 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:58,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:58,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:59,565 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:59,565 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:59,567 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:59 BoogieIcfgContainer [2019-08-05 10:57:59,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:59,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:59,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:59,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:59,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/2) ... [2019-08-05 10:57:59,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d6c0d and model type alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:59, skipping insertion in model container [2019-08-05 10:57:59,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:59" (2/2) ... [2019-08-05 10:57:59,581 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl [2019-08-05 10:57:59,603 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:59,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:59,630 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:59,661 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:59,662 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:59,662 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:59,662 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:59,663 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:59,663 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:59,663 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:59,663 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:59,663 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:57:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:57:59,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:59,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:57:59,689 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 889571756, now seen corresponding path program 1 times [2019-08-05 10:57:59,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:59,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:57:59,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:59,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:57:59,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:00,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:00,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:00,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 10:58:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:00,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:00,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:58:00,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:58:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:58:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:58:00,204 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 10:58:00,408 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:58:00,678 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:58:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:00,857 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 10:58:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:58:00,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:58:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:00,869 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:58:00,869 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:58:00,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:58:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2019-08-05 10:58:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:58:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:58:00,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:58:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:00,904 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:58:00,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:58:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:58:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:58:00,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:00,905 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:00,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 180034807, now seen corresponding path program 1 times [2019-08-05 10:58:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:01,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:58:01,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:01,086 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:58:01,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:01,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 10:58:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:58:01,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:01,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:58:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:58:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:58:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:58:01,173 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 10:58:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:01,317 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 10:58:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:58:01,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:58:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:01,319 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:58:01,319 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:58:01,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:58:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:58:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:58:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:58:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:58:01,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:58:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:01,324 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:58:01,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:58:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:58:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:58:01,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:01,325 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:01,325 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1863532945, now seen corresponding path program 1 times [2019-08-05 10:58:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:01,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:58:01,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:01,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:01,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,723 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:58:01,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,765 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 13 treesize of output 9 [2019-08-05 10:58:01,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,843 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 13 treesize of output 9 [2019-08-05 10:58:01,844 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,918 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2019-08-05 10:58:02,024 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 17 treesize of output 9 [2019-08-05 10:58:02,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,059 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 15 treesize of output 7 [2019-08-05 10:58:02,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-08-05 10:58:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:58:02,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:58:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:58:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:02,203 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 10:58:02,498 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 10:58:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:02,930 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:58:02,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:58:02,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:58:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:02,933 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:58:02,933 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:58:02,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:58:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:58:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:58:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:58:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:58:02,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:58:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:02,937 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:58:02,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:58:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:58:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:58:02,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:02,938 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:58:02,938 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -146133092, now seen corresponding path program 2 times [2019-08-05 10:58:02,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:03,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:58:03,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:03,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:03,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,227 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 13 treesize of output 9 [2019-08-05 10:58:03,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:24 [2019-08-05 10:58:03,308 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 23 treesize of output 13 [2019-08-05 10:58:03,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:03,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:31 [2019-08-05 10:58:03,443 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 28 treesize of output 16 [2019-08-05 10:58:03,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:03,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2019-08-05 10:58:03,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2019-08-05 10:58:03,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:03,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2019-08-05 10:58:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:58:03,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:58:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:58:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:03,754 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2019-08-05 10:58:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:03,979 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:58:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:58:03,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:58:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:03,981 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:58:03,982 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:58:03,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:58:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:58:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:58:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:58:03,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:58:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:03,986 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:58:03,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:58:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:58:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:58:03,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:03,987 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:58:03,987 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1936357174, now seen corresponding path program 3 times [2019-08-05 10:58:03,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:04,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:58:04,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:04,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:04,287 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:04,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2019-08-05 10:58:04,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,409 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-08-05 10:58:04,409 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.2 percent of original size [2019-08-05 10:58:04,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 10:58:04,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:04,471 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:04,503 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:04,539 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,570 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:51 [2019-08-05 10:58:04,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-08-05 10:58:04,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:04,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-08-05 10:58:04,758 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,788 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:04,793 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 7 treesize of output 3 [2019-08-05 10:58:04,794 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-08-05 10:58:04,823 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:04,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2019-08-05 10:58:04,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:04,936 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:05,030 INFO L567 ElimStorePlain]: treesize reduction 20, result has 77.8 percent of original size [2019-08-05 10:58:05,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:05,033 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:122, output treesize:67 [2019-08-05 10:58:05,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:05,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:05,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:05,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:05,251 INFO L567 ElimStorePlain]: treesize reduction 11, result has 88.9 percent of original size [2019-08-05 10:58:05,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:05,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:05,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2019-08-05 10:58:05,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:05,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:05,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:05,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:76 [2019-08-05 10:58:05,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:05,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:05,494 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:58:05,495 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 60 [2019-08-05 10:58:05,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:05,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:05,498 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:58:05,557 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.0 percent of original size [2019-08-05 10:58:05,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:05,566 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2019-08-05 10:58:05,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:05,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:05,606 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-08-05 10:58:05,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:05,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:23 [2019-08-05 10:58:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:58:05,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:58:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:58:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:58:05,703 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2019-08-05 10:58:07,621 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-08-05 10:58:08,635 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 10:58:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:08,669 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 10:58:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:58:08,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-08-05 10:58:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:08,676 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:58:08,677 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:58:08,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:58:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:58:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-08-05 10:58:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:58:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 10:58:08,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-08-05 10:58:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:08,681 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 10:58:08,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:58:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 10:58:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:58:08,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:08,682 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:58:08,682 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1118474241, now seen corresponding path program 4 times [2019-08-05 10:58:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:08,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:58:08,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:08,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:08,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,041 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:58:09,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:09,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:09,076 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:09,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2019-08-05 10:58:09,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,159 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.0 percent of original size [2019-08-05 10:58:09,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 10:58:09,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:09,207 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:09,288 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:09,309 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,330 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:82, output treesize:51 [2019-08-05 10:58:09,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-08-05 10:58:09,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,471 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:09,480 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 7 treesize of output 3 [2019-08-05 10:58:09,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-08-05 10:58:09,520 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,551 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:09,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 71 [2019-08-05 10:58:09,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:09,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:09,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:09,569 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:09,641 INFO L567 ElimStorePlain]: treesize reduction 81, result has 52.6 percent of original size [2019-08-05 10:58:09,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:09,643 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:133, output treesize:74 [2019-08-05 10:58:09,692 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 31 treesize of output 17 [2019-08-05 10:58:09,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:09,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:74 [2019-08-05 10:58:09,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:09,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:09,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:10,009 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:58:10,010 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 83 [2019-08-05 10:58:10,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:10,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:10,014 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:58:10,089 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.7 percent of original size [2019-08-05 10:58:10,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:10,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,117 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 62 [2019-08-05 10:58:10,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:10,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:10,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,197 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-08-05 10:58:10,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:10,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:153, output treesize:54 [2019-08-05 10:58:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:58:10,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:10,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:58:10,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:58:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:58:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:58:10,241 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2019-08-05 10:58:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:10,561 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 10:58:10,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:58:10,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:58:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:10,563 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:58:10,563 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:58:10,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:58:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:58:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:58:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:58:10,567 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2019-08-05 10:58:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:58:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:58:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:58:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:58:10,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:10,568 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:58:10,568 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1754742864, now seen corresponding path program 5 times [2019-08-05 10:58:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:10,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:58:10,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:10,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:10,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,038 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:58:11,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:11,184 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:58:11,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,203 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:11,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2019-08-05 10:58:11,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,339 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-08-05 10:58:11,339 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.3 percent of original size [2019-08-05 10:58:11,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 10:58:11,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:11,384 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:11,414 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:11,447 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,467 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:87, output treesize:56 [2019-08-05 10:58:11,642 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-08-05 10:58:11,857 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:11,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:11,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,133 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 10:58:12,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:12,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:12,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 10:58:12,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:12,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:12,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,346 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-08-05 10:58:12,347 INFO L567 ElimStorePlain]: treesize reduction 46, result has 82.0 percent of original size [2019-08-05 10:58:12,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2019-08-05 10:58:12,358 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,485 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-08-05 10:58:12,486 INFO L567 ElimStorePlain]: treesize reduction 10, result has 95.0 percent of original size [2019-08-05 10:58:12,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:12,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 141 [2019-08-05 10:58:12,580 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,682 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-08-05 10:58:12,682 INFO L567 ElimStorePlain]: treesize reduction 42, result has 77.0 percent of original size [2019-08-05 10:58:12,716 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:12,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:12,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 75 [2019-08-05 10:58:12,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:12,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:12,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:12,747 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:12,846 INFO L567 ElimStorePlain]: treesize reduction 154, result has 46.2 percent of original size [2019-08-05 10:58:12,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,847 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:202, output treesize:155 [2019-08-05 10:58:12,902 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:12,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:12,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-08-05 10:58:12,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,051 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:58:13,052 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.7 percent of original size [2019-08-05 10:58:13,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-08-05 10:58:13,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,144 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|], 6=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:13,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-08-05 10:58:13,153 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-08-05 10:58:13,210 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:13,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 146 [2019-08-05 10:58:13,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:13,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,315 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:13,469 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-08-05 10:58:13,470 INFO L567 ElimStorePlain]: treesize reduction 263, result has 33.4 percent of original size [2019-08-05 10:58:13,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:13,472 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:239, output treesize:173 [2019-08-05 10:58:13,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:13,883 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-08-05 10:58:13,883 INFO L341 Elim1Store]: treesize reduction 8, result has 87.1 percent of original size [2019-08-05 10:58:13,883 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 134 [2019-08-05 10:58:13,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:14,088 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-08-05 10:58:14,088 INFO L567 ElimStorePlain]: treesize reduction 42, result has 74.4 percent of original size [2019-08-05 10:58:14,139 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-08-05 10:58:14,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2019-08-05 10:58:14,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:14,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:14,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:14,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,268 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-08-05 10:58:14,269 INFO L567 ElimStorePlain]: treesize reduction 27, result has 76.1 percent of original size [2019-08-05 10:58:14,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:14,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:233, output treesize:79 [2019-08-05 10:58:14,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-08-05 10:58:14,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,421 INFO L567 ElimStorePlain]: treesize reduction 9, result has 89.5 percent of original size [2019-08-05 10:58:14,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:14,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:14,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2019-08-05 10:58:14,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:14,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:54 [2019-08-05 10:58:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:14,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:58:14,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:58:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:58:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:14,637 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 12 states. [2019-08-05 10:58:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:27,828 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-08-05 10:58:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:58:27,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-08-05 10:58:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:27,831 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:58:27,831 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:58:27,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:58:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:58:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-08-05 10:58:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:58:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-08-05 10:58:27,836 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-08-05 10:58:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:27,836 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-08-05 10:58:27,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:58:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-08-05 10:58:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:58:27,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:27,837 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2019-08-05 10:58:27,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1614185829, now seen corresponding path program 6 times [2019-08-05 10:58:27,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:28,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:58:28,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:28,263 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:58:28,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:28,283 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:28,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 5 [2019-08-05 10:58:28,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:28,878 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-08-05 10:58:28,878 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.7 percent of original size [2019-08-05 10:58:28,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:28,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 10:58:28,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:29,092 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-08-05 10:58:29,093 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.4 percent of original size [2019-08-05 10:58:29,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:29,101 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:29,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:29,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:29,147 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:29,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:29,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:29,184 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:29,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:29,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:29,210 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:93, output treesize:67 [2019-08-05 10:58:29,652 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-08-05 10:58:29,923 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:58:29,995 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:30,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:30,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:30,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:30,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:30,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 10:58:30,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:30,292 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-08-05 10:58:30,292 INFO L567 ElimStorePlain]: treesize reduction 46, result has 80.6 percent of original size [2019-08-05 10:58:30,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 10:58:30,301 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:30,425 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-08-05 10:58:30,426 INFO L567 ElimStorePlain]: treesize reduction 10, result has 94.5 percent of original size [2019-08-05 10:58:30,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:30,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 77 [2019-08-05 10:58:30,461 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:30,576 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-08-05 10:58:30,576 INFO L567 ElimStorePlain]: treesize reduction 46, result has 77.1 percent of original size [2019-08-05 10:58:30,582 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:30,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:30,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 83 [2019-08-05 10:58:30,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:30,596 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:30,704 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-08-05 10:58:30,704 INFO L567 ElimStorePlain]: treesize reduction 83, result has 63.8 percent of original size [2019-08-05 10:58:30,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:30,706 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:184, output treesize:175 [2019-08-05 10:58:30,767 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:30,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:30,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-08-05 10:58:30,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:30,959 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-08-05 10:58:30,960 INFO L567 ElimStorePlain]: treesize reduction 3, result has 99.0 percent of original size [2019-08-05 10:58:30,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:30,993 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:30,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-08-05 10:58:30,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:31,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:31,072 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|], 6=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:31,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:31,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-08-05 10:58:31,081 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:31,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:31,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:31,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2019-08-05 10:58:31,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:31,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:31,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:31,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:31,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 176 [2019-08-05 10:58:31,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:31,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:31,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:31,315 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-08-05 10:58:31,523 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-08-05 10:58:31,523 INFO L567 ElimStorePlain]: treesize reduction 1124, result has 14.4 percent of original size [2019-08-05 10:58:31,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:31,525 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:306, output treesize:239 [2019-08-05 10:58:31,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2019-08-05 10:58:31,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:31,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:31,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:31,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:237, output treesize:217 [2019-08-05 10:58:31,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,498 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-08-05 10:58:32,563 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:32,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:32,619 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 188 [2019-08-05 10:58:32,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:32,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:32,863 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2019-08-05 10:58:32,863 INFO L567 ElimStorePlain]: treesize reduction 325, result has 38.0 percent of original size [2019-08-05 10:58:32,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:32,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:32,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:33,080 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-08-05 10:58:33,081 INFO L341 Elim1Store]: treesize reduction 16, result has 83.3 percent of original size [2019-08-05 10:58:33,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 147 [2019-08-05 10:58:33,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:33,147 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:34,567 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-08-05 10:58:34,567 INFO L567 ElimStorePlain]: treesize reduction 65, result has 63.3 percent of original size [2019-08-05 10:58:34,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:34,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:370, output treesize:92 [2019-08-05 10:58:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:34,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:34,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:58:34,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:58:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:58:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:58:34,635 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 13 states. [2019-08-05 10:58:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:39,243 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 10:58:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:58:39,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-08-05 10:58:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:39,245 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:58:39,245 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:58:39,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:58:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:58:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:58:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:58:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 10:58:39,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2019-08-05 10:58:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:39,248 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 10:58:39,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:58:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 10:58:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:58:39,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:39,249 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1] [2019-08-05 10:58:39,249 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash -977917206, now seen corresponding path program 7 times [2019-08-05 10:58:39,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:39,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 10:58:39,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:39,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:39,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,750 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:58:39,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:39,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-08-05 10:58:39,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,945 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:58:39,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:39,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-08-05 10:58:39,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:39,991 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:40,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:40,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-08-05 10:58:40,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,091 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.2 percent of original size [2019-08-05 10:58:40,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 10:58:40,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,205 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.8 percent of original size [2019-08-05 10:58:40,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:58:40,212 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:40,267 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:40,319 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,358 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:107, output treesize:86 [2019-08-05 10:58:40,402 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:40,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:40,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2019-08-05 10:58:40,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,592 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-08-05 10:58:40,593 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.0 percent of original size [2019-08-05 10:58:40,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 10:58:40,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,808 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-08-05 10:58:40,809 INFO L567 ElimStorePlain]: treesize reduction 46, result has 80.9 percent of original size [2019-08-05 10:58:40,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 10:58:40,816 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,953 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-08-05 10:58:40,954 INFO L567 ElimStorePlain]: treesize reduction 10, result has 94.6 percent of original size [2019-08-05 10:58:40,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 77 [2019-08-05 10:58:40,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:40,996 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,137 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-08-05 10:58:41,138 INFO L567 ElimStorePlain]: treesize reduction 49, result has 77.2 percent of original size [2019-08-05 10:58:41,142 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:41,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 79 [2019-08-05 10:58:41,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:41,156 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:41,285 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-08-05 10:58:41,285 INFO L567 ElimStorePlain]: treesize reduction 79, result has 66.4 percent of original size [2019-08-05 10:58:41,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:41,287 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:212, output treesize:185 [2019-08-05 10:58:41,332 INFO L392 ElimStorePlain]: Different costs {6=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 10=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:41,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2019-08-05 10:58:41,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,568 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-08-05 10:58:41,568 INFO L567 ElimStorePlain]: treesize reduction 17, result has 94.8 percent of original size [2019-08-05 10:58:41,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-08-05 10:58:41,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,911 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-08-05 10:58:41,912 INFO L567 ElimStorePlain]: treesize reduction 96, result has 77.8 percent of original size [2019-08-05 10:58:41,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2019-08-05 10:58:41,975 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:42,669 WARN L188 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-08-05 10:58:42,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:42,866 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:58:42,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:42,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2019-08-05 10:58:42,867 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:44,290 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-08-05 10:58:44,291 INFO L567 ElimStorePlain]: treesize reduction 28, result has 91.6 percent of original size [2019-08-05 10:58:44,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:44,782 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:58:44,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:44,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 173 [2019-08-05 10:58:44,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:44,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:44,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:44,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,790 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-08-05 10:58:45,135 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-08-05 10:58:45,135 INFO L567 ElimStorePlain]: treesize reduction 1554, result has 15.8 percent of original size [2019-08-05 10:58:45,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:45,136 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:331, output treesize:246 [2019-08-05 10:58:45,356 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-08-05 10:58:45,386 INFO L392 ElimStorePlain]: Different costs {6=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 15=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:45,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:45,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:45,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:45,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:45,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2019-08-05 10:58:45,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:45,925 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-08-05 10:58:45,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:45,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:46,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 127 [2019-08-05 10:58:46,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:46,146 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-08-05 10:58:46,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:46,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 10 [2019-08-05 10:58:46,162 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:46,280 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-08-05 10:58:46,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 151 [2019-08-05 10:58:46,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,364 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:46,612 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2019-08-05 10:58:46,612 INFO L567 ElimStorePlain]: treesize reduction 140, result has 65.0 percent of original size [2019-08-05 10:58:46,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:46,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 157 [2019-08-05 10:58:46,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:46,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:46,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:46,684 INFO L496 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:48,614 WARN L188 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-08-05 10:58:48,614 INFO L567 ElimStorePlain]: treesize reduction 64, result has 74.1 percent of original size [2019-08-05 10:58:48,745 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:58:48,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:48,751 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:313, output treesize:178 [2019-08-05 10:58:48,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:48,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 170 [2019-08-05 10:58:48,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:48,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 224 [2019-08-05 10:58:48,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:48,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 234 [2019-08-05 10:58:48,957 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:49,394 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-08-05 10:58:49,395 INFO L567 ElimStorePlain]: treesize reduction 48, result has 92.4 percent of original size [2019-08-05 10:58:49,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-08-05 10:58:49,398 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:665, output treesize:578 [2019-08-05 10:58:49,656 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-08-05 10:58:49,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:49,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,211 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 146 [2019-08-05 10:58:50,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:50,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:50,751 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 143 [2019-08-05 10:58:50,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,822 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:50,833 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:50,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:50,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:50,861 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 274 treesize of output 201 [2019-08-05 10:58:50,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,866 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:50,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:50,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:50,895 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 181 [2019-08-05 10:58:50,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:50,902 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:51,308 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 136 [2019-08-05 10:58:51,309 INFO L567 ElimStorePlain]: treesize reduction 80, result has 78.4 percent of original size [2019-08-05 10:58:51,329 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:51,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:51,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 137 [2019-08-05 10:58:51,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,352 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:51,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:51,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 161 [2019-08-05 10:58:51,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,401 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:51,725 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 113 [2019-08-05 10:58:51,726 INFO L567 ElimStorePlain]: treesize reduction 155, result has 58.2 percent of original size [2019-08-05 10:58:51,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-08-05 10:58:51,840 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:515, output treesize:190 [2019-08-05 10:58:51,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,981 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-08-05 10:58:51,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:52,114 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-08-05 10:58:52,115 INFO L567 ElimStorePlain]: treesize reduction 13, result has 89.6 percent of original size [2019-08-05 10:58:52,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:52,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:52,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-08-05 10:58:52,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:52,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:52,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:52,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:52,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:52,221 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:52,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 53 [2019-08-05 10:58:52,222 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:52,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:52,272 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-08-05 10:58:52,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:52,274 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 15 variables, input treesize:234, output treesize:71 [2019-08-05 10:58:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:52,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:58:52,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:58:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:58:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:58:52,379 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 13 states. [2019-08-05 10:58:59,011 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 10:58:59,012 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:712) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:119) ... 28 more [2019-08-05 10:58:59,017 INFO L168 Benchmark]: Toolchain (without parser) took 60284.41 ms. Allocated memory was 131.6 MB in the beginning and 430.4 MB in the end (delta: 298.8 MB). Free memory was 108.3 MB in the beginning and 76.5 MB in the end (delta: 31.8 MB). Peak memory consumption was 330.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:59,017 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 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:58:59,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.81 ms. Allocated memory is still 131.6 MB. Free memory was 108.3 MB in the beginning and 106.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:59,018 INFO L168 Benchmark]: Boogie Preprocessor took 33.29 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 104.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:59,018 INFO L168 Benchmark]: RCFGBuilder took 746.14 ms. Allocated memory is still 131.6 MB. Free memory was 104.8 MB in the beginning and 78.4 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:59,018 INFO L168 Benchmark]: TraceAbstraction took 59446.70 ms. Allocated memory was 131.6 MB in the beginning and 430.4 MB in the end (delta: 298.8 MB). Free memory was 78.2 MB in the beginning and 76.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 300.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:59,020 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 131.6 MB. Free memory was 110.4 MB in the beginning and 110.2 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 53.81 ms. Allocated memory is still 131.6 MB. Free memory was 108.3 MB in the beginning and 106.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.29 ms. Allocated memory is still 131.6 MB. Free memory was 106.4 MB in the beginning and 104.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.14 ms. Allocated memory is still 131.6 MB. Free memory was 104.8 MB in the beginning and 78.4 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59446.70 ms. Allocated memory was 131.6 MB in the beginning and 430.4 MB in the end (delta: 298.8 MB). Free memory was 78.2 MB in the beginning and 76.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 300.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...