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-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:20:28,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:20:28,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:20:28,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:20:28,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:20:28,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:20:28,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:20:28,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:20:28,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:20:28,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:20:28,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:20:28,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:20:28,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:20:28,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:20:28,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:20:28,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:20:28,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:20:28,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:20:28,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:20:28,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:20:28,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:20:28,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:20:28,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:20:28,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:20:28,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:20:28,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:20:28,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:20:28,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:20:28,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:20:28,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:20:28,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:20:28,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:20:28,934 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:20:28,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:20:28,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:20:28,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:20:28,936 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-11 14:20:28,948 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:20:28,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:20:28,949 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:20:28,949 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:20:28,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:20:28,949 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:20:28,949 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:20:28,950 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:20:28,950 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:20:28,950 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:20:28,950 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:20:28,950 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:20:28,951 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:20:28,951 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:20:28,951 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:20:28,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:20:28,952 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:20:28,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:20:28,952 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:20:28,952 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:20:28,952 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:20:28,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:20:28,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:20:28,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:20:28,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:20:28,953 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:20:28,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:20:28,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:20:28,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:20:28,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:20:28,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:20:28,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:20:28,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:20:28,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:20:28,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:20:28,955 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:20:28,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:20:28,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:20:28,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:20:28,956 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:20:28,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:20:29,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:20:29,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:20:29,015 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:20:29,015 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:20:29,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-11 14:20:29,016 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-11 14:20:29,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:20:29,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:20:29,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:20:29,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:20:29,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:20:29,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:20:29,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:20:29,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:20:29,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:20:29,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/1) ... [2019-01-11 14:20:29,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:20:29,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:20:29,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:20:29,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:20:29,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:20:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:20:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:20:29,505 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:20:29,505 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-11 14:20:29,507 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:20:29 BoogieIcfgContainer [2019-01-11 14:20:29,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:20:29,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:20:29,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:20:29,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:20:29,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:29" (1/2) ... [2019-01-11 14:20:29,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5646481 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:20:29, skipping insertion in model container [2019-01-11 14:20:29,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:20:29" (2/2) ... [2019-01-11 14:20:29,517 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-11 14:20:29,529 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:20:29,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-11 14:20:29,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-11 14:20:29,579 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:20:29,579 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:20:29,579 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:20:29,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:20:29,580 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:20:29,580 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:20:29,580 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:20:29,580 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:20:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-11 14:20:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:20:29,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:29,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:20:29,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-11 14:20:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:29,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:29,775 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-11 14:20:29,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:29,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:20:29,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:29,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:20:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:20:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:29,802 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-11 14:20:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:29,979 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-11 14:20:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:29,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:20:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:29,994 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:20:29,994 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:20:29,998 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-11 14:20:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:20:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-11 14:20:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:20:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-11 14:20:30,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-11 14:20:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:30,032 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-11 14:20:30,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:20:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-11 14:20:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:30,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:30,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:30,034 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-11 14:20:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:30,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:30,070 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-11 14:20:30,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:30,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:20:30,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:30,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:20:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:20:30,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:30,074 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-11 14:20:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:30,139 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 14:20:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:30,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:20:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:30,141 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:20:30,141 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:20:30,143 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-11 14:20:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:20:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-11 14:20:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:20:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-11 14:20:30,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-11 14:20:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:30,147 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-11 14:20:30,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:20:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-11 14:20:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:30,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:30,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:30,148 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-11 14:20:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:30,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:30,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:30,240 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-11 14:20:30,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:30,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:30,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:30,244 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-11 14:20:30,276 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:30,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:30,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:30,358 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 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-11 14:20:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:30,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:30,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:30,366 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-11 14:20:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:30,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:30,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:30,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:30,556 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 17 treesize of output 29 [2019-01-11 14:20:30,686 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 14:20:30,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:30,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:30,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:30,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:30,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:30,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:20:30,917 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:30,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:31,064 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:31,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:31,108 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:31,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:31,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:31,162 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-11 14:20:31,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:31,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:20:31,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:31,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:20:31,264 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-11 14:20:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:31,375 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-11 14:20:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:20:31,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:20:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:31,377 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:20:31,377 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:20:31,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:20:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:20:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-11 14:20:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:20:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-11 14:20:31,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-11 14:20:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:31,381 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-11 14:20:31,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-11 14:20:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:31,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:31,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:31,383 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-11 14:20:31,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:31,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:31,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:31,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:31,429 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-11 14:20:31,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:31,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:31,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:31,430 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-11 14:20:31,432 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:31,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:31,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:31,438 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 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-11 14:20:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:31,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:31,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:31,439 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-11 14:20:31,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:31,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:31,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:31,518 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 17 treesize of output 29 [2019-01-11 14:20:31,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:31,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:31,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:31,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:31,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:20:31,671 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:31,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:31,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:31,756 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:31,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:31,875 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:20:31,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:32,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:32,110 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-11 14:20:32,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:32,131 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-11 14:20:32,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:32,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:32,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:32,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:32,152 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-11 14:20:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:32,395 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-11 14:20:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:32,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:20:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:32,397 INFO L225 Difference]: With dead ends: 24 [2019-01-11 14:20:32,397 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 14:20:32,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 14:20:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-11 14:20:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:20:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-11 14:20:32,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-11 14:20:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:32,403 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-11 14:20:32,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-11 14:20:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:32,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:32,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:32,404 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-11 14:20:32,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:32,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:32,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:32,425 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-11 14:20:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:32,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:20:32,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:32,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:20:32,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:20:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:32,427 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-11 14:20:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:32,494 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-11 14:20:32,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:32,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 14:20:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:32,495 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:20:32,495 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:20:32,496 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-11 14:20:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:20:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 14:20:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:20:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-11 14:20:32,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-11 14:20:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:32,501 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-11 14:20:32,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:20:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-11 14:20:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:32,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:32,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:32,503 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-11 14:20:32,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:32,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:32,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:32,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:32,560 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-11 14:20:32,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:32,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:32,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:32,561 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-11 14:20:32,563 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:32,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:32,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:32,623 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 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-11 14:20:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:32,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:32,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:32,624 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-11 14:20:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:32,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:32,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:32,675 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 12 treesize of output 15 [2019-01-11 14:20:32,679 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 15 treesize of output 21 [2019-01-11 14:20:32,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,685 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:32,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,751 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 17 treesize of output 29 [2019-01-11 14:20:32,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:32,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:32,821 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:32,853 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:32,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:32,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:32,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:32,918 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-11 14:20:32,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:32,949 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-11 14:20:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:32,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:32,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:32,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:32,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:32,969 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-11 14:20:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:33,119 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-11 14:20:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:33,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:20:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:33,120 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:20:33,120 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:20:33,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:20:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-11 14:20:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 14:20:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-11 14:20:33,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-11 14:20:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:33,127 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-11 14:20:33,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-11 14:20:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:33,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:33,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:33,128 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:33,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-11 14:20:33,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:33,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:33,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:33,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:33,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:33,194 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-11 14:20:33,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:33,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:33,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:33,201 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:33,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:33,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:33,201 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:33,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:33,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:33,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:33,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,276 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 17 treesize of output 29 [2019-01-11 14:20:33,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:33,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:33,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:20:33,341 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:33,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:33,383 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:33,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,415 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:33,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:33,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:33,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,502 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:20:33,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:33,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-11 14:20:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:33,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:33,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:33,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:33,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:33,593 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-11 14:20:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:33,818 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-11 14:20:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:33,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:33,820 INFO L225 Difference]: With dead ends: 35 [2019-01-11 14:20:33,820 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 14:20:33,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 14:20:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-11 14:20:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 14:20:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-11 14:20:33,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-11 14:20:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:33,828 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-11 14:20:33,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-11 14:20:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:33,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:33,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:33,829 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-11 14:20:33,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:33,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:33,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:33,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:33,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:33,858 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-11 14:20:33,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:33,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:33,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:33,860 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-11 14:20:33,861 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:33,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:33,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:33,865 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 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-11 14:20:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:33,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:33,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:33,866 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:33,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:33,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:33,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:33,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:33,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:20:33,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:20:33,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:33,935 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-11 14:20:33,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:33,945 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:20:33,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:33,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:20:33,968 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-11 14:20:33,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:33,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:33,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-11 14:20:33,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:33,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:20:33,992 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-11 14:20:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:34,059 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-11 14:20:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:20:34,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:20:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:34,060 INFO L225 Difference]: With dead ends: 30 [2019-01-11 14:20:34,061 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 14:20:34,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:20:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 14:20:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-11 14:20:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:20:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-11 14:20:34,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-11 14:20:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:34,070 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-11 14:20:34,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-11 14:20:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:34,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:34,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:34,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-11 14:20:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:34,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:34,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:34,168 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:34,168 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-11 14:20:34,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:34,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:34,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:34,174 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:34,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:34,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:34,175 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:34,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:34,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:34,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:34,207 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 12 treesize of output 15 [2019-01-11 14:20:34,216 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 15 treesize of output 21 [2019-01-11 14:20:34,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,233 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:34,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,285 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 17 treesize of output 29 [2019-01-11 14:20:34,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:34,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,354 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:20:34,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:34,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:34,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:34,396 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:20:34,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:34,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:34,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 14:20:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:34,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:34,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:34,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:20:34,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:34,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:34,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:34,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:20:34,482 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-11 14:20:34,754 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-11 14:20:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:34,837 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-11 14:20:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:34,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:34,839 INFO L225 Difference]: With dead ends: 48 [2019-01-11 14:20:34,839 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:20:34,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:34,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:20:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-11 14:20:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:20:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-11 14:20:34,850 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-11 14:20:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:34,850 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-11 14:20:34,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-11 14:20:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:34,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:34,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:34,852 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-11 14:20:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:34,896 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-11 14:20:34,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:34,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:34,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:34,897 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-11 14:20:34,898 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:34,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:34,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:34,902 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 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-11 14:20:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:34,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:34,903 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:34,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:34,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:34,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-11 14:20:35,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-11 14:20:35,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,057 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 12 treesize of output 15 [2019-01-11 14:20:35,061 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 15 treesize of output 17 [2019-01-11 14:20:35,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-11 14:20:35,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:35,090 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:20:35,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:20:35,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:35,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-11 14:20:35,295 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-11 14:20:35,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:35,369 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-11 14:20:35,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:35,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:35,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:35,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:35,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:35,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:35,390 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-11 14:20:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:35,576 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-11 14:20:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:35,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:20:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:35,577 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:20:35,577 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:20:35,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:20:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-11 14:20:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:20:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-11 14:20:35,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-11 14:20:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:35,587 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-11 14:20:35,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-11 14:20:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:35,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:35,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:35,588 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-11 14:20:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:35,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:35,691 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-11 14:20:35,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:35,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:35,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:35,692 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-11 14:20:35,695 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:35,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:35,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:35,702 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 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-11 14:20:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:35,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:35,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:35,703 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:35,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:35,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:35,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:35,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:35,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:20:35,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-11 14:20:35,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-11 14:20:35,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-11 14:20:35,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:35,923 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:20:35,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:35,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:20:35,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:35,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:35,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-11 14:20:35,985 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-11 14:20:35,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:36,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-11 14:20:36,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:36,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:36,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:36,026 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-11 14:20:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:36,098 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-11 14:20:36,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:36,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:20:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:36,108 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:20:36,108 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:20:36,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:20:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-11 14:20:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:20:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-11 14:20:36,124 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-11 14:20:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:36,124 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-11 14:20:36,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-11 14:20:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:36,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:36,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:36,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-11 14:20:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:20:36,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:36,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:36,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:36,175 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-11 14:20:36,177 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:36,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:36,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:36,181 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:36,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:36,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:36,181 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:36,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:36,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:36,235 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 12 treesize of output 15 [2019-01-11 14:20:36,238 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 15 treesize of output 21 [2019-01-11 14:20:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,248 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:36,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,282 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 17 treesize of output 29 [2019-01-11 14:20:36,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:36,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,334 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:36,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,367 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:36,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:36,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,400 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:36,402 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:20:36,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:36,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:20:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:36,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:36,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:36,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:20:36,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:36,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:20:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:20:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:20:36,489 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-11 14:20:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:36,760 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-11 14:20:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:20:36,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 14:20:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:36,761 INFO L225 Difference]: With dead ends: 38 [2019-01-11 14:20:36,761 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:20:36,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:20:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-11 14:20:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:20:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-11 14:20:36,770 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-11 14:20:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:36,770 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-11 14:20:36,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:20:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-11 14:20:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:36,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:36,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:36,771 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-11 14:20:36,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:36,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:36,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:36,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:36,841 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-11 14:20:36,843 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:36,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:36,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:36,848 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:36,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:36,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:36,849 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:36,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:36,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:36,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 14:20:36,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,884 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 12 treesize of output 15 [2019-01-11 14:20:36,894 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 15 treesize of output 21 [2019-01-11 14:20:36,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-11 14:20:36,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:36,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-11 14:20:36,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:20:36,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:20:36,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:36,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:20:36,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:36,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:36,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 14:20:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:37,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:37,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:37,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:37,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:37,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:37,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:37,046 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-11 14:20:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:37,349 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-11 14:20:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:37,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:20:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:37,351 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:20:37,351 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:20:37,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:20:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-11 14:20:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:20:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-11 14:20:37,361 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-11 14:20:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:37,361 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-11 14:20:37,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-11 14:20:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:37,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:37,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:37,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:37,363 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-11 14:20:37,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:37,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:37,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:37,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:37,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:37,425 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-11 14:20:37,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:37,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:37,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:37,430 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:37,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:37,431 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:37,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:37,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:37,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:37,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:20:37,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-11 14:20:37,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-11 14:20:37,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-11 14:20:37,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:37,534 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-11 14:20:37,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:20:37,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:20:37,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:37,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:20:37,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:37,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:37,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 14:20:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:37,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:37,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:37,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:37,684 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-11 14:20:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:37,911 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-11 14:20:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:37,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:20:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:37,913 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:20:37,914 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:20:37,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:20:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-11 14:20:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 14:20:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-11 14:20:37,925 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-11 14:20:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:37,925 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-11 14:20:37,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-11 14:20:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:37,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:37,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:37,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-11 14:20:37,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:37,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:37,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:37,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:38,065 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-11 14:20:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:38,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:38,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:38,124 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-11 14:20:38,126 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:38,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:38,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:38,130 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:20:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:38,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:38,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:38,131 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:38,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:38,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:38,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:38,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,183 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 17 treesize of output 29 [2019-01-11 14:20:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:38,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:38,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:20:38,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:38,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:38,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,279 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:20:38,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:38,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,314 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:38,315 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:20:38,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:38,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-11 14:20:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,357 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:20:38,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:38,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:20:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:38,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:38,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:38,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:20:38,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:38,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:20:38,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:20:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:20:38,457 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-11 14:20:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:38,638 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-11 14:20:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:20:38,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:20:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:38,639 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:20:38,639 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:20:38,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:20:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:20:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-11 14:20:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:20:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-11 14:20:38,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-11 14:20:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:38,650 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-11 14:20:38,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:20:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-11 14:20:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:20:38,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:38,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:20:38,652 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-11 14:20:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:38,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:38,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:38,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:38,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:38,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:20:38,878 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-11 14:20:38,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:38,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:38,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:38,884 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:38,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:38,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:38,884 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:38,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:38,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:38,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:38,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-11 14:20:38,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-11 14:20:38,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-11 14:20:38,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:38,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-11 14:20:38,970 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:38,983 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-11 14:20:39,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:39,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:20:39,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:20:39,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-11 14:20:39,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,091 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-11 14:20:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:39,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,122 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:39,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:20:39,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:39,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:20:39,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-11 14:20:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:39,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:39,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:39,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 14:20:39,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:39,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:20:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:20:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:39,252 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-11 14:20:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:39,674 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-11 14:20:39,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:20:39,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:20:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:39,676 INFO L225 Difference]: With dead ends: 28 [2019-01-11 14:20:39,676 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:20:39,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:20:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:20:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-11 14:20:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 14:20:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-11 14:20:39,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-11 14:20:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:39,686 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-11 14:20:39,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:20:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-11 14:20:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:20:39,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:39,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:20:39,687 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-11 14:20:39,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:39,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:20:39,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:39,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:39,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:20:39,903 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-11 14:20:39,904 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:39,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:39,909 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:39,910 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:20:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:39,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:39,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:39,910 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:39,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:39,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,950 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 17 treesize of output 29 [2019-01-11 14:20:39,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:39,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:20:39,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:39,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:39,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-11 14:20:39,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-11 14:20:40,003 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-11 14:20:40,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-11 14:20:40,272 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 14:20:40,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,311 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:40,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:40,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:20:40,711 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:20:40,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,840 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-11 14:20:40,841 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:20:40,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:40,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-11 14:20:40,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:40,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:40,971 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:20:40,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:40,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 14:20:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:41,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:41,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:41,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:20:41,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:41,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:20:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:20:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:20:41,100 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-11 14:20:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:41,349 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-11 14:20:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:20:41,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:20:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:41,350 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:20:41,350 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:20:41,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:20:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:20:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:20:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:20:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:20:41,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-11 14:20:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:41,352 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:20:41,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:20:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:20:41,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:20:41,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:20:41,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:20:41,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:20:41,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:20:41,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:20:41,496 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-11 14:20:42,792 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-11 14:20:42,795 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:20:42,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:20:42,796 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-01-11 14:20:42,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-11 14:20:42,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-11 14:20:42,796 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-11 14:20:42,797 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-11 14:20:42,797 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-11 14:20:42,797 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-11 14:20:42,806 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:20:42 BoogieIcfgContainer [2019-01-11 14:20:42,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:20:42,806 INFO L168 Benchmark]: Toolchain (without parser) took 13758.21 ms. Allocated memory was 133.7 MB in the beginning and 320.9 MB in the end (delta: 187.2 MB). Free memory was 108.9 MB in the beginning and 150.1 MB in the end (delta: -41.2 MB). Peak memory consumption was 146.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:42,807 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:20:42,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:42,807 INFO L168 Benchmark]: Boogie Preprocessor took 22.40 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:42,808 INFO L168 Benchmark]: RCFGBuilder took 378.42 ms. Allocated memory is still 133.7 MB. Free memory was 105.4 MB in the beginning and 95.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:42,808 INFO L168 Benchmark]: TraceAbstraction took 13297.47 ms. Allocated memory was 133.7 MB in the beginning and 320.9 MB in the end (delta: 187.2 MB). Free memory was 95.3 MB in the beginning and 150.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. [2019-01-11 14:20:42,810 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 106.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.40 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.42 ms. Allocated memory is still 133.7 MB. Free memory was 105.4 MB in the beginning and 95.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13297.47 ms. Allocated memory was 133.7 MB in the beginning and 320.9 MB in the end (delta: 187.2 MB). Free memory was 95.3 MB in the beginning and 150.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 132.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...