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-f57a05f [2019-01-07 21:42:05,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:42:05,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:42:05,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:42:05,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:42:05,367 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:42:05,368 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:42:05,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:42:05,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:42:05,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:42:05,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:42:05,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:42:05,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:42:05,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:42:05,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:42:05,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:42:05,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:42:05,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:42:05,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:42:05,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:42:05,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:42:05,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:42:05,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:42:05,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:42:05,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:42:05,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:42:05,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:42:05,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:42:05,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:42:05,395 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:42:05,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:42:05,396 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:42:05,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:42:05,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:42:05,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:42:05,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:42:05,399 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-07 21:42:05,420 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:42:05,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:42:05,422 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:42:05,422 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:42:05,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:42:05,423 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:42:05,423 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:42:05,423 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:42:05,423 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:42:05,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:42:05,424 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:42:05,424 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:42:05,424 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:42:05,424 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:42:05,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:42:05,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:42:05,426 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:42:05,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:42:05,427 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:42:05,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:42:05,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:42:05,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:42:05,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:42:05,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:42:05,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:42:05,428 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:42:05,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:42:05,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:42:05,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:42:05,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:42:05,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:42:05,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:42:05,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:42:05,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:42:05,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:42:05,431 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:42:05,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:42:05,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:42:05,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:42:05,432 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:42:05,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:42:05,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:42:05,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:42:05,509 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:42:05,510 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:42:05,511 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-07 21:42:05,511 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-01-07 21:42:05,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:42:05,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:42:05,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:42:05,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:42:05,577 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:42:05,596 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,610 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:42:05,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:42:05,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:42:05,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:42:05,660 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,660 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,664 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,664 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,678 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,684 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,686 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 07.01 09:42:05" (1/1) ... [2019-01-07 21:42:05,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:42:05,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:42:05,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:42:05,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:42:05,690 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 07.01 09:42:05" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:42:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:42:05,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:42:06,247 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:42:06,248 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-07 21:42:06,250 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:42:06 BoogieIcfgContainer [2019-01-07 21:42:06,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:42:06,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:42:06,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:42:06,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:42:06,256 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 07.01 09:42:05" (1/2) ... [2019-01-07 21:42:06,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122025f8 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:42:06, skipping insertion in model container [2019-01-07 21:42:06,257 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 07.01 09:42:06" (2/2) ... [2019-01-07 21:42:06,259 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-01-07 21:42:06,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:42:06,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-07 21:42:06,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-07 21:42:06,332 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:42:06,333 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:42:06,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:42:06,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:42:06,333 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:42:06,333 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:42:06,334 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:42:06,334 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:42:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-07 21:42:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:42:06,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:06,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:42:06,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-01-07 21:42:06,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:06,645 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-07 21:42:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:42:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:42:06,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:42:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:42:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:42:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:42:06,669 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-07 21:42:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:06,924 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-01-07 21:42:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:42:06,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:42:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:06,942 INFO L225 Difference]: With dead ends: 41 [2019-01-07 21:42:06,942 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 21:42:06,946 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-07 21:42:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 21:42:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-01-07 21:42:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 21:42:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-01-07 21:42:06,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-01-07 21:42:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:06,989 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-01-07 21:42:06,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:42:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-01-07 21:42:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:06,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:06,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:06,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-01-07 21:42:06,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:06,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:06,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:07,262 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-07 21:42:07,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:07,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:07,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:07,265 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-01-07 21:42:07,306 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:07,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:07,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:07,380 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-07 21:42:07,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:07,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:07,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:07,387 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-07 21:42:07,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:07,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:07,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:07,638 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-07 21:42:07,672 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-07 21:42:07,683 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-07 21:42:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,704 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-07 21:42:07,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,752 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-07 21:42:07,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,890 INFO L303 Elim1Store]: Index analysis took 122 ms [2019-01-07 21:42:07,893 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-07 21:42:07,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:07,952 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-07 21:42:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,022 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-07 21:42:08,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:08,089 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-07 21:42:08,193 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-07 21:42:08,196 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:08,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:08,967 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,034 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,415 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-07 21:42:09,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,492 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-07 21:42:09,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,631 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-07 21:42:09,747 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-07 21:42:09,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,773 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-07 21:42:09,908 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-07 21:42:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,973 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-07 21:42:10,113 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-07 21:42:10,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,144 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-07 21:42:10,375 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-07 21:42:10,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,409 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-07 21:42:10,411 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,514 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,582 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,648 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,767 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,845 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,915 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,036 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-07 21:42:11,037 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-07 21:42:11,403 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-07 21:42:11,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:11,441 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-07 21:42:11,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:11,619 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-07 21:42:11,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-07 21:42:11,646 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-07 21:42:11,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:11,661 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-07 21:42:11,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:11,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:11,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:11,686 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-01-07 21:42:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:23,588 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-01-07 21:42:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:42:23,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:42:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:23,591 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:42:23,591 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:42:23,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:42:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:42:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-01-07 21:42:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 21:42:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-01-07 21:42:23,600 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-01-07 21:42:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:23,600 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-01-07 21:42:23,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:42:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-01-07 21:42:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:23,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:23,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:23,602 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-01-07 21:42:23,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:23,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:23,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:23,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:23,741 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-07 21:42:23,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:23,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:23,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:23,742 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-01-07 21:42:23,744 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:23,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:23,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:23,755 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-07 21:42:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:23,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:23,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:23,756 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-07 21:42:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:23,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:23,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:23,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,916 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-07 21:42:24,062 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-01-07 21:42:24,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,070 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-07 21:42:24,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,149 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-07 21:42:24,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,249 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-07 21:42:24,381 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-07 21:42:24,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,506 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-07 21:42:24,507 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-07 21:42:24,622 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-07 21:42:24,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,640 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-07 21:42:24,775 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-07 21:42:24,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,797 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-07 21:42:24,798 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,268 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-07 21:42:25,273 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-07 21:42:25,279 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-07 21:42:25,289 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-07 21:42:25,297 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-07 21:42:25,312 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-07 21:42:25,322 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-07 21:42:25,342 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-07 21:42:25,409 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-07 21:42:25,411 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,492 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,553 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,603 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,642 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,698 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,721 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,740 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:25,851 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-07 21:42:25,852 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-07 21:42:25,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:25,912 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-07 21:42:25,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:26,171 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-07 21:42:26,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-07 21:42:26,201 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-07 21:42:26,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:26,214 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-07 21:42:26,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:26,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:26,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:26,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:26,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:26,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:26,235 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-01-07 21:42:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:37,433 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-01-07 21:42:37,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:42:37,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:42:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:37,435 INFO L225 Difference]: With dead ends: 54 [2019-01-07 21:42:37,436 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 21:42:37,436 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-07 21:42:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 21:42:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-01-07 21:42:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:42:37,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-01-07 21:42:37,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-01-07 21:42:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:37,445 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-01-07 21:42:37,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:42:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-01-07 21:42:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:37,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:37,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:37,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-01-07 21:42:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:37,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:37,623 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-07 21:42:37,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:37,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:37,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:37,624 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-01-07 21:42:37,625 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:37,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:37,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:37,636 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-07 21:42:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:37,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:37,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:37,636 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-07 21:42:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:37,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:37,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:37,752 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-07 21:42:37,756 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-07 21:42:37,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,769 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-07 21:42:37,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,816 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-07 21:42:37,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,832 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-07 21:42:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,850 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-07 21:42:37,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:37,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,004 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-01-07 21:42:38,005 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-07 21:42:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,132 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-01-07 21:42:38,134 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-07 21:42:38,201 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-07 21:42:38,205 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,331 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,409 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,471 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,520 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:38,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,723 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-07 21:42:38,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,778 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-07 21:42:38,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,851 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-07 21:42:38,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:38,948 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-07 21:42:39,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,058 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-07 21:42:39,161 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-07 21:42:39,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,178 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-07 21:42:39,310 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-07 21:42:39,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:39,329 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-07 21:42:39,331 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,391 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,451 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,511 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,598 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,727 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:39,832 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-07 21:42:39,832 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-07 21:42:41,641 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 88 [2019-01-07 21:42:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:41,800 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-07 21:42:41,801 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-07 21:42:41,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-01-07 21:42:46,080 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-07 21:42:46,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1367 [2019-01-07 21:42:56,962 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 21:42:57,163 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:57,165 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:2024 -smt2 -in -t:2000)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-07 21:42:57,174 INFO L168 Benchmark]: Toolchain (without parser) took 51600.06 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 992.5 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -339.3 MB). Peak memory consumption was 653.2 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:57,175 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:57,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:57,176 INFO L168 Benchmark]: Boogie Preprocessor took 41.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:57,176 INFO L168 Benchmark]: RCFGBuilder took 561.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:57,176 INFO L168 Benchmark]: TraceAbstraction took 50917.29 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 992.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -360.4 MB). Peak memory consumption was 632.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:57,182 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 561.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50917.29 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 992.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -360.4 MB). Peak memory consumption was 632.1 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:2024 -smt2 -in -t:2000)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:2024 -smt2 -in -t:2000)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...