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-f57a05f [2019-01-08 14:02:11,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:02:11,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:02:11,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:02:11,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:02:11,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:02:11,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:02:11,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:02:11,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:02:11,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:02:11,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:02:11,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:02:11,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:02:11,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:02:11,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:02:11,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:02:11,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:02:11,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:02:11,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:02:11,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:02:11,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:02:11,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:02:11,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:02:11,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:02:11,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:02:11,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:02:11,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:02:11,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:02:11,844 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:02:11,845 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:02:11,845 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:02:11,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:02:11,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:02:11,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:02:11,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:02:11,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:02:11,851 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-08 14:02:11,875 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:02:11,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:02:11,880 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:02:11,880 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:02:11,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:02:11,881 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:02:11,881 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:02:11,881 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:02:11,881 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:02:11,881 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:02:11,882 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:02:11,882 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:02:11,882 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:02:11,882 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:02:11,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:02:11,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:02:11,885 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:02:11,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:02:11,886 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:02:11,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:02:11,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:02:11,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:02:11,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:02:11,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:02:11,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:02:11,887 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:02:11,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:02:11,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:02:11,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:02:11,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:02:11,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:02:11,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:02:11,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:02:11,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:02:11,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:02:11,891 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:02:11,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:02:11,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:02:11,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:02:11,892 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:02:11,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:02:11,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:02:11,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:02:11,938 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:02:11,938 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:02:11,939 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-08 14:02:11,939 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-08 14:02:11,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:02:11,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:02:11,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:02:11,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:02:11,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:02:11,996 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,011 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:02:12,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:02:12,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:02:12,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:02:12,051 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,052 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,053 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,053 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,056 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,059 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,060 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 08.01 02:02:11" (1/1) ... [2019-01-08 14:02:12,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:02:12,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:02:12,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:02:12,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:02:12,064 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 08.01 02:02:11" (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-08 14:02:12,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:02:12,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:02:12,365 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:02:12,365 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-08 14:02:12,366 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:02:12 BoogieIcfgContainer [2019-01-08 14:02:12,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:02:12,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:02:12,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:02:12,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:02:12,371 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 08.01 02:02:11" (1/2) ... [2019-01-08 14:02:12,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa98862 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:02:12, skipping insertion in model container [2019-01-08 14:02:12,372 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 08.01 02:02:12" (2/2) ... [2019-01-08 14:02:12,374 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-08 14:02:12,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:02:12,391 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-08 14:02:12,405 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-08 14:02:12,435 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:02:12,436 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:02:12,436 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:02:12,436 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:02:12,436 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:02:12,437 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:02:12,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:02:12,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:02:12,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-08 14:02:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:02:12,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:12,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:02:12,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-08 14:02:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:12,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:12,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:12,638 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-08 14:02:12,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:12,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:02:12,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:12,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:02:12,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:02:12,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:12,665 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-08 14:02:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:12,858 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-08 14:02:12,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:12,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:02:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:12,873 INFO L225 Difference]: With dead ends: 17 [2019-01-08 14:02:12,874 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 14:02:12,877 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-08 14:02:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 14:02:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-08 14:02:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 14:02:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-08 14:02:12,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-08 14:02:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:12,916 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-08 14:02:12,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:02:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-08 14:02:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:12,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:12,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:12,917 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-08 14:02:12,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:12,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:12,992 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-08 14:02:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:12,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:02:12,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:12,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:02:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:02:12,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:12,995 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-08 14:02:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:13,199 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-08 14:02:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:13,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:02:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:13,201 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:02:13,201 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 14:02:13,202 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-08 14:02:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 14:02:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-08 14:02:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:02:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-08 14:02:13,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-08 14:02:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:13,206 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-08 14:02:13,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:02:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-08 14:02:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:13,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:13,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:13,207 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-08 14:02:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:13,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:13,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:13,297 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-08 14:02:13,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:13,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:13,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:02:13,300 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-08 14:02:13,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:13,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:13,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:13,401 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-08 14:02:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:13,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:13,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:13,407 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-08 14:02:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:13,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:13,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:13,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:13,525 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-08 14:02:13,651 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-08 14:02:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:13,666 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-08 14:02:13,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,849 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-08 14:02:13,862 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-08 14:02:13,881 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-08 14:02:13,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:13,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,030 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-08 14:02:14,031 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:14,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:14,077 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-08 14:02:14,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,097 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-08 14:02:14,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:14,129 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-08 14:02:14,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:14,196 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-08 14:02:14,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:14,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:02:14,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:14,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:02:14,229 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-08 14:02:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:14,343 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-08 14:02:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:02:14,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:02:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:14,344 INFO L225 Difference]: With dead ends: 13 [2019-01-08 14:02:14,345 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 14:02:14,345 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-08 14:02:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 14:02:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-08 14:02:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 14:02:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-08 14:02:14,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-08 14:02:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:14,350 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-08 14:02:14,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-08 14:02:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:14,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:14,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:14,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-08 14:02:14,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:14,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:14,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:14,435 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-08 14:02:14,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:14,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:14,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:02:14,436 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-08 14:02:14,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:14,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:14,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:14,447 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-08 14:02:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:14,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:14,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:14,448 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-08 14:02:14,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:14,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:14,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:14,548 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-08 14:02:14,653 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-08 14:02:14,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:14,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:14,682 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-08 14:02:14,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,747 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-08 14:02:14,754 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-08 14:02:14,763 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-08 14:02:14,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:14,864 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-08 14:02:14,864 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:14,980 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-08 14:02:14,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:15,178 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-08 14:02:15,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:15,294 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-08 14:02:15,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:15,318 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-08 14:02:15,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:15,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:15,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:15,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:15,339 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-08 14:02:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:15,605 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-08 14:02:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:15,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:02:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:15,607 INFO L225 Difference]: With dead ends: 24 [2019-01-08 14:02:15,607 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 14:02:15,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:02:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 14:02:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-08 14:02:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:02:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-08 14:02:15,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-08 14:02:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:15,613 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-08 14:02:15,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-08 14:02:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:15,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:15,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:15,615 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-08 14:02:15,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:15,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:15,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:15,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:15,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:15,660 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-08 14:02:15,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:02:15,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:15,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:02:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:02:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:15,662 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-08 14:02:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:15,702 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-08 14:02:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:15,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 14:02:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:15,703 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:02:15,703 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 14:02:15,704 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-08 14:02:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 14:02:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-08 14:02:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 14:02:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-08 14:02:15,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-08 14:02:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:15,711 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-08 14:02:15,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:02:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-08 14:02:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:15,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:15,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:15,712 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-08 14:02:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:15,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:15,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:15,795 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-08 14:02:15,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:15,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:15,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:15,796 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-08 14:02:15,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:15,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:15,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:15,876 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-08 14:02:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:15,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:15,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:15,877 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-08 14:02:15,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:15,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:15,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:15,934 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-08 14:02:15,938 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-08 14:02:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:15,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:15,945 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-08 14:02:15,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:15,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:15,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:15,994 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-08 14:02:16,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,035 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-08 14:02:16,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,058 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-08 14:02:16,058 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:16,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,094 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-08 14:02:16,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,189 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-08 14:02:16,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:16,218 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-08 14:02:16,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:16,258 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-08 14:02:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:16,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:16,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:16,279 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-08 14:02:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:16,433 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-08 14:02:16,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:16,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:02:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:16,434 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:02:16,434 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 14:02:16,435 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-08 14:02:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 14:02:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-08 14:02:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 14:02:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-08 14:02:16,441 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-08 14:02:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:16,441 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-08 14:02:16,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-08 14:02:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:16,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:16,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:16,442 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-08 14:02:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:16,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:16,505 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-08 14:02:16,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:16,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:16,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:16,506 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-08 14:02:16,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:16,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:16,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:16,512 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-08 14:02:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:16,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:16,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:16,513 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-08 14:02:16,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:16,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:16,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:16,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,580 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-08 14:02:16,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,625 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-08 14:02:16,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,655 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-08 14:02:16,658 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-08 14:02:16,662 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-08 14:02:16,663 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,693 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-08 14:02:16,693 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:16,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,727 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-08 14:02:16,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,758 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-08 14:02:16,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:16,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:16,829 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-08 14:02:16,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:16,859 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-08 14:02:16,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-08 14:02:16,873 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-08 14:02:16,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:16,908 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-08 14:02:16,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:16,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:16,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:16,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:16,928 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-08 14:02:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:17,159 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-08 14:02:17,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:17,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:17,160 INFO L225 Difference]: With dead ends: 35 [2019-01-08 14:02:17,161 INFO L226 Difference]: Without dead ends: 34 [2019-01-08 14:02:17,161 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-08 14:02:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-08 14:02:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-08 14:02:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 14:02:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-08 14:02:17,167 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-08 14:02:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:17,168 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-08 14:02:17,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-08 14:02:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:17,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:17,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:17,169 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-08 14:02:17,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:17,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:17,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:17,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:17,202 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-08 14:02:17,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:17,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:17,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:17,203 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-08 14:02:17,205 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:17,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:17,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:17,210 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-08 14:02:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:17,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:17,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:17,211 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-08 14:02:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:17,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:17,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:17,234 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-08 14:02:17,241 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-08 14:02:17,251 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-08 14:02:17,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,282 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-08 14:02:17,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-08 14:02:17,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,294 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-08 14:02:17,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:02:17,309 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-08 14:02:17,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:17,314 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-08 14:02:17,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:17,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-08 14:02:17,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:17,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:02:17,336 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-08 14:02:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:17,391 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-08 14:02:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:02:17,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:02:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:17,393 INFO L225 Difference]: With dead ends: 30 [2019-01-08 14:02:17,393 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 14:02:17,393 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-08 14:02:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 14:02:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-08 14:02:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 14:02:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-08 14:02:17,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-08 14:02:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:17,401 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-08 14:02:17,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-08 14:02:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:17,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:17,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:17,403 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-08 14:02:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:17,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:17,506 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-08 14:02:17,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:17,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:17,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:17,507 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-08 14:02:17,509 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:17,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:17,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:17,513 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-08 14:02:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:17,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:17,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:17,514 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-08 14:02:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:17,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:17,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:17,549 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-08 14:02:17,552 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-08 14:02:17,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,565 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-08 14:02:17,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,643 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-08 14:02:17,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,683 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-08 14:02:17,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,692 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,710 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:17,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,738 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-08 14:02:17,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,758 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-08 14:02:17,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:17,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:17,804 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-08 14:02:17,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:17,835 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-08 14:02:17,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-08 14:02:17,858 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-08 14:02:17,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:17,946 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-08 14:02:17,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:17,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:02:17,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:02:17,968 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-08 14:02:18,267 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-08 14:02:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:18,353 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-08 14:02:18,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:18,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:18,355 INFO L225 Difference]: With dead ends: 48 [2019-01-08 14:02:18,356 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 14:02:18,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:02:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 14:02:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-08 14:02:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:02:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-08 14:02:18,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-08 14:02:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:18,368 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-08 14:02:18,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-08 14:02:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:18,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:18,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:18,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:18,370 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-08 14:02:18,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:18,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:18,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:18,519 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-08 14:02:18,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:18,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:18,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:18,520 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-08 14:02:18,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:18,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:18,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:18,525 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-08 14:02:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:18,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:18,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:18,526 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-08 14:02:18,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:18,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:18,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:18,558 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-08 14:02:18,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:18,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:18,579 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-08 14:02:18,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,603 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-08 14:02:18,607 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-08 14:02:18,613 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-08 14:02:18,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,641 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-08 14:02:18,641 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-08 14:02:18,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:18,666 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-08 14:02:18,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:18,683 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-08 14:02:18,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-08 14:02:18,833 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-08 14:02:18,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:18,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-08 14:02:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:18,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:18,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:18,989 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-08 14:02:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:19,190 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-08 14:02:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:19,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:02:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:19,193 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:02:19,193 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:02:19,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:02:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:02:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-08 14:02:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:02:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-08 14:02:19,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-08 14:02:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:19,204 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-08 14:02:19,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-08 14:02:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:19,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:19,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:19,206 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-08 14:02:19,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:19,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:19,275 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-08 14:02:19,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:19,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:19,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:19,277 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-08 14:02:19,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:19,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:19,285 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:19,285 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-08 14:02:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:19,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:19,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:19,286 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-08 14:02:19,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:19,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:19,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:19,314 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-08 14:02:19,355 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-08 14:02:19,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,444 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-08 14:02:19,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,502 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-08 14:02:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,574 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-08 14:02:19,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,594 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-08 14:02:19,594 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-08 14:02:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,629 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-08 14:02:19,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,643 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-08 14:02:19,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-08 14:02:19,653 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-08 14:02:19,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:19,660 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-08 14:02:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-08 14:02:19,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:19,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:19,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:19,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:19,682 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-08 14:02:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:19,742 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-08 14:02:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:19,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:02:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:19,744 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:02:19,744 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 14:02:19,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 14:02:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-08 14:02:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:02:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-08 14:02:19,755 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-08 14:02:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:19,755 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-08 14:02:19,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-08 14:02:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:19,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:19,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:19,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-08 14:02:19,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:19,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:19,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:19,847 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-08 14:02:19,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:19,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:19,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:19,849 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-08 14:02:19,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:19,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:19,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:19,858 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-08 14:02:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:19,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:19,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:19,860 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-08 14:02:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:19,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:19,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:19,901 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-08 14:02:19,904 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-08 14:02:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,911 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-08 14:02:19,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:19,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,954 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-08 14:02:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:19,983 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-08 14:02:19,983 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,014 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:20,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,060 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-08 14:02:20,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,075 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-08 14:02:20,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:20,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:20,101 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-08 14:02:20,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,113 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-08 14:02:20,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:02:20,126 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-08 14:02:20,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:20,178 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-08 14:02:20,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:20,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:02:20,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:02:20,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:02:20,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:02:20,200 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-08 14:02:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:20,343 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-08 14:02:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:20,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-08 14:02:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:20,346 INFO L225 Difference]: With dead ends: 38 [2019-01-08 14:02:20,346 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:02:20,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:02:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:02:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-08 14:02:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:02:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-08 14:02:20,356 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-08 14:02:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:20,356 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-08 14:02:20,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:02:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-08 14:02:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:20,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:20,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:20,358 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:20,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-08 14:02:20,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:20,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:20,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:20,509 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-08 14:02:20,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:20,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:20,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:20,510 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-08 14:02:20,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:20,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:20,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:20,516 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-08 14:02:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:20,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:20,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:20,517 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-08 14:02:20,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:20,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:20,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:20,546 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-08 14:02:20,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,552 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-08 14:02:20,559 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-08 14:02:20,563 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-08 14:02:20,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,583 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,590 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-08 14:02:20,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-08 14:02:20,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,624 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-08 14:02:20,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-08 14:02:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:20,680 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-08 14:02:20,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:20,693 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-08 14:02:20,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-08 14:02:20,703 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-08 14:02:20,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:20,749 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-08 14:02:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:20,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:20,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:20,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:20,770 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-08 14:02:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:21,078 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-08 14:02:21,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:21,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:21,080 INFO L225 Difference]: With dead ends: 45 [2019-01-08 14:02:21,080 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 14:02:21,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:02:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 14:02:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-08 14:02:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:02:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-08 14:02:21,098 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-08 14:02:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:21,099 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-08 14:02:21,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-08 14:02:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:21,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:21,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:21,100 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-08 14:02:21,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:21,198 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-08 14:02:21,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:21,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:21,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:21,200 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-08 14:02:21,201 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:21,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:21,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:21,205 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-08 14:02:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:21,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:21,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:21,205 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-08 14:02:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:21,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:21,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:21,224 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-08 14:02:21,227 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-08 14:02:21,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,235 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-08 14:02:21,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,272 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-08 14:02:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,289 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-08 14:02:21,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,309 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-08 14:02:21,310 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-08 14:02:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,332 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-08 14:02:21,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-08 14:02:21,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,352 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-08 14:02:21,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,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-08 14:02:21,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-08 14:02:21,397 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-08 14:02:21,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:21,417 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-08 14:02:21,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:21,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:21,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:21,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:21,438 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-08 14:02:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:21,587 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-08 14:02:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:21,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:21,589 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:02:21,590 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:02:21,590 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-08 14:02:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:02:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-08 14:02:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 14:02:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-08 14:02:21,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-08 14:02:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:21,604 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-08 14:02:21,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-08 14:02:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:21,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:21,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:21,606 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-08 14:02:21,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:21,760 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-08 14:02:21,804 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-08 14:02:21,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:21,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:21,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:21,805 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-08 14:02:21,807 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:21,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:21,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:21,811 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-08 14:02:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:21,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:21,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:21,812 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-08 14:02:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:21,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:21,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,868 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-08 14:02:21,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,893 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-08 14:02:21,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,911 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-08 14:02:21,915 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-08 14:02:21,918 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-08 14:02:21,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:21,984 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-08 14:02:21,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:21,998 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-08 14:02:21,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:22,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,044 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:22,045 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-08 14:02:22,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,059 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-08 14:02:22,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-08 14:02:22,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,085 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-08 14:02:22,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,099 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-08 14:02:22,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-08 14:02:22,116 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-08 14:02:22,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:22,166 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-08 14:02:22,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:22,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:02:22,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:22,187 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-08 14:02:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:22,428 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-08 14:02:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:02:22,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:02:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:22,429 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:02:22,429 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 14:02:22,430 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-08 14:02:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 14:02:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-08 14:02:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 14:02:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-08 14:02:22,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-08 14:02:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:22,441 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-08 14:02:22,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-08 14:02:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:22,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:22,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:22,442 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-08 14:02:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:22,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:22,644 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-08 14:02:22,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:22,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:22,645 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:22,645 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-08 14:02:22,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:22,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:22,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:22,653 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-08 14:02:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:22,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:22,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:22,653 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-08 14:02:22,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:22,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:22,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:22,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, 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-08 14:02:22,680 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-08 14:02:22,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,688 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-08 14:02:22,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,723 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-08 14:02:22,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,743 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-08 14:02:22,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,750 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,765 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-08 14:02:22,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,823 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-08 14:02:22,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:02:22,877 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-08 14:02:22,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-08 14:02:22,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,953 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-08 14:02:22,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:22,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:22,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:22,998 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-08 14:02:22,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,027 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-08 14:02:23,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-08 14:02:23,080 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-08 14:02:23,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:23,117 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-08 14:02:23,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:23,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-08 14:02:23,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:23,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:02:23,138 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-08 14:02:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:23,441 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-08 14:02:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:02:23,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:02:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:23,442 INFO L225 Difference]: With dead ends: 28 [2019-01-08 14:02:23,442 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:02:23,443 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-08 14:02:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:02:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-08 14:02:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 14:02:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-08 14:02:23,451 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-08 14:02:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:23,452 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-08 14:02:23,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-08 14:02:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:23,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:23,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:23,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-08 14:02:23,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:23,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:23,564 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-08 14:02:23,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:23,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:23,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:23,565 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-08 14:02:23,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:23,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:23,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:23,570 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-08 14:02:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:23,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:23,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:23,570 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-08 14:02:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:23,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:23,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,599 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-08 14:02:23,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,620 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-08 14:02:23,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,647 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-08 14:02:23,650 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-08 14:02:23,653 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-08 14:02:23,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,663 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,680 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-08 14:02:23,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,781 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-08 14:02:23,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,795 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-08 14:02:23,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-08 14:02:23,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,822 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-08 14:02:23,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,838 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-08 14:02:23,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-08 14:02:23,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,866 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:23,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:23,868 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-08 14:02:23,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:23,890 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-08 14:02:23,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-08 14:02:23,906 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-08 14:02:23,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:23,943 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-08 14:02:23,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:23,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:02:23,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:23,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:02:23,963 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-08 14:02:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:24,205 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-08 14:02:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:02:24,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:02:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:24,206 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:02:24,206 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:02:24,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:02:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:02:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:02:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:02:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:02:24,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-08 14:02:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:24,208 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:02:24,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:02:24,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:02:24,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:02:24,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:02:24,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:02:24,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:02:24,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:02:24,370 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-08 14:02:26,551 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-08 14:02:26,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:02:26,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:02:26,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-08 14:02:26,555 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-08 14:02:26,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-08 14:02:26,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-08 14:02:26,556 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-08 14:02:26,556 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-08 14:02:26,556 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-08 14:02:26,567 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:02:26 BoogieIcfgContainer [2019-01-08 14:02:26,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:02:26,568 INFO L168 Benchmark]: Toolchain (without parser) took 14589.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -548.7 MB). Peak memory consumption was 265.5 MB. Max. memory is 7.1 GB. [2019-01-08 14:02:26,568 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:02:26,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:02:26,568 INFO L168 Benchmark]: Boogie Preprocessor took 21.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:02:26,568 INFO L168 Benchmark]: RCFGBuilder took 303.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:02:26,569 INFO L168 Benchmark]: TraceAbstraction took 14199.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -569.8 MB). Peak memory consumption was 244.4 MB. Max. memory is 7.1 GB. [2019-01-08 14:02:26,571 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 303.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14199.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -569.8 MB). Peak memory consumption was 244.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - 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 - 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, 14.1s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s 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, 2.1s 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...