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 -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:08:02,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:08:02,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:08:02,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:08:02,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:08:02,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:08:02,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:08:02,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:08:02,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:08:02,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:08:02,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:08:02,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:08:02,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:08:02,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:08:02,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:08:02,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:08:02,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:08:02,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:08:02,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:08:02,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:08:02,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:08:02,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:08:02,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:08:02,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:08:02,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:08:02,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:08:02,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:08:02,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:08:02,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:08:02,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:08:02,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:08:02,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:08:02,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:08:02,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:08:02,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:08:02,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:08:02,698 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 17:08:02,715 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:08:02,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:08:02,716 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:08:02,716 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:08:02,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:08:02,717 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:08:02,717 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:08:02,717 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:08:02,717 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:08:02,717 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:08:02,718 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:08:02,718 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:08:02,718 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:08:02,718 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:08:02,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:08:02,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:08:02,719 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:08:02,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:08:02,720 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:08:02,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:08:02,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:08:02,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:08:02,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:08:02,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:08:02,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:08:02,721 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:08:02,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:08:02,722 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:08:02,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:08:02,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:08:02,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:08:02,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:08:02,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:08:02,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:08:02,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:08:02,723 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:08:02,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:08:02,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:08:02,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:08:02,724 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:08:02,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:08:02,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:08:02,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:08:02,783 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:08:02,784 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:08:02,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2019-01-31 17:08:02,785 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-01-31 17:08:02,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:08:02,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:08:02,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:08:02,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:08:02,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:08:02,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:08:02,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:08:02,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:08:02,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:08:02,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/1) ... [2019-01-31 17:08:02,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:08:02,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:08:02,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:08:02,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:08:02,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:08:02,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:08:02,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:08:03,435 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:08:03,435 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-31 17:08:03,436 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:08:03 BoogieIcfgContainer [2019-01-31 17:08:03,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:08:03,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:08:03,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:08:03,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:08:03,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:08:02" (1/2) ... [2019-01-31 17:08:03,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2909a52a and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:08:03, skipping insertion in model container [2019-01-31 17:08:03,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:08:03" (2/2) ... [2019-01-31 17:08:03,444 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-01-31 17:08:03,453 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:08:03,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-31 17:08:03,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-31 17:08:03,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:08:03,510 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:08:03,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:08:03,511 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:08:03,511 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:08:03,511 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:08:03,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:08:03,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:08:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-31 17:08:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:08:03,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:03,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:08:03,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-01-31 17:08:03,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:03,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:03,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:03,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:08:03,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:08:03,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:03,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:08:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:08:03,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:08:03,798 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-31 17:08:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:04,115 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-01-31 17:08:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:08:04,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:08:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:04,131 INFO L225 Difference]: With dead ends: 41 [2019-01-31 17:08:04,131 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:08:04,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:08:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:08:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-01-31 17:08:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:08:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-01-31 17:08:04,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-01-31 17:08:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:04,191 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-01-31 17:08:04,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:08:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-01-31 17:08:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:08:04,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:04,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:08:04,193 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-01-31 17:08:04,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:04,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:04,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:04,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:08:04,381 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-01-31 17:08:04,415 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:04,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:04,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:04,489 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:08:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:04,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:04,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:04,803 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-31 17:08:04,825 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-31 17:08:04,844 INFO L478 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 33 treesize of output 39 [2019-01-31 17:08:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,909 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 17:08:04,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,945 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 17:08:04,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,073 INFO L303 Elim1Store]: Index analysis took 122 ms [2019-01-31 17:08:05,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 17:08:05,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,207 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-31 17:08:05,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:08:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 17:08:05,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,383 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-31 17:08:05,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 17:08:05,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 17:08:05,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,826 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 114 [2019-01-31 17:08:06,782 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-31 17:08:06,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 17:08:06,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 17:08:07,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 17:08:07,173 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-31 17:08:07,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 17:08:07,344 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 17:08:07,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 17:08:07,620 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 17:08:07,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:07,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 17:08:07,681 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:07,762 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:07,819 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:07,879 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:07,987 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,067 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,134 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:08,246 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 17:08:08,511 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-31 17:08:08,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-01-31 17:08:08,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:08,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 17:08:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:08,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:08:08,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:08,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:08:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:08:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:08,839 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-01-31 17:08:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:21,111 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-01-31 17:08:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:08:21,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:08:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:21,114 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:08:21,114 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:08:21,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:08:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:08:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-01-31 17:08:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:08:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-01-31 17:08:21,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-01-31 17:08:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:21,123 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-01-31 17:08:21,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:08:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-01-31 17:08:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:08:21,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:21,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:08:21,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-01-31 17:08:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:21,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:21,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:21,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:21,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:21,247 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:08:21,247 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-01-31 17:08:21,249 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:21,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:21,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:21,259 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:08:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:21,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:21,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:21,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:21,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:21,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:21,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:21,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 114 [2019-01-31 17:08:21,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 17:08:21,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 17:08:21,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 17:08:21,812 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-31 17:08:21,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:21,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 17:08:22,003 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 17:08:22,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 17:08:22,173 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 17:08:22,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,294 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-31 17:08:22,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 17:08:22,298 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-31 17:08:22,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-01-31 17:08:22,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 17:08:22,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 17:08:22,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 17:08:22,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:08:22,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 17:08:22,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 17:08:23,042 INFO L303 Elim1Store]: Index analysis took 172 ms [2019-01-31 17:08:23,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 17:08:23,044 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,126 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,188 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,236 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,274 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,304 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,327 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,350 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,370 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:23,479 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 17:08:23,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 17:08:23,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:23,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 17:08:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:23,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:23,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:23,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:08:23,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:23,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:08:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:08:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:23,856 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-01-31 17:08:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:35,053 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-01-31 17:08:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:08:35,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:08:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:35,055 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:08:35,055 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:08:35,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:08:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-01-31 17:08:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:08:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-01-31 17:08:35,063 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-01-31 17:08:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-01-31 17:08:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:08:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-01-31 17:08:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:08:35,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:35,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:08:35,064 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-01-31 17:08:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:35,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:35,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:35,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:35,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:08:35,216 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-01-31 17:08:35,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:35,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:35,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:35,229 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:08:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:35,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:35,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:35,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:35,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:35,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:35,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:35,321 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-31 17:08:35,325 INFO L478 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 33 treesize of output 39 [2019-01-31 17:08:35,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,334 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 17:08:35,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,378 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 17:08:35,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 17:08:35,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:08:35,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 17:08:35,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 159 [2019-01-31 17:08:35,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 17:08:35,546 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,656 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,826 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,857 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 114 [2019-01-31 17:08:36,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2019-01-31 17:08:36,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2019-01-31 17:08:36,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2019-01-31 17:08:36,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 116 [2019-01-31 17:08:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 134 [2019-01-31 17:08:36,596 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 17:08:36,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 17:08:36,621 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,682 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,741 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,801 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,861 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,926 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,989 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:37,092 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 17:08:38,880 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 88 [2019-01-31 17:08:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 16 case distinctions, treesize of input 56 treesize of output 190 [2019-01-31 17:08:39,038 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-31 17:08:39,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-01-31 17:08:43,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 64 dim-0 vars, and 9 xjuncts. [2019-01-31 17:08:43,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1367 [2019-01-31 17:09:57,469 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) stderr output: (error "out of memory") [2019-01-31 17:09:57,670 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:57,672 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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:286) 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.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-31 17:09:57,677 INFO L168 Benchmark]: Toolchain (without parser) took 114855.91 ms. Allocated memory was 135.8 MB in the beginning and 443.0 MB in the end (delta: 307.2 MB). Free memory was 111.0 MB in the beginning and 406.8 MB in the end (delta: -295.8 MB). Peak memory consumption was 297.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:09:57,678 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:09:57,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.38 ms. Allocated memory is still 135.8 MB. Free memory was 110.8 MB in the beginning and 108.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:09:57,679 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:09:57,680 INFO L168 Benchmark]: RCFGBuilder took 531.79 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 93.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-01-31 17:09:57,681 INFO L168 Benchmark]: TraceAbstraction took 114238.85 ms. Allocated memory was 135.8 MB in the beginning and 443.0 MB in the end (delta: 307.2 MB). Free memory was 93.2 MB in the beginning and 406.8 MB in the end (delta: -313.6 MB). Peak memory consumption was 279.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:09:57,684 INFO L336 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.17 ms. Allocated memory is still 135.8 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.38 ms. Allocated memory is still 135.8 MB. Free memory was 110.8 MB in the beginning and 108.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.93 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.79 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 93.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114238.85 ms. Allocated memory was 135.8 MB in the beginning and 443.0 MB in the end (delta: 307.2 MB). Free memory was 93.2 MB in the beginning and 406.8 MB in the end (delta: -313.6 MB). Peak memory consumption was 279.6 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:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...