java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:58:36,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:58:36,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:58:36,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:58:36,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:58:36,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:58:36,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:58:36,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:58:36,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:58:36,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:58:36,676 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:58:36,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:58:36,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:58:36,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:58:36,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:58:36,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:58:36,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:58:36,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:58:36,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:58:36,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:58:36,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:58:36,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:58:36,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:58:36,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:58:36,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:58:36,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:58:36,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:58:36,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:58:36,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:58:36,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:58:36,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:58:36,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:58:36,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:58:36,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:58:36,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:58:36,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:58:36,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:58:36,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:58:36,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:58:36,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:58:36,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:58:36,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:58:36,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:58:36,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:58:36,786 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:58:36,786 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:58:36,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl [2019-08-05 10:58:36,787 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl' [2019-08-05 10:58:36,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:58:36,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:58:36,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:58:36,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:58:36,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:58:36,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:58:36,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:58:36,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:58:36,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:58:36,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/1) ... [2019-08-05 10:58:36,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:58:36,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:58:36,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:58:36,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:58:36,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (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:58:36,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:58:36,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:58:36,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:58:37,425 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:58:37,426 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:58:37,427 INFO L202 PluginConnector]: Adding new model sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:58:37 BoogieIcfgContainer [2019-08-05 10:58:37,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:58:37,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:58:37,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:58:37,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:58:37,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:36" (1/2) ... [2019-08-05 10:58:37,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c002e7 and model type sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:58:37, skipping insertion in model container [2019-08-05 10:58:37,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:58:37" (2/2) ... [2019-08-05 10:58:37,434 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_41.bpl [2019-08-05 10:58:37,444 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:58:37,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:58:37,473 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:58:37,496 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:58:37,496 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:58:37,496 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:58:37,497 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:58:37,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:58:37,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:58:37,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:58:37,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:58:37,498 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:58:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:58:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:58:37,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:37,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:58:37,523 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 10:58:37,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:37,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:58:37,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:37,761 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:37,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:37,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:37,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:37,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:58:37,843 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:37,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:37,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:58:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:58:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:58:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:58:37,864 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 10:58:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:38,193 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 10:58:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:58:38,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:58:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:38,205 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:58:38,205 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:58:38,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:58:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 10:58:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:58:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:58:38,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:58:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:38,258 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:58:38,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:58:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:58:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:58:38,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:38,259 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:38,259 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 10:58:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:38,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:58:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:38,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, 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:38,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:38,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:38,439 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:38,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:38,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:38,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:38,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-08-05 10:58:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:38,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:58:38,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:58:38,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:58:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:58:38,714 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:58:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:38,951 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:58:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:58:38,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:58:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:38,954 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:58:38,954 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:58:38,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:58:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:58:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:58:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:58:38,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:58:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:38,958 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:58:38,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:58:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:58:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:58:38,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:38,959 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:38,960 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 10:58:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:39,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:58:39,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:39,214 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,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:39,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:39,375 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:58:39,472 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:39,473 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:39,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:39,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,841 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-08-05 10:58:39,841 INFO L567 ElimStorePlain]: treesize reduction 17, result has 79.3 percent of original size [2019-08-05 10:58:39,883 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 0 case distinctions, treesize of input 41 treesize of output 30 [2019-08-05 10:58:39,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:39,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2019-08-05 10:58:39,956 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:39,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:39,982 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 19 treesize of output 18 [2019-08-05 10:58:39,982 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,001 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,031 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:70, output treesize:29 [2019-08-05 10:58:40,146 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:58:40,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:40,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-08-05 10:58:40,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,399 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.9 percent of original size [2019-08-05 10:58:40,402 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:40,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:15 [2019-08-05 10:58:40,575 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:40,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:40,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:58:40,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:58:40,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:58:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:40,576 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 10:58:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:40,838 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 10:58:40,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:58:40,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:58:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:40,839 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:58:40,839 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:58:40,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:58:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:58:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:58:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:58:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:58:40,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:58:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:40,844 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:58:40,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:58:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:58:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:58:40,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:40,845 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:58:40,845 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 10:58:40,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:40,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:58:40,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:41,035 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:41,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,129 INFO L567 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2019-08-05 10:58:41,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:41,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-08-05 10:58:41,278 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,279 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:41,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:41,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,391 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-08-05 10:58:41,392 INFO L567 ElimStorePlain]: treesize reduction 27, result has 81.6 percent of original size [2019-08-05 10:58:41,448 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 0 case distinctions, treesize of input 97 treesize of output 85 [2019-08-05 10:58:41,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:41,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:41,517 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 75 treesize of output 74 [2019-08-05 10:58:41,519 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,588 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 0 case distinctions, treesize of input 33 treesize of output 25 [2019-08-05 10:58:41,589 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,606 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,649 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 0 case distinctions, treesize of input 56 treesize of output 42 [2019-08-05 10:58:41,651 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:41,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:41,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 26 [2019-08-05 10:58:41,659 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,697 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 19 treesize of output 18 [2019-08-05 10:58:41,698 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,735 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,756 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:41,757 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:135, output treesize:58 [2019-08-05 10:58:41,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:41,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:41,939 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 78 treesize of output 70 [2019-08-05 10:58:41,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,958 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-08-05 10:58:41,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:41,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:41,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:41,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:157, output treesize:64 [2019-08-05 10:58:42,121 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:42,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:42,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:58:42,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:58:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:58:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:42,123 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2019-08-05 10:58:42,512 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-08-05 10:58:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:42,597 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 10:58:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:58:42,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:58:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:42,598 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:58:42,598 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:58:42,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:58:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:58:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:58:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:58:42,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:58:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:42,602 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:58:42,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:58:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:58:42,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:58:42,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:42,604 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:58:42,604 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2019-08-05 10:58:42,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:42,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:58:42,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:42,953 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:42,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,003 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.3 percent of original size [2019-08-05 10:58:43,018 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:43,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-08-05 10:58:43,099 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:43,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:43,112 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:43,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,201 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.6 percent of original size [2019-08-05 10:58:43,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,231 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:43,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,330 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.1 percent of original size [2019-08-05 10:58:43,339 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 0 case distinctions, treesize of input 38 treesize of output 28 [2019-08-05 10:58:43,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:43,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:43,352 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 12 treesize of output 11 [2019-08-05 10:58:43,353 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:43,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:43,372 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 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 10:58:43,373 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,378 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,427 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 0 case distinctions, treesize of input 38 treesize of output 28 [2019-08-05 10:58:43,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:43,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:43,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-08-05 10:58:43,444 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,461 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 19 treesize of output 18 [2019-08-05 10:58:43,462 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,472 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:43,528 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:126, output treesize:50 [2019-08-05 10:58:43,765 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-08-05 10:58:43,894 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:43,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:43,907 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 18 treesize of output 14 [2019-08-05 10:58:43,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:44,061 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 10:58:44,062 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.5 percent of original size [2019-08-05 10:58:44,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:44,112 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 26 treesize of output 89 [2019-08-05 10:58:44,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:44,384 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-08-05 10:58:44,384 INFO L567 ElimStorePlain]: treesize reduction 40, result has 83.5 percent of original size [2019-08-05 10:58:44,388 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_10|], 4=[|v_#memory_$Pointer$.offset_9|]} [2019-08-05 10:58:44,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:44,409 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 2 case distinctions, treesize of input 156 treesize of output 129 [2019-08-05 10:58:44,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:44,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:44,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:44,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:44,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 100 treesize of output 1 [2019-08-05 10:58:44,476 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:44,714 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-08-05 10:58:44,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:44,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:44,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2019-08-05 10:58:44,735 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:45,049 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-08-05 10:58:45,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:45,134 INFO L341 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2019-08-05 10:58:45,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 157 [2019-08-05 10:58:45,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:45,187 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:45,192 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:45,193 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_28], 1=[v_arrayElimCell_27]} [2019-08-05 10:58:45,202 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) 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) [2019-08-05 10:58:45,207 INFO L168 Benchmark]: Toolchain (without parser) took 8360.05 ms. Allocated memory was 134.7 MB in the beginning and 229.1 MB in the end (delta: 94.4 MB). Free memory was 111.5 MB in the beginning and 88.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 117.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:45,208 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 113.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:58:45,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 134.7 MB. Free memory was 111.5 MB in the beginning and 109.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:45,209 INFO L168 Benchmark]: Boogie Preprocessor took 33.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:45,209 INFO L168 Benchmark]: RCFGBuilder took 505.32 ms. Allocated memory is still 134.7 MB. Free memory was 108.1 MB in the beginning and 91.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:45,210 INFO L168 Benchmark]: TraceAbstraction took 7776.59 ms. Allocated memory was 134.7 MB in the beginning and 229.1 MB in the end (delta: 94.4 MB). Free memory was 91.1 MB in the beginning and 88.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:45,213 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.19 ms. Allocated memory is still 134.7 MB. Free memory is still 113.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 134.7 MB. Free memory was 111.5 MB in the beginning and 109.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.20 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 505.32 ms. Allocated memory is still 134.7 MB. Free memory was 108.1 MB in the beginning and 91.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7776.59 ms. Allocated memory was 134.7 MB in the beginning and 229.1 MB in the end (delta: 94.4 MB). Free memory was 91.1 MB in the beginning and 88.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...